./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/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_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6029e5a48177b265da8d69ef0b285080ea9366bff1fe25e3f3180b0cf8b63df5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:24:54,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:24:54,879 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 04:24:54,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:24:54,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:24:54,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:24:54,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:24:54,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:24:54,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:24:54,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:24:54,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:24:54,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:24:54,925 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:24:54,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:24:54,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:24:54,926 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:24:54,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:24:54,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:24:54,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:24:54,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:24:54,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:24:54,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:24:54,938 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 04:24:54,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:24:54,939 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:24:54,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:24:54,940 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:24:54,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:24:54,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:24:54,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:24:54,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:24:54,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:24:54,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:24:54,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:24:54,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:24:54,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:24:54,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:24:54,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:24:54,943 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:24:54,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:24:54,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:24:54,944 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_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6029e5a48177b265da8d69ef0b285080ea9366bff1fe25e3f3180b0cf8b63df5 [2023-11-29 04:24:55,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:24:55,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:24:55,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:24:55,176 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:24:55,176 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:24:55,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i [2023-11-29 04:24:57,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:24:58,199 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:24:58,200 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i [2023-11-29 04:24:58,217 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/data/e269957db/36c15eef46a14b75a7089d2d8374a4c0/FLAG6cccab820 [2023-11-29 04:24:58,232 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/data/e269957db/36c15eef46a14b75a7089d2d8374a4c0 [2023-11-29 04:24:58,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:24:58,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:24:58,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:24:58,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:24:58,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:24:58,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e615ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58, skipping insertion in model container [2023-11-29 04:24:58,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,294 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:24:58,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:24:58,764 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:24:58,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:24:58,873 WARN L675 CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:24:58,882 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:24:58,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58 WrapperNode [2023-11-29 04:24:58,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:24:58,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:24:58,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:24:58,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:24:58,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,939 INFO L138 Inliner]: procedures = 281, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2023-11-29 04:24:58,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:24:58,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:24:58,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:24:58,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:24:58,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:24:58,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:24:58,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:24:58,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:24:58,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (1/1) ... [2023-11-29 04:24:58,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:24:58,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:24:59,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:24:59,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:24:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:24:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 04:24:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:24:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-29 04:24:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 04:24:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 04:24:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 04:24:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 04:24:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:24:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:24:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2023-11-29 04:24:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 04:24:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-29 04:24:59,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-29 04:24:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:24:59,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:24:59,031 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:24:59,173 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:24:59,175 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:24:59,499 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:24:59,536 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:24:59,536 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 04:24:59,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:24:59 BoogieIcfgContainer [2023-11-29 04:24:59,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:24:59,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:24:59,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:24:59,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:24:59,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:24:58" (1/3) ... [2023-11-29 04:24:59,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb2c6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:24:59, skipping insertion in model container [2023-11-29 04:24:59,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:24:58" (2/3) ... [2023-11-29 04:24:59,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb2c6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:24:59, skipping insertion in model container [2023-11-29 04:24:59,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:24:59" (3/3) ... [2023-11-29 04:24:59,561 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race-3.i [2023-11-29 04:24:59,569 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 04:24:59,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:24:59,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-11-29 04:24:59,585 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:24:59,680 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 04:24:59,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 198 transitions, 403 flow [2023-11-29 04:24:59,815 INFO L124 PetriNetUnfolderBase]: 16/287 cut-off events. [2023-11-29 04:24:59,815 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 04:24:59,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 287 events. 16/287 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 619 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. [2023-11-29 04:24:59,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 198 transitions, 403 flow [2023-11-29 04:24:59,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 198 transitions, 403 flow [2023-11-29 04:24:59,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:24:59,846 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a46650e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:24:59,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-29 04:24:59,854 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:24:59,855 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-29 04:24:59,855 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:24:59,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:24:59,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:24:59,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:24:59,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:24:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1937937021, now seen corresponding path program 1 times [2023-11-29 04:24:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:24:59,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287561209] [2023-11-29 04:24:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:24:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:24:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287561209] [2023-11-29 04:25:00,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287561209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:00,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:00,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:25:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883534965] [2023-11-29 04:25:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:00,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:25:00,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:25:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:25:00,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198 [2023-11-29 04:25:00,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:00,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198 [2023-11-29 04:25:00,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:00,312 INFO L124 PetriNetUnfolderBase]: 34/480 cut-off events. [2023-11-29 04:25:00,312 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 04:25:00,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 480 events. 34/480 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1824 event pairs, 12 based on Foata normal form. 10/421 useless extension candidates. Maximal degree in co-relation 373. Up to 41 conditions per place. [2023-11-29 04:25:00,318 INFO L140 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 2 changer transitions 2/193 dead transitions. [2023-11-29 04:25:00,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 421 flow [2023-11-29 04:25:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:25:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:25:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-11-29 04:25:00,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.936026936026936 [2023-11-29 04:25:00,336 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-11-29 04:25:00,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-11-29 04:25:00,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:00,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-11-29 04:25:00,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,355 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,357 INFO L175 Difference]: Start difference. First operand has 190 places, 198 transitions, 403 flow. Second operand 3 states and 556 transitions. [2023-11-29 04:25:00,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 421 flow [2023-11-29 04:25:00,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 193 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:25:00,389 INFO L231 Difference]: Finished difference. Result has 191 places, 191 transitions, 393 flow [2023-11-29 04:25:00,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=191, PETRI_TRANSITIONS=191} [2023-11-29 04:25:00,395 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places. [2023-11-29 04:25:00,395 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 393 flow [2023-11-29 04:25:00,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:00,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:00,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:25:00,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:00,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1004342350, now seen corresponding path program 1 times [2023-11-29 04:25:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026921052] [2023-11-29 04:25:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:00,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026921052] [2023-11-29 04:25:00,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026921052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:00,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:25:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089288321] [2023-11-29 04:25:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:00,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:25:00,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:00,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:25:00,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:25:00,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198 [2023-11-29 04:25:00,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:00,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198 [2023-11-29 04:25:00,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:00,703 INFO L124 PetriNetUnfolderBase]: 87/676 cut-off events. [2023-11-29 04:25:00,703 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 04:25:00,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 676 events. 87/676 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3282 event pairs, 17 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 757. Up to 64 conditions per place. [2023-11-29 04:25:00,709 INFO L140 encePairwiseOnDemand]: 187/198 looper letters, 21 selfloop transitions, 8 changer transitions 0/203 dead transitions. [2023-11-29 04:25:00,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 203 transitions, 475 flow [2023-11-29 04:25:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:25:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:25:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2023-11-29 04:25:00,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9478114478114478 [2023-11-29 04:25:00,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2023-11-29 04:25:00,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2023-11-29 04:25:00,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:00,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2023-11-29 04:25:00,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,718 INFO L175 Difference]: Start difference. First operand has 191 places, 191 transitions, 393 flow. Second operand 3 states and 563 transitions. [2023-11-29 04:25:00,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 203 transitions, 475 flow [2023-11-29 04:25:00,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 203 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:25:00,725 INFO L231 Difference]: Finished difference. Result has 191 places, 199 transitions, 459 flow [2023-11-29 04:25:00,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=191, PETRI_TRANSITIONS=199} [2023-11-29 04:25:00,726 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places. [2023-11-29 04:25:00,727 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 199 transitions, 459 flow [2023-11-29 04:25:00,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:00,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:00,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:25:00,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:00,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1244629649, now seen corresponding path program 1 times [2023-11-29 04:25:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78796234] [2023-11-29 04:25:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78796234] [2023-11-29 04:25:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78796234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:25:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950660694] [2023-11-29 04:25:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:00,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:25:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:25:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:25:00,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198 [2023-11-29 04:25:00,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 199 transitions, 459 flow. Second operand has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:00,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:00,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198 [2023-11-29 04:25:00,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:01,111 INFO L124 PetriNetUnfolderBase]: 68/710 cut-off events. [2023-11-29 04:25:01,111 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-29 04:25:01,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 710 events. 68/710 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3447 event pairs, 7 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 685. Up to 61 conditions per place. [2023-11-29 04:25:01,116 INFO L140 encePairwiseOnDemand]: 190/198 looper letters, 19 selfloop transitions, 6 changer transitions 1/208 dead transitions. [2023-11-29 04:25:01,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 208 transitions, 529 flow [2023-11-29 04:25:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:25:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:25:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1089 transitions. [2023-11-29 04:25:01,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2023-11-29 04:25:01,121 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1089 transitions. [2023-11-29 04:25:01,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1089 transitions. [2023-11-29 04:25:01,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:01,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1089 transitions. [2023-11-29 04:25:01,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:01,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:01,132 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:01,133 INFO L175 Difference]: Start difference. First operand has 191 places, 199 transitions, 459 flow. Second operand 6 states and 1089 transitions. [2023-11-29 04:25:01,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 208 transitions, 529 flow [2023-11-29 04:25:01,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 208 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:25:01,150 INFO L231 Difference]: Finished difference. Result has 198 places, 203 transitions, 485 flow [2023-11-29 04:25:01,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=198, PETRI_TRANSITIONS=203} [2023-11-29 04:25:01,152 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 8 predicate places. [2023-11-29 04:25:01,152 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 485 flow [2023-11-29 04:25:01,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:01,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:01,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:01,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:25:01,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:01,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1556745056, now seen corresponding path program 1 times [2023-11-29 04:25:01,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:01,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617123843] [2023-11-29 04:25:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617123843] [2023-11-29 04:25:01,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617123843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:01,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:01,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:25:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79796802] [2023-11-29 04:25:01,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:01,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:25:01,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:25:01,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:25:01,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2023-11-29 04:25:01,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 203 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:01,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:01,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2023-11-29 04:25:01,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:02,194 INFO L124 PetriNetUnfolderBase]: 300/1732 cut-off events. [2023-11-29 04:25:02,195 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 04:25:02,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 1732 events. 300/1732 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12657 event pairs, 35 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 2225. Up to 300 conditions per place. [2023-11-29 04:25:02,208 INFO L140 encePairwiseOnDemand]: 175/198 looper letters, 52 selfloop transitions, 29 changer transitions 0/252 dead transitions. [2023-11-29 04:25:02,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 252 transitions, 748 flow [2023-11-29 04:25:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:25:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:25:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions. [2023-11-29 04:25:02,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-29 04:25:02,212 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1056 transitions. [2023-11-29 04:25:02,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1056 transitions. [2023-11-29 04:25:02,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:02,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1056 transitions. [2023-11-29 04:25:02,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,222 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,222 INFO L175 Difference]: Start difference. First operand has 198 places, 203 transitions, 485 flow. Second operand 6 states and 1056 transitions. [2023-11-29 04:25:02,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 252 transitions, 748 flow [2023-11-29 04:25:02,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 252 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:25:02,230 INFO L231 Difference]: Finished difference. Result has 207 places, 232 transitions, 703 flow [2023-11-29 04:25:02,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=207, PETRI_TRANSITIONS=232} [2023-11-29 04:25:02,232 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 17 predicate places. [2023-11-29 04:25:02,232 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 232 transitions, 703 flow [2023-11-29 04:25:02,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:02,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:02,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:25:02,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:02,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2025628928, now seen corresponding path program 1 times [2023-11-29 04:25:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587092381] [2023-11-29 04:25:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:02,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587092381] [2023-11-29 04:25:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587092381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:02,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:25:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640806935] [2023-11-29 04:25:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:02,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:25:02,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:02,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:25:02,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:25:02,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 198 [2023-11-29 04:25:02,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 232 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:02,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 198 [2023-11-29 04:25:02,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:02,533 INFO L124 PetriNetUnfolderBase]: 205/1519 cut-off events. [2023-11-29 04:25:02,534 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2023-11-29 04:25:02,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1519 events. 205/1519 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10689 event pairs, 20 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 1935. Up to 114 conditions per place. [2023-11-29 04:25:02,545 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 13 selfloop transitions, 2 changer transitions 4/234 dead transitions. [2023-11-29 04:25:02,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 234 transitions, 737 flow [2023-11-29 04:25:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:25:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:25:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2023-11-29 04:25:02,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9427609427609428 [2023-11-29 04:25:02,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2023-11-29 04:25:02,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2023-11-29 04:25:02,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:02,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2023-11-29 04:25:02,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,556 INFO L175 Difference]: Start difference. First operand has 207 places, 232 transitions, 703 flow. Second operand 3 states and 560 transitions. [2023-11-29 04:25:02,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 234 transitions, 737 flow [2023-11-29 04:25:02,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 234 transitions, 737 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:25:02,565 INFO L231 Difference]: Finished difference. Result has 208 places, 228 transitions, 689 flow [2023-11-29 04:25:02,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=208, PETRI_TRANSITIONS=228} [2023-11-29 04:25:02,567 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 18 predicate places. [2023-11-29 04:25:02,567 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 228 transitions, 689 flow [2023-11-29 04:25:02,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:02,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:02,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:25:02,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:02,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -90704727, now seen corresponding path program 1 times [2023-11-29 04:25:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:02,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766219033] [2023-11-29 04:25:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766219033] [2023-11-29 04:25:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766219033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:02,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:02,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:25:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670152866] [2023-11-29 04:25:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:02,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:25:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:02,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:25:02,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:25:02,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198 [2023-11-29 04:25:02,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 228 transitions, 689 flow. Second operand has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:02,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:02,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198 [2023-11-29 04:25:02,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:03,000 INFO L124 PetriNetUnfolderBase]: 194/1407 cut-off events. [2023-11-29 04:25:03,000 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 04:25:03,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 1407 events. 194/1407 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9779 event pairs, 36 based on Foata normal form. 1/1271 useless extension candidates. Maximal degree in co-relation 1976. Up to 133 conditions per place. [2023-11-29 04:25:03,012 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions. [2023-11-29 04:25:03,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 234 transitions, 743 flow [2023-11-29 04:25:03,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:25:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:25:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2023-11-29 04:25:03,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9318181818181818 [2023-11-29 04:25:03,016 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2023-11-29 04:25:03,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2023-11-29 04:25:03,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:03,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2023-11-29 04:25:03,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,023 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,023 INFO L175 Difference]: Start difference. First operand has 208 places, 228 transitions, 689 flow. Second operand 4 states and 738 transitions. [2023-11-29 04:25:03,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 234 transitions, 743 flow [2023-11-29 04:25:03,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 234 transitions, 731 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 04:25:03,035 INFO L231 Difference]: Finished difference. Result has 206 places, 231 transitions, 702 flow [2023-11-29 04:25:03,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=702, PETRI_PLACES=206, PETRI_TRANSITIONS=231} [2023-11-29 04:25:03,036 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 16 predicate places. [2023-11-29 04:25:03,037 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 231 transitions, 702 flow [2023-11-29 04:25:03,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:03,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:03,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:25:03,038 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:03,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:03,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1702736661, now seen corresponding path program 1 times [2023-11-29 04:25:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:03,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088374284] [2023-11-29 04:25:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:03,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:03,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:03,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088374284] [2023-11-29 04:25:03,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088374284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:03,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:03,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:25:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860772724] [2023-11-29 04:25:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:03,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:25:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:25:03,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:25:03,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198 [2023-11-29 04:25:03,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 231 transitions, 702 flow. Second operand has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:03,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198 [2023-11-29 04:25:03,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:03,444 INFO L124 PetriNetUnfolderBase]: 193/1405 cut-off events. [2023-11-29 04:25:03,444 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-11-29 04:25:03,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 1405 events. 193/1405 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9781 event pairs, 36 based on Foata normal form. 1/1266 useless extension candidates. Maximal degree in co-relation 1980. Up to 133 conditions per place. [2023-11-29 04:25:03,456 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 16 selfloop transitions, 4 changer transitions 0/233 dead transitions. [2023-11-29 04:25:03,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 233 transitions, 746 flow [2023-11-29 04:25:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:25:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:25:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions. [2023-11-29 04:25:03,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9305555555555556 [2023-11-29 04:25:03,459 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 737 transitions. [2023-11-29 04:25:03,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions. [2023-11-29 04:25:03,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:03,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions. [2023-11-29 04:25:03,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,465 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,465 INFO L175 Difference]: Start difference. First operand has 206 places, 231 transitions, 702 flow. Second operand 4 states and 737 transitions. [2023-11-29 04:25:03,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 233 transitions, 746 flow [2023-11-29 04:25:03,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 233 transitions, 746 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:25:03,475 INFO L231 Difference]: Finished difference. Result has 211 places, 232 transitions, 721 flow [2023-11-29 04:25:03,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=721, PETRI_PLACES=211, PETRI_TRANSITIONS=232} [2023-11-29 04:25:03,477 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 21 predicate places. [2023-11-29 04:25:03,477 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 232 transitions, 721 flow [2023-11-29 04:25:03,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:03,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:03,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:25:03,478 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:03,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash -188589783, now seen corresponding path program 1 times [2023-11-29 04:25:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054580613] [2023-11-29 04:25:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:03,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:03,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054580613] [2023-11-29 04:25:03,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054580613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:03,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:03,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:25:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916099028] [2023-11-29 04:25:03,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:03,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:25:03,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:03,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:25:03,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:25:03,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198 [2023-11-29 04:25:03,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 232 transitions, 721 flow. Second operand has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:03,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198 [2023-11-29 04:25:03,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:03,877 INFO L124 PetriNetUnfolderBase]: 192/1403 cut-off events. [2023-11-29 04:25:03,878 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2023-11-29 04:25:03,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 1403 events. 192/1403 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9758 event pairs, 36 based on Foata normal form. 1/1272 useless extension candidates. Maximal degree in co-relation 2047. Up to 133 conditions per place. [2023-11-29 04:25:03,889 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions. [2023-11-29 04:25:03,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 234 transitions, 767 flow [2023-11-29 04:25:03,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:25:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:25:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2023-11-29 04:25:03,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9318181818181818 [2023-11-29 04:25:03,892 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2023-11-29 04:25:03,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2023-11-29 04:25:03,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:03,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2023-11-29 04:25:03,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,898 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,899 INFO L175 Difference]: Start difference. First operand has 211 places, 232 transitions, 721 flow. Second operand 4 states and 738 transitions. [2023-11-29 04:25:03,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 234 transitions, 767 flow [2023-11-29 04:25:03,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 234 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:25:03,909 INFO L231 Difference]: Finished difference. Result has 214 places, 232 transitions, 730 flow [2023-11-29 04:25:03,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=730, PETRI_PLACES=214, PETRI_TRANSITIONS=232} [2023-11-29 04:25:03,910 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places. [2023-11-29 04:25:03,910 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 232 transitions, 730 flow [2023-11-29 04:25:03,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:03,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:03,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:03,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:25:03,912 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:03,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash -426481603, now seen corresponding path program 1 times [2023-11-29 04:25:03,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:03,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166218108] [2023-11-29 04:25:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166218108] [2023-11-29 04:25:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166218108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:03,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:03,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:25:03,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121547281] [2023-11-29 04:25:03,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:03,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:25:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:25:04,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:25:04,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 198 [2023-11-29 04:25:04,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 232 transitions, 730 flow. Second operand has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:04,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 198 [2023-11-29 04:25:04,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:04,306 INFO L124 PetriNetUnfolderBase]: 195/1405 cut-off events. [2023-11-29 04:25:04,307 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2023-11-29 04:25:04,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 1405 events. 195/1405 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9798 event pairs, 40 based on Foata normal form. 1/1272 useless extension candidates. Maximal degree in co-relation 2067. Up to 143 conditions per place. [2023-11-29 04:25:04,317 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/233 dead transitions. [2023-11-29 04:25:04,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 233 transitions, 774 flow [2023-11-29 04:25:04,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:25:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:25:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions. [2023-11-29 04:25:04,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9267676767676768 [2023-11-29 04:25:04,320 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 734 transitions. [2023-11-29 04:25:04,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions. [2023-11-29 04:25:04,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:04,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions. [2023-11-29 04:25:04,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,326 INFO L175 Difference]: Start difference. First operand has 214 places, 232 transitions, 730 flow. Second operand 4 states and 734 transitions. [2023-11-29 04:25:04,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 233 transitions, 774 flow [2023-11-29 04:25:04,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 233 transitions, 766 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:25:04,336 INFO L231 Difference]: Finished difference. Result has 215 places, 232 transitions, 734 flow [2023-11-29 04:25:04,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=215, PETRI_TRANSITIONS=232} [2023-11-29 04:25:04,337 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 25 predicate places. [2023-11-29 04:25:04,338 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 232 transitions, 734 flow [2023-11-29 04:25:04,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:04,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:04,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:25:04,339 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:04,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash 118216292, now seen corresponding path program 1 times [2023-11-29 04:25:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:04,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326816621] [2023-11-29 04:25:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:04,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:04,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326816621] [2023-11-29 04:25:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326816621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:04,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:04,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:25:04,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306168057] [2023-11-29 04:25:04,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:04,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:25:04,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:04,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:25:04,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:25:04,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198 [2023-11-29 04:25:04,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 232 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:04,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198 [2023-11-29 04:25:04,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:04,657 INFO L124 PetriNetUnfolderBase]: 216/1481 cut-off events. [2023-11-29 04:25:04,657 INFO L125 PetriNetUnfolderBase]: For 187/196 co-relation queries the response was YES. [2023-11-29 04:25:04,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2307 conditions, 1481 events. 216/1481 cut-off events. For 187/196 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10499 event pairs, 35 based on Foata normal form. 1/1339 useless extension candidates. Maximal degree in co-relation 2255. Up to 171 conditions per place. [2023-11-29 04:25:04,669 INFO L140 encePairwiseOnDemand]: 192/198 looper letters, 22 selfloop transitions, 7 changer transitions 0/239 dead transitions. [2023-11-29 04:25:04,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 239 transitions, 812 flow [2023-11-29 04:25:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:25:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:25:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2023-11-29 04:25:04,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9343434343434344 [2023-11-29 04:25:04,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2023-11-29 04:25:04,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2023-11-29 04:25:04,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:04,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2023-11-29 04:25:04,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,676 INFO L175 Difference]: Start difference. First operand has 215 places, 232 transitions, 734 flow. Second operand 3 states and 555 transitions. [2023-11-29 04:25:04,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 239 transitions, 812 flow [2023-11-29 04:25:04,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 239 transitions, 804 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:25:04,685 INFO L231 Difference]: Finished difference. Result has 216 places, 237 transitions, 782 flow [2023-11-29 04:25:04,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=216, PETRI_TRANSITIONS=237} [2023-11-29 04:25:04,687 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 26 predicate places. [2023-11-29 04:25:04,687 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 237 transitions, 782 flow [2023-11-29 04:25:04,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:04,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:04,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:04,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:25:04,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:04,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1479071995, now seen corresponding path program 1 times [2023-11-29 04:25:04,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:04,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317386297] [2023-11-29 04:25:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317386297] [2023-11-29 04:25:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317386297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:05,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:05,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:25:05,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462903081] [2023-11-29 04:25:05,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:05,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:25:05,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:25:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:25:05,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 198 [2023-11-29 04:25:05,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 237 transitions, 782 flow. Second operand has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:05,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:05,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 198 [2023-11-29 04:25:05,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:05,986 INFO L124 PetriNetUnfolderBase]: 570/2731 cut-off events. [2023-11-29 04:25:05,986 INFO L125 PetriNetUnfolderBase]: For 658/695 co-relation queries the response was YES. [2023-11-29 04:25:05,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4917 conditions, 2731 events. 570/2731 cut-off events. For 658/695 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 22408 event pairs, 129 based on Foata normal form. 7/2477 useless extension candidates. Maximal degree in co-relation 4870. Up to 768 conditions per place. [2023-11-29 04:25:06,006 INFO L140 encePairwiseOnDemand]: 175/198 looper letters, 64 selfloop transitions, 83 changer transitions 0/326 dead transitions. [2023-11-29 04:25:06,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 326 transitions, 1428 flow [2023-11-29 04:25:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:25:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:25:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions. [2023-11-29 04:25:06,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9065656565656566 [2023-11-29 04:25:06,010 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions. [2023-11-29 04:25:06,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions. [2023-11-29 04:25:06,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:06,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions. [2023-11-29 04:25:06,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:06,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:06,018 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:06,018 INFO L175 Difference]: Start difference. First operand has 216 places, 237 transitions, 782 flow. Second operand 6 states and 1077 transitions. [2023-11-29 04:25:06,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 326 transitions, 1428 flow [2023-11-29 04:25:06,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 326 transitions, 1414 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:25:06,033 INFO L231 Difference]: Finished difference. Result has 224 places, 318 transitions, 1504 flow [2023-11-29 04:25:06,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1504, PETRI_PLACES=224, PETRI_TRANSITIONS=318} [2023-11-29 04:25:06,034 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 34 predicate places. [2023-11-29 04:25:06,035 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 318 transitions, 1504 flow [2023-11-29 04:25:06,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:06,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:06,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:06,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:25:06,036 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:06,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2109754094, now seen corresponding path program 1 times [2023-11-29 04:25:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484880061] [2023-11-29 04:25:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:25:06,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484880061] [2023-11-29 04:25:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484880061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:06,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:06,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:25:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099869315] [2023-11-29 04:25:06,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:06,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:25:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:06,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:25:06,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:25:06,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 198 [2023-11-29 04:25:06,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 318 transitions, 1504 flow. Second operand has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:06,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:06,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 198 [2023-11-29 04:25:06,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:07,286 INFO L124 PetriNetUnfolderBase]: 520/2366 cut-off events. [2023-11-29 04:25:07,287 INFO L125 PetriNetUnfolderBase]: For 1328/1353 co-relation queries the response was YES. [2023-11-29 04:25:07,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5133 conditions, 2366 events. 520/2366 cut-off events. For 1328/1353 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 18293 event pairs, 65 based on Foata normal form. 0/2205 useless extension candidates. Maximal degree in co-relation 5078. Up to 434 conditions per place. [2023-11-29 04:25:07,307 INFO L140 encePairwiseOnDemand]: 187/198 looper letters, 54 selfloop transitions, 43 changer transitions 12/366 dead transitions. [2023-11-29 04:25:07,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 366 transitions, 2003 flow [2023-11-29 04:25:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:25:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:25:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions. [2023-11-29 04:25:07,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2023-11-29 04:25:07,311 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1080 transitions. [2023-11-29 04:25:07,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1080 transitions. [2023-11-29 04:25:07,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:07,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1080 transitions. [2023-11-29 04:25:07,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:07,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:07,319 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:07,319 INFO L175 Difference]: Start difference. First operand has 224 places, 318 transitions, 1504 flow. Second operand 6 states and 1080 transitions. [2023-11-29 04:25:07,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 366 transitions, 2003 flow [2023-11-29 04:25:07,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 366 transitions, 1949 flow, removed 27 selfloop flow, removed 0 redundant places. [2023-11-29 04:25:07,345 INFO L231 Difference]: Finished difference. Result has 234 places, 350 transitions, 1907 flow [2023-11-29 04:25:07,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=234, PETRI_TRANSITIONS=350} [2023-11-29 04:25:07,346 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 44 predicate places. [2023-11-29 04:25:07,347 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 350 transitions, 1907 flow [2023-11-29 04:25:07,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:07,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:07,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:07,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:25:07,348 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:07,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash 290651844, now seen corresponding path program 1 times [2023-11-29 04:25:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792729303] [2023-11-29 04:25:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:25:07,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:07,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792729303] [2023-11-29 04:25:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792729303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:07,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:07,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:25:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472653818] [2023-11-29 04:25:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:07,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:25:07,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:08,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:25:08,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:25:08,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 198 [2023-11-29 04:25:08,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 350 transitions, 1907 flow. Second operand has 10 states, 10 states have (on average 157.1) internal successors, (1571), 10 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:08,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:08,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 198 [2023-11-29 04:25:08,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:09,341 INFO L124 PetriNetUnfolderBase]: 627/2795 cut-off events. [2023-11-29 04:25:09,342 INFO L125 PetriNetUnfolderBase]: For 2134/2256 co-relation queries the response was YES. [2023-11-29 04:25:09,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6645 conditions, 2795 events. 627/2795 cut-off events. For 2134/2256 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 23362 event pairs, 114 based on Foata normal form. 67/2645 useless extension candidates. Maximal degree in co-relation 6589. Up to 527 conditions per place. [2023-11-29 04:25:09,363 INFO L140 encePairwiseOnDemand]: 182/198 looper letters, 220 selfloop transitions, 73 changer transitions 1/462 dead transitions. [2023-11-29 04:25:09,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 462 transitions, 3201 flow [2023-11-29 04:25:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:25:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 04:25:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1839 transitions. [2023-11-29 04:25:09,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8443526170798898 [2023-11-29 04:25:09,368 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1839 transitions. [2023-11-29 04:25:09,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1839 transitions. [2023-11-29 04:25:09,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:09,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1839 transitions. [2023-11-29 04:25:09,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 167.1818181818182) internal successors, (1839), 11 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:09,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:09,379 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:09,379 INFO L175 Difference]: Start difference. First operand has 234 places, 350 transitions, 1907 flow. Second operand 11 states and 1839 transitions. [2023-11-29 04:25:09,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 462 transitions, 3201 flow [2023-11-29 04:25:09,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 462 transitions, 3165 flow, removed 18 selfloop flow, removed 0 redundant places. [2023-11-29 04:25:09,401 INFO L231 Difference]: Finished difference. Result has 246 places, 374 transitions, 2339 flow [2023-11-29 04:25:09,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2339, PETRI_PLACES=246, PETRI_TRANSITIONS=374} [2023-11-29 04:25:09,403 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 56 predicate places. [2023-11-29 04:25:09,403 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 374 transitions, 2339 flow [2023-11-29 04:25:09,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 157.1) internal successors, (1571), 10 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:09,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:09,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:09,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:25:09,404 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:09,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash -118888522, now seen corresponding path program 1 times [2023-11-29 04:25:09,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:09,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838422655] [2023-11-29 04:25:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:25:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838422655] [2023-11-29 04:25:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838422655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:09,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:09,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:25:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171428791] [2023-11-29 04:25:09,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:25:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:09,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:25:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:25:10,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 198 [2023-11-29 04:25:10,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 374 transitions, 2339 flow. Second operand has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:10,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:10,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 198 [2023-11-29 04:25:10,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:10,892 INFO L124 PetriNetUnfolderBase]: 536/2490 cut-off events. [2023-11-29 04:25:10,892 INFO L125 PetriNetUnfolderBase]: For 3845/3999 co-relation queries the response was YES. [2023-11-29 04:25:10,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6613 conditions, 2490 events. 536/2490 cut-off events. For 3845/3999 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20804 event pairs, 84 based on Foata normal form. 47/2360 useless extension candidates. Maximal degree in co-relation 6546. Up to 633 conditions per place. [2023-11-29 04:25:10,905 INFO L140 encePairwiseOnDemand]: 186/198 looper letters, 161 selfloop transitions, 18 changer transitions 1/382 dead transitions. [2023-11-29 04:25:10,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 382 transitions, 2757 flow [2023-11-29 04:25:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:25:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:25:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1627 transitions. [2023-11-29 04:25:10,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8217171717171717 [2023-11-29 04:25:10,911 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1627 transitions. [2023-11-29 04:25:10,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1627 transitions. [2023-11-29 04:25:10,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:10,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1627 transitions. [2023-11-29 04:25:10,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 162.7) internal successors, (1627), 10 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:10,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:10,921 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:10,921 INFO L175 Difference]: Start difference. First operand has 246 places, 374 transitions, 2339 flow. Second operand 10 states and 1627 transitions. [2023-11-29 04:25:10,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 382 transitions, 2757 flow [2023-11-29 04:25:10,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 382 transitions, 2751 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:25:10,949 INFO L231 Difference]: Finished difference. Result has 253 places, 375 transitions, 2405 flow [2023-11-29 04:25:10,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2405, PETRI_PLACES=253, PETRI_TRANSITIONS=375} [2023-11-29 04:25:10,950 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 63 predicate places. [2023-11-29 04:25:10,950 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 375 transitions, 2405 flow [2023-11-29 04:25:10,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:10,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:10,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:10,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:25:10,951 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:10,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1408014487, now seen corresponding path program 1 times [2023-11-29 04:25:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824840577] [2023-11-29 04:25:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:10,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:10,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824840577] [2023-11-29 04:25:11,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824840577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:11,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:25:11,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:25:11,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761862827] [2023-11-29 04:25:11,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:11,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:25:11,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:11,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:25:11,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:25:11,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198 [2023-11-29 04:25:11,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 375 transitions, 2405 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:11,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:11,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198 [2023-11-29 04:25:11,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:11,428 INFO L124 PetriNetUnfolderBase]: 492/2306 cut-off events. [2023-11-29 04:25:11,428 INFO L125 PetriNetUnfolderBase]: For 3265/3333 co-relation queries the response was YES. [2023-11-29 04:25:11,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5942 conditions, 2306 events. 492/2306 cut-off events. For 3265/3333 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 18526 event pairs, 47 based on Foata normal form. 12/2193 useless extension candidates. Maximal degree in co-relation 5862. Up to 278 conditions per place. [2023-11-29 04:25:11,440 INFO L140 encePairwiseOnDemand]: 191/198 looper letters, 20 selfloop transitions, 11 changer transitions 31/384 dead transitions. [2023-11-29 04:25:11,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 384 transitions, 2499 flow [2023-11-29 04:25:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:25:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:25:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2023-11-29 04:25:11,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9410774410774411 [2023-11-29 04:25:11,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2023-11-29 04:25:11,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2023-11-29 04:25:11,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:11,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2023-11-29 04:25:11,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:11,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:11,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:11,447 INFO L175 Difference]: Start difference. First operand has 253 places, 375 transitions, 2405 flow. Second operand 3 states and 559 transitions. [2023-11-29 04:25:11,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 384 transitions, 2499 flow [2023-11-29 04:25:11,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 384 transitions, 2463 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-29 04:25:11,499 INFO L231 Difference]: Finished difference. Result has 252 places, 351 transitions, 2140 flow [2023-11-29 04:25:11,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=252, PETRI_TRANSITIONS=351} [2023-11-29 04:25:11,500 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 62 predicate places. [2023-11-29 04:25:11,500 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 351 transitions, 2140 flow [2023-11-29 04:25:11,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:11,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:11,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:11,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:25:11,501 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:11,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash 122507873, now seen corresponding path program 1 times [2023-11-29 04:25:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:11,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529813989] [2023-11-29 04:25:11,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529813989] [2023-11-29 04:25:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529813989] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963445502] [2023-11-29 04:25:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:12,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:12,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:25:12,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:25:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:12,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 04:25:12,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:12,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:25:12,819 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:25:12,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:25:13,283 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:13,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:25:13,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:13,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:25:13,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:25:13,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:25:13,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:25:13,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:25:13,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:25:13,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:25:13,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:25:13,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:25:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:25:13,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:25:13,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963445502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:13,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:25:13,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 21 [2023-11-29 04:25:13,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734605164] [2023-11-29 04:25:13,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:13,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:25:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:13,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:25:13,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2023-11-29 04:25:14,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198 [2023-11-29 04:25:14,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 351 transitions, 2140 flow. Second operand has 14 states, 14 states have (on average 146.35714285714286) internal successors, (2049), 14 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:14,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:14,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198 [2023-11-29 04:25:14,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:15,679 INFO L124 PetriNetUnfolderBase]: 794/3377 cut-off events. [2023-11-29 04:25:15,679 INFO L125 PetriNetUnfolderBase]: For 5827/5831 co-relation queries the response was YES. [2023-11-29 04:25:15,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9557 conditions, 3377 events. 794/3377 cut-off events. For 5827/5831 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 28482 event pairs, 107 based on Foata normal form. 15/3234 useless extension candidates. Maximal degree in co-relation 9440. Up to 401 conditions per place. [2023-11-29 04:25:15,732 INFO L140 encePairwiseOnDemand]: 179/198 looper letters, 284 selfloop transitions, 89 changer transitions 16/549 dead transitions. [2023-11-29 04:25:15,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 549 transitions, 4716 flow [2023-11-29 04:25:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 04:25:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-29 04:25:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2870 transitions. [2023-11-29 04:25:15,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7628920786815524 [2023-11-29 04:25:15,739 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2870 transitions. [2023-11-29 04:25:15,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2870 transitions. [2023-11-29 04:25:15,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:15,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2870 transitions. [2023-11-29 04:25:15,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 151.05263157894737) internal successors, (2870), 19 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:15,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:15,757 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:15,757 INFO L175 Difference]: Start difference. First operand has 252 places, 351 transitions, 2140 flow. Second operand 19 states and 2870 transitions. [2023-11-29 04:25:15,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 549 transitions, 4716 flow [2023-11-29 04:25:15,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 549 transitions, 4683 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-29 04:25:15,811 INFO L231 Difference]: Finished difference. Result has 269 places, 413 transitions, 3117 flow [2023-11-29 04:25:15,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3117, PETRI_PLACES=269, PETRI_TRANSITIONS=413} [2023-11-29 04:25:15,812 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 79 predicate places. [2023-11-29 04:25:15,812 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 413 transitions, 3117 flow [2023-11-29 04:25:15,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 146.35714285714286) internal successors, (2049), 14 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:15,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:15,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:15,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:25:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:16,014 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:16,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash -922651295, now seen corresponding path program 2 times [2023-11-29 04:25:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:16,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520391646] [2023-11-29 04:25:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:16,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520391646] [2023-11-29 04:25:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520391646] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512698169] [2023-11-29 04:25:17,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:25:17,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:17,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:17,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:25:17,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:25:17,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:25:17,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:25:17,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 04:25:17,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:17,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:25:17,462 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:25:17,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:25:17,853 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:17,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:25:17,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:17,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:25:17,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:25:17,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:25:18,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:25:18,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:25:18,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:25:18,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:25:18,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:25:18,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:18,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:25:18,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:18,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:25:18,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:18,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:25:18,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:18,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:25:18,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:25:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:18,621 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:25:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512698169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:18,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:25:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-29 04:25:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252471981] [2023-11-29 04:25:18,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:18,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:25:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:25:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:25:19,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198 [2023-11-29 04:25:19,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 413 transitions, 3117 flow. Second operand has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:19,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:19,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198 [2023-11-29 04:25:19,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:21,528 INFO L124 PetriNetUnfolderBase]: 786/3142 cut-off events. [2023-11-29 04:25:21,528 INFO L125 PetriNetUnfolderBase]: For 8673/8784 co-relation queries the response was YES. [2023-11-29 04:25:21,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10157 conditions, 3142 events. 786/3142 cut-off events. For 8673/8784 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 25745 event pairs, 86 based on Foata normal form. 29/3023 useless extension candidates. Maximal degree in co-relation 10054. Up to 562 conditions per place. [2023-11-29 04:25:21,547 INFO L140 encePairwiseOnDemand]: 175/198 looper letters, 264 selfloop transitions, 133 changer transitions 16/573 dead transitions. [2023-11-29 04:25:21,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 573 transitions, 5241 flow [2023-11-29 04:25:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 04:25:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-29 04:25:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3643 transitions. [2023-11-29 04:25:21,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7666245791245792 [2023-11-29 04:25:21,553 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3643 transitions. [2023-11-29 04:25:21,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3643 transitions. [2023-11-29 04:25:21,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:21,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3643 transitions. [2023-11-29 04:25:21,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 151.79166666666666) internal successors, (3643), 24 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:21,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 198.0) internal successors, (4950), 25 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:21,570 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 198.0) internal successors, (4950), 25 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:21,570 INFO L175 Difference]: Start difference. First operand has 269 places, 413 transitions, 3117 flow. Second operand 24 states and 3643 transitions. [2023-11-29 04:25:21,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 573 transitions, 5241 flow [2023-11-29 04:25:21,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 573 transitions, 5193 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-11-29 04:25:21,640 INFO L231 Difference]: Finished difference. Result has 287 places, 454 transitions, 3864 flow [2023-11-29 04:25:21,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3073, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3864, PETRI_PLACES=287, PETRI_TRANSITIONS=454} [2023-11-29 04:25:21,642 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 97 predicate places. [2023-11-29 04:25:21,642 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 454 transitions, 3864 flow [2023-11-29 04:25:21,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:21,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:21,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:21,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 04:25:21,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 04:25:21,843 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:21,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1763368801, now seen corresponding path program 3 times [2023-11-29 04:25:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020280447] [2023-11-29 04:25:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020280447] [2023-11-29 04:25:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020280447] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792096284] [2023-11-29 04:25:22,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:25:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:22,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:25:22,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:25:22,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 04:25:22,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:25:22,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 04:25:22,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:23,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:25:23,140 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:25:23,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:25:24,132 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:24,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:25:24,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:24,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:25:24,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:24,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:25:24,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:24,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:25:24,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:25:24,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 04:25:24,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:25:25,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:25:25,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 04:25:25,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 04:25:25,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:25,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 04:25:25,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:25,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 04:25:25,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:25,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 04:25:25,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:25,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 04:25:25,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 04:25:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:25,433 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:25:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792096284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:25,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:25:25,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37 [2023-11-29 04:25:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324580218] [2023-11-29 04:25:25,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:25,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 04:25:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 04:25:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 04:25:27,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 198 [2023-11-29 04:25:27,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 454 transitions, 3864 flow. Second operand has 24 states, 24 states have (on average 123.16666666666667) internal successors, (2956), 24 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:27,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:27,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 198 [2023-11-29 04:25:27,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:33,728 INFO L124 PetriNetUnfolderBase]: 2525/9095 cut-off events. [2023-11-29 04:25:33,728 INFO L125 PetriNetUnfolderBase]: For 33960/34015 co-relation queries the response was YES. [2023-11-29 04:25:33,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31665 conditions, 9095 events. 2525/9095 cut-off events. For 33960/34015 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 93080 event pairs, 518 based on Foata normal form. 46/8673 useless extension candidates. Maximal degree in co-relation 29751. Up to 1883 conditions per place. [2023-11-29 04:25:33,844 INFO L140 encePairwiseOnDemand]: 159/198 looper letters, 860 selfloop transitions, 265 changer transitions 33/1296 dead transitions. [2023-11-29 04:25:33,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1296 transitions, 14412 flow [2023-11-29 04:25:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-29 04:25:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-11-29 04:25:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 6516 transitions. [2023-11-29 04:25:33,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6581818181818182 [2023-11-29 04:25:33,853 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 6516 transitions. [2023-11-29 04:25:33,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 6516 transitions. [2023-11-29 04:25:33,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:33,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 6516 transitions. [2023-11-29 04:25:33,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 130.32) internal successors, (6516), 50 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:33,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 198.0) internal successors, (10098), 51 states have internal predecessors, (10098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:33,879 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 198.0) internal successors, (10098), 51 states have internal predecessors, (10098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:33,879 INFO L175 Difference]: Start difference. First operand has 287 places, 454 transitions, 3864 flow. Second operand 50 states and 6516 transitions. [2023-11-29 04:25:33,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 1296 transitions, 14412 flow [2023-11-29 04:25:34,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 1296 transitions, 13780 flow, removed 108 selfloop flow, removed 11 redundant places. [2023-11-29 04:25:34,081 INFO L231 Difference]: Finished difference. Result has 355 places, 691 transitions, 7554 flow [2023-11-29 04:25:34,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3634, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=7554, PETRI_PLACES=355, PETRI_TRANSITIONS=691} [2023-11-29 04:25:34,082 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 165 predicate places. [2023-11-29 04:25:34,083 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 691 transitions, 7554 flow [2023-11-29 04:25:34,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 123.16666666666667) internal successors, (2956), 24 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:34,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:34,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:34,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:25:34,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 04:25:34,284 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:34,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1240318478, now seen corresponding path program 1 times [2023-11-29 04:25:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343265175] [2023-11-29 04:25:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:35,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343265175] [2023-11-29 04:25:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343265175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:35,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923589461] [2023-11-29 04:25:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:35,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:35,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:35,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:25:35,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:25:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:35,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-29 04:25:35,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:35,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:25:35,445 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:25:35,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:25:35,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:35,563 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:25:35,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-29 04:25:36,149 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:36,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-29 04:25:36,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:25:36,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:36,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-29 04:25:36,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:36,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:25:36,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:25:36,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:25:36,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:25:36,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 04:25:36,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 04:25:36,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 04:25:36,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 04:25:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:36,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:25:36,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)))) is different from false [2023-11-29 04:25:36,818 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)))))) is different from false [2023-11-29 04:25:36,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3) 0)))))) is different from false [2023-11-29 04:25:36,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_728) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false [2023-11-29 04:25:37,065 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_726) c_~datas~0.base v_ArrVal_728) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false [2023-11-29 04:25:37,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 119 [2023-11-29 04:25:37,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2023-11-29 04:25:37,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-11-29 04:25:37,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 04:25:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:37,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923589461] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:25:37,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:25:37,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 45 [2023-11-29 04:25:37,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45316582] [2023-11-29 04:25:37,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:25:37,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-29 04:25:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:37,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 04:25:37,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1452, Unknown=16, NotChecked=410, Total=2070 [2023-11-29 04:25:37,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 198 [2023-11-29 04:25:37,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 691 transitions, 7554 flow. Second operand has 46 states, 46 states have (on average 108.93478260869566) internal successors, (5011), 46 states have internal predecessors, (5011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:37,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:37,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 198 [2023-11-29 04:25:37,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:42,571 INFO L124 PetriNetUnfolderBase]: 2559/9817 cut-off events. [2023-11-29 04:25:42,571 INFO L125 PetriNetUnfolderBase]: For 54068/54083 co-relation queries the response was YES. [2023-11-29 04:25:42,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37925 conditions, 9817 events. 2559/9817 cut-off events. For 54068/54083 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 103532 event pairs, 259 based on Foata normal form. 56/9502 useless extension candidates. Maximal degree in co-relation 37604. Up to 1263 conditions per place. [2023-11-29 04:25:42,653 INFO L140 encePairwiseOnDemand]: 167/198 looper letters, 401 selfloop transitions, 115 changer transitions 285/958 dead transitions. [2023-11-29 04:25:42,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 958 transitions, 12591 flow [2023-11-29 04:25:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 04:25:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-29 04:25:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3184 transitions. [2023-11-29 04:25:42,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5743145743145743 [2023-11-29 04:25:42,660 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 3184 transitions. [2023-11-29 04:25:42,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 3184 transitions. [2023-11-29 04:25:42,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:42,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3184 transitions. [2023-11-29 04:25:42,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 113.71428571428571) internal successors, (3184), 28 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:42,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:42,675 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:42,675 INFO L175 Difference]: Start difference. First operand has 355 places, 691 transitions, 7554 flow. Second operand 28 states and 3184 transitions. [2023-11-29 04:25:42,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 958 transitions, 12591 flow [2023-11-29 04:25:43,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 958 transitions, 12322 flow, removed 89 selfloop flow, removed 13 redundant places. [2023-11-29 04:25:43,114 INFO L231 Difference]: Finished difference. Result has 367 places, 522 transitions, 4720 flow [2023-11-29 04:25:43,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=7350, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4720, PETRI_PLACES=367, PETRI_TRANSITIONS=522} [2023-11-29 04:25:43,115 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 177 predicate places. [2023-11-29 04:25:43,115 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 522 transitions, 4720 flow [2023-11-29 04:25:43,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 108.93478260869566) internal successors, (5011), 46 states have internal predecessors, (5011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:43,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:43,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:43,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:25:43,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:43,317 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:43,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash -381256313, now seen corresponding path program 4 times [2023-11-29 04:25:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403130148] [2023-11-29 04:25:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:44,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403130148] [2023-11-29 04:25:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403130148] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566243736] [2023-11-29 04:25:44,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:25:44,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:44,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:44,224 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:25:44,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:25:44,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:25:44,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:25:44,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 04:25:44,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:44,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:25:44,566 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:25:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:25:45,364 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:45,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:25:45,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:45,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:25:45,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:45,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:25:45,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:45,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:25:45,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:25:45,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:25:45,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:25:46,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 04:25:46,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:46,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 04:25:46,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 04:25:46,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:46,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:25:46,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:46,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:25:46,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:46,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:25:46,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 04:25:46,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-11-29 04:25:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:46,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:25:46,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566243736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:46,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:25:46,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [15] total 33 [2023-11-29 04:25:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203471218] [2023-11-29 04:25:46,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:46,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:25:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:46,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:25:46,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 04:25:48,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 198 [2023-11-29 04:25:48,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 522 transitions, 4720 flow. Second operand has 20 states, 20 states have (on average 134.9) internal successors, (2698), 20 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:48,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:48,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 198 [2023-11-29 04:25:48,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:52,814 INFO L124 PetriNetUnfolderBase]: 2244/8600 cut-off events. [2023-11-29 04:25:52,814 INFO L125 PetriNetUnfolderBase]: For 38157/38229 co-relation queries the response was YES. [2023-11-29 04:25:52,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31358 conditions, 8600 events. 2244/8600 cut-off events. For 38157/38229 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 89099 event pairs, 602 based on Foata normal form. 28/8263 useless extension candidates. Maximal degree in co-relation 31073. Up to 1914 conditions per place. [2023-11-29 04:25:52,880 INFO L140 encePairwiseOnDemand]: 168/198 looper letters, 587 selfloop transitions, 92 changer transitions 158/985 dead transitions. [2023-11-29 04:25:52,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 985 transitions, 11243 flow [2023-11-29 04:25:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 04:25:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-29 04:25:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4037 transitions. [2023-11-29 04:25:52,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7281746031746031 [2023-11-29 04:25:52,887 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4037 transitions. [2023-11-29 04:25:52,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4037 transitions. [2023-11-29 04:25:52,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:52,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4037 transitions. [2023-11-29 04:25:52,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 144.17857142857142) internal successors, (4037), 28 states have internal predecessors, (4037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:52,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:52,901 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:52,901 INFO L175 Difference]: Start difference. First operand has 367 places, 522 transitions, 4720 flow. Second operand 28 states and 4037 transitions. [2023-11-29 04:25:52,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 985 transitions, 11243 flow [2023-11-29 04:25:53,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 985 transitions, 10320 flow, removed 273 selfloop flow, removed 30 redundant places. [2023-11-29 04:25:53,191 INFO L231 Difference]: Finished difference. Result has 363 places, 495 transitions, 4393 flow [2023-11-29 04:25:53,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=4365, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4393, PETRI_PLACES=363, PETRI_TRANSITIONS=495} [2023-11-29 04:25:53,192 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 173 predicate places. [2023-11-29 04:25:53,192 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 495 transitions, 4393 flow [2023-11-29 04:25:53,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 134.9) internal successors, (2698), 20 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:53,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:53,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:53,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:25:53,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:53,394 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:53,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1005146519, now seen corresponding path program 5 times [2023-11-29 04:25:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320030165] [2023-11-29 04:25:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:25:54,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:25:54,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320030165] [2023-11-29 04:25:54,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320030165] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:54,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189289610] [2023-11-29 04:25:54,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:25:54,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:25:54,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:54,178 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:25:54,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 04:25:54,314 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:25:54,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:25:54,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 04:25:54,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:54,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:25:54,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 04:25:54,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:25:54,400 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 04:25:54,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:25:54,747 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:54,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:25:54,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:25:54,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:25:54,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:25:54,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:25:54,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:25:54,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:25:55,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:25:55,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:25:55,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:25:55,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:25:55,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:25:55,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:25:55,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:25:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:25:55,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:25:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189289610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:25:55,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:25:55,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 24 [2023-11-29 04:25:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616309728] [2023-11-29 04:25:55,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:25:55,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:25:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:25:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:25:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2023-11-29 04:25:56,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198 [2023-11-29 04:25:56,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 495 transitions, 4393 flow. Second operand has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:56,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:25:56,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198 [2023-11-29 04:25:56,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:25:58,846 INFO L124 PetriNetUnfolderBase]: 1554/6939 cut-off events. [2023-11-29 04:25:58,846 INFO L125 PetriNetUnfolderBase]: For 26288/26402 co-relation queries the response was YES. [2023-11-29 04:25:58,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23560 conditions, 6939 events. 1554/6939 cut-off events. For 26288/26402 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 71157 event pairs, 332 based on Foata normal form. 80/6689 useless extension candidates. Maximal degree in co-relation 23254. Up to 949 conditions per place. [2023-11-29 04:25:58,893 INFO L140 encePairwiseOnDemand]: 179/198 looper letters, 224 selfloop transitions, 177 changer transitions 37/625 dead transitions. [2023-11-29 04:25:58,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 625 transitions, 6345 flow [2023-11-29 04:25:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:25:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-29 04:25:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3460 transitions. [2023-11-29 04:25:58,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7597716293368467 [2023-11-29 04:25:58,898 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3460 transitions. [2023-11-29 04:25:58,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3460 transitions. [2023-11-29 04:25:58,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:58,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3460 transitions. [2023-11-29 04:25:58,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 150.43478260869566) internal successors, (3460), 23 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:58,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 198.0) internal successors, (4752), 24 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:58,907 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 198.0) internal successors, (4752), 24 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:58,907 INFO L175 Difference]: Start difference. First operand has 363 places, 495 transitions, 4393 flow. Second operand 23 states and 3460 transitions. [2023-11-29 04:25:58,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 625 transitions, 6345 flow [2023-11-29 04:25:59,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 625 transitions, 6036 flow, removed 76 selfloop flow, removed 24 redundant places. [2023-11-29 04:25:59,108 INFO L231 Difference]: Finished difference. Result has 360 places, 492 transitions, 4497 flow [2023-11-29 04:25:59,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=4135, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4497, PETRI_PLACES=360, PETRI_TRANSITIONS=492} [2023-11-29 04:25:59,109 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 170 predicate places. [2023-11-29 04:25:59,109 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 492 transitions, 4497 flow [2023-11-29 04:25:59,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:59,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:59,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:59,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:25:59,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 04:25:59,310 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:25:59,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash 538469057, now seen corresponding path program 1 times [2023-11-29 04:25:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:25:59,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852090568] [2023-11-29 04:25:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:25:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:00,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:00,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852090568] [2023-11-29 04:26:00,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852090568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:26:00,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791745520] [2023-11-29 04:26:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:00,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:26:00,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:26:00,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:26:00,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:26:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:00,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 04:26:00,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:00,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:26:00,256 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:26:00,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:26:00,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:00,332 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:26:00,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-29 04:26:00,637 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:26:00,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 04:26:00,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:00,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-29 04:26:00,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:26:00,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:26:00,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:26:00,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:26:00,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:26:00,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:26:00,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:26:00,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:00,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:26:01,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:01,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:26:01,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:01,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:26:01,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:01,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:26:01,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:26:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:26:01,078 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:01,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791745520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:01,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:26:01,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25 [2023-11-29 04:26:01,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285160392] [2023-11-29 04:26:01,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:01,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:26:01,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:01,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:26:01,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:26:01,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198 [2023-11-29 04:26:01,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 492 transitions, 4497 flow. Second operand has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:01,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:01,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198 [2023-11-29 04:26:01,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:04,076 INFO L124 PetriNetUnfolderBase]: 1482/6691 cut-off events. [2023-11-29 04:26:04,076 INFO L125 PetriNetUnfolderBase]: For 26905/27025 co-relation queries the response was YES. [2023-11-29 04:26:04,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22644 conditions, 6691 events. 1482/6691 cut-off events. For 26905/27025 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 67182 event pairs, 224 based on Foata normal form. 80/6485 useless extension candidates. Maximal degree in co-relation 22400. Up to 755 conditions per place. [2023-11-29 04:26:04,133 INFO L140 encePairwiseOnDemand]: 179/198 looper letters, 223 selfloop transitions, 103 changer transitions 112/625 dead transitions. [2023-11-29 04:26:04,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 625 transitions, 6784 flow [2023-11-29 04:26:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 04:26:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-29 04:26:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2842 transitions. [2023-11-29 04:26:04,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7554492291334397 [2023-11-29 04:26:04,137 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2842 transitions. [2023-11-29 04:26:04,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2842 transitions. [2023-11-29 04:26:04,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:04,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2842 transitions. [2023-11-29 04:26:04,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 149.57894736842104) internal successors, (2842), 19 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:04,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:04,144 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:04,144 INFO L175 Difference]: Start difference. First operand has 360 places, 492 transitions, 4497 flow. Second operand 19 states and 2842 transitions. [2023-11-29 04:26:04,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 625 transitions, 6784 flow [2023-11-29 04:26:04,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 625 transitions, 6007 flow, removed 149 selfloop flow, removed 29 redundant places. [2023-11-29 04:26:04,417 INFO L231 Difference]: Finished difference. Result has 348 places, 468 transitions, 3982 flow [2023-11-29 04:26:04,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3952, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3982, PETRI_PLACES=348, PETRI_TRANSITIONS=468} [2023-11-29 04:26:04,418 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 158 predicate places. [2023-11-29 04:26:04,418 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 468 transitions, 3982 flow [2023-11-29 04:26:04,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:04,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:04,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:04,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 04:26:04,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:26:04,620 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:26:04,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2136706257, now seen corresponding path program 2 times [2023-11-29 04:26:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:04,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715752489] [2023-11-29 04:26:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:05,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:05,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715752489] [2023-11-29 04:26:05,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715752489] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:26:05,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727917772] [2023-11-29 04:26:05,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:26:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:26:05,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:26:05,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:26:05,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 04:26:05,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:26:05,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:26:05,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 04:26:05,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:05,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:26:05,759 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:26:05,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:26:06,073 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:26:06,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:26:06,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:06,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:26:06,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:26:06,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:26:06,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:26:06,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:26:06,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:26:06,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:06,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:26:06,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:06,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:26:06,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:06,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:26:06,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:06,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:26:06,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:26:06,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:26:06,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:26:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:26:06,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727917772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:26:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25 [2023-11-29 04:26:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431461178] [2023-11-29 04:26:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:06,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:26:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:06,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:26:06,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:26:07,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198 [2023-11-29 04:26:07,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 468 transitions, 3982 flow. Second operand has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:07,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:07,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198 [2023-11-29 04:26:07,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:09,567 INFO L124 PetriNetUnfolderBase]: 1301/6219 cut-off events. [2023-11-29 04:26:09,567 INFO L125 PetriNetUnfolderBase]: For 20907/21003 co-relation queries the response was YES. [2023-11-29 04:26:09,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19009 conditions, 6219 events. 1301/6219 cut-off events. For 20907/21003 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 63020 event pairs, 251 based on Foata normal form. 31/5942 useless extension candidates. Maximal degree in co-relation 18915. Up to 551 conditions per place. [2023-11-29 04:26:09,625 INFO L140 encePairwiseOnDemand]: 178/198 looper letters, 148 selfloop transitions, 134 changer transitions 100/565 dead transitions. [2023-11-29 04:26:09,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 565 transitions, 5548 flow [2023-11-29 04:26:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 04:26:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 04:26:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3160 transitions. [2023-11-29 04:26:09,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75998075998076 [2023-11-29 04:26:09,629 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3160 transitions. [2023-11-29 04:26:09,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3160 transitions. [2023-11-29 04:26:09,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:09,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3160 transitions. [2023-11-29 04:26:09,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 150.47619047619048) internal successors, (3160), 21 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:09,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 198.0) internal successors, (4356), 22 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:09,639 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 198.0) internal successors, (4356), 22 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:09,639 INFO L175 Difference]: Start difference. First operand has 348 places, 468 transitions, 3982 flow. Second operand 21 states and 3160 transitions. [2023-11-29 04:26:09,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 565 transitions, 5548 flow [2023-11-29 04:26:09,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 565 transitions, 5330 flow, removed 16 selfloop flow, removed 14 redundant places. [2023-11-29 04:26:09,800 INFO L231 Difference]: Finished difference. Result has 355 places, 421 transitions, 3584 flow [2023-11-29 04:26:09,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3781, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3584, PETRI_PLACES=355, PETRI_TRANSITIONS=421} [2023-11-29 04:26:09,801 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 165 predicate places. [2023-11-29 04:26:09,801 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 421 transitions, 3584 flow [2023-11-29 04:26:09,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:09,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:09,801 INFO L208 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] [2023-11-29 04:26:09,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 04:26:10,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:26:10,002 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:26:10,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1503407937, now seen corresponding path program 1 times [2023-11-29 04:26:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279430913] [2023-11-29 04:26:10,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:26:10,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:10,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279430913] [2023-11-29 04:26:10,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279430913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:10,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:10,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:26:10,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362512178] [2023-11-29 04:26:10,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:10,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:10,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:10,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:10,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:10,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 198 [2023-11-29 04:26:10,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 421 transitions, 3584 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:10,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:10,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 198 [2023-11-29 04:26:10,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:10,625 INFO L124 PetriNetUnfolderBase]: 576/3270 cut-off events. [2023-11-29 04:26:10,625 INFO L125 PetriNetUnfolderBase]: For 12900/12976 co-relation queries the response was YES. [2023-11-29 04:26:10,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10286 conditions, 3270 events. 576/3270 cut-off events. For 12900/12976 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 28228 event pairs, 45 based on Foata normal form. 13/3180 useless extension candidates. Maximal degree in co-relation 10211. Up to 417 conditions per place. [2023-11-29 04:26:10,648 INFO L140 encePairwiseOnDemand]: 194/198 looper letters, 3 selfloop transitions, 4 changer transitions 1/396 dead transitions. [2023-11-29 04:26:10,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 396 transitions, 3464 flow [2023-11-29 04:26:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:26:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2023-11-29 04:26:10,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9579124579124579 [2023-11-29 04:26:10,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2023-11-29 04:26:10,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2023-11-29 04:26:10,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:10,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2023-11-29 04:26:10,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:10,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:10,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:10,652 INFO L175 Difference]: Start difference. First operand has 355 places, 421 transitions, 3584 flow. Second operand 3 states and 569 transitions. [2023-11-29 04:26:10,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 396 transitions, 3464 flow [2023-11-29 04:26:10,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 396 transitions, 3073 flow, removed 44 selfloop flow, removed 34 redundant places. [2023-11-29 04:26:10,738 INFO L231 Difference]: Finished difference. Result has 294 places, 395 transitions, 3047 flow [2023-11-29 04:26:10,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3059, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3047, PETRI_PLACES=294, PETRI_TRANSITIONS=395} [2023-11-29 04:26:10,739 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 104 predicate places. [2023-11-29 04:26:10,739 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 395 transitions, 3047 flow [2023-11-29 04:26:10,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:10,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:10,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:10,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 04:26:10,739 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:26:10,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1532450086, now seen corresponding path program 1 times [2023-11-29 04:26:10,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:10,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473746002] [2023-11-29 04:26:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:10,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473746002] [2023-11-29 04:26:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473746002] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:26:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116740797] [2023-11-29 04:26:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:10,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:26:10,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:26:10,837 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:26:10,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 04:26:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:10,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:26:10,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:11,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:26:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:11,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116740797] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:26:11,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:26:11,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 04:26:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889093587] [2023-11-29 04:26:11,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:26:11,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:26:11,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:26:11,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:26:11,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 198 [2023-11-29 04:26:11,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 395 transitions, 3047 flow. Second operand has 9 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:11,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:11,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 198 [2023-11-29 04:26:11,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:11,566 INFO L124 PetriNetUnfolderBase]: 410/2203 cut-off events. [2023-11-29 04:26:11,566 INFO L125 PetriNetUnfolderBase]: For 5297/5376 co-relation queries the response was YES. [2023-11-29 04:26:11,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 2203 events. 410/2203 cut-off events. For 5297/5376 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 16518 event pairs, 34 based on Foata normal form. 18/2147 useless extension candidates. Maximal degree in co-relation 5954. Up to 210 conditions per place. [2023-11-29 04:26:11,580 INFO L140 encePairwiseOnDemand]: 191/198 looper letters, 16 selfloop transitions, 12 changer transitions 6/310 dead transitions. [2023-11-29 04:26:11,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 310 transitions, 2299 flow [2023-11-29 04:26:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:26:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:26:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1249 transitions. [2023-11-29 04:26:11,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9011544011544012 [2023-11-29 04:26:11,582 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1249 transitions. [2023-11-29 04:26:11,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1249 transitions. [2023-11-29 04:26:11,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:11,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1249 transitions. [2023-11-29 04:26:11,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.42857142857142) internal successors, (1249), 7 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:11,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:11,585 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:11,585 INFO L175 Difference]: Start difference. First operand has 294 places, 395 transitions, 3047 flow. Second operand 7 states and 1249 transitions. [2023-11-29 04:26:11,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 310 transitions, 2299 flow [2023-11-29 04:26:11,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 310 transitions, 2065 flow, removed 8 selfloop flow, removed 12 redundant places. [2023-11-29 04:26:11,620 INFO L231 Difference]: Finished difference. Result has 260 places, 298 transitions, 1955 flow [2023-11-29 04:26:11,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1955, PETRI_PLACES=260, PETRI_TRANSITIONS=298} [2023-11-29 04:26:11,621 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 70 predicate places. [2023-11-29 04:26:11,621 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 298 transitions, 1955 flow [2023-11-29 04:26:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:11,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:11,621 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:11,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-29 04:26:11,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 04:26:11,822 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:26:11,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash -193939634, now seen corresponding path program 1 times [2023-11-29 04:26:11,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:11,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364469809] [2023-11-29 04:26:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 04:26:11,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:11,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364469809] [2023-11-29 04:26:11,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364469809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:26:11,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634063873] [2023-11-29 04:26:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:11,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:26:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:26:11,938 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:26:11,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 04:26:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:12,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:26:12,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:12,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:12,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634063873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:12,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:26:12,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10 [2023-11-29 04:26:12,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305337044] [2023-11-29 04:26:12,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:12,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:26:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:12,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:26:12,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:26:12,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 198 [2023-11-29 04:26:12,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 298 transitions, 1955 flow. Second operand has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:12,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:12,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 198 [2023-11-29 04:26:12,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:12,676 INFO L124 PetriNetUnfolderBase]: 379/2129 cut-off events. [2023-11-29 04:26:12,676 INFO L125 PetriNetUnfolderBase]: For 4007/4072 co-relation queries the response was YES. [2023-11-29 04:26:12,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5412 conditions, 2129 events. 379/2129 cut-off events. For 4007/4072 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 15792 event pairs, 32 based on Foata normal form. 22/2087 useless extension candidates. Maximal degree in co-relation 5357. Up to 184 conditions per place. [2023-11-29 04:26:12,688 INFO L140 encePairwiseOnDemand]: 187/198 looper letters, 32 selfloop transitions, 16 changer transitions 0/321 dead transitions. [2023-11-29 04:26:12,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 321 transitions, 2116 flow [2023-11-29 04:26:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:26:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 04:26:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1940 transitions. [2023-11-29 04:26:12,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8907254361799817 [2023-11-29 04:26:12,691 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1940 transitions. [2023-11-29 04:26:12,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1940 transitions. [2023-11-29 04:26:12,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:12,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1940 transitions. [2023-11-29 04:26:12,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 176.36363636363637) internal successors, (1940), 11 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:12,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:12,695 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:12,695 INFO L175 Difference]: Start difference. First operand has 260 places, 298 transitions, 1955 flow. Second operand 11 states and 1940 transitions. [2023-11-29 04:26:12,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 321 transitions, 2116 flow [2023-11-29 04:26:12,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 321 transitions, 2102 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-29 04:26:12,731 INFO L231 Difference]: Finished difference. Result has 268 places, 308 transitions, 2033 flow [2023-11-29 04:26:12,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2033, PETRI_PLACES=268, PETRI_TRANSITIONS=308} [2023-11-29 04:26:12,731 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 78 predicate places. [2023-11-29 04:26:12,731 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 308 transitions, 2033 flow [2023-11-29 04:26:12,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:12,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:12,732 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:12,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 04:26:12,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 04:26:12,933 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:26:12,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1982903500, now seen corresponding path program 1 times [2023-11-29 04:26:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753985328] [2023-11-29 04:26:12,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:13,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753985328] [2023-11-29 04:26:13,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753985328] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:26:13,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749151155] [2023-11-29 04:26:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:13,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:26:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:26:13,051 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:26:13,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 04:26:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:13,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:26:13,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:13,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:26:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:13,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749151155] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:26:13,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:26:13,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-29 04:26:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21942406] [2023-11-29 04:26:13,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:26:13,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:26:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:26:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:26:13,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 198 [2023-11-29 04:26:13,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 308 transitions, 2033 flow. Second operand has 11 states, 11 states have (on average 176.45454545454547) internal successors, (1941), 11 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:13,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:13,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 198 [2023-11-29 04:26:13,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:14,107 INFO L124 PetriNetUnfolderBase]: 444/2472 cut-off events. [2023-11-29 04:26:14,108 INFO L125 PetriNetUnfolderBase]: For 5165/5263 co-relation queries the response was YES. [2023-11-29 04:26:14,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6658 conditions, 2472 events. 444/2472 cut-off events. For 5165/5263 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 19333 event pairs, 37 based on Foata normal form. 20/2413 useless extension candidates. Maximal degree in co-relation 6599. Up to 237 conditions per place. [2023-11-29 04:26:14,125 INFO L140 encePairwiseOnDemand]: 188/198 looper letters, 36 selfloop transitions, 15 changer transitions 0/329 dead transitions. [2023-11-29 04:26:14,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 329 transitions, 2222 flow [2023-11-29 04:26:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:26:14,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:26:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1783 transitions. [2023-11-29 04:26:14,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9005050505050505 [2023-11-29 04:26:14,127 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1783 transitions. [2023-11-29 04:26:14,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1783 transitions. [2023-11-29 04:26:14,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:14,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1783 transitions. [2023-11-29 04:26:14,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:14,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:14,132 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:14,132 INFO L175 Difference]: Start difference. First operand has 268 places, 308 transitions, 2033 flow. Second operand 10 states and 1783 transitions. [2023-11-29 04:26:14,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 329 transitions, 2222 flow [2023-11-29 04:26:14,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 329 transitions, 2208 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 04:26:14,172 INFO L231 Difference]: Finished difference. Result has 279 places, 318 transitions, 2130 flow [2023-11-29 04:26:14,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2130, PETRI_PLACES=279, PETRI_TRANSITIONS=318} [2023-11-29 04:26:14,173 INFO L281 CegarLoopForPetriNet]: 190 programPoint places, 89 predicate places. [2023-11-29 04:26:14,173 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 318 transitions, 2130 flow [2023-11-29 04:26:14,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 176.45454545454547) internal successors, (1941), 11 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:14,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:14,174 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:14,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 04:26:14,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 04:26:14,374 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 04:26:14,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1853613256, now seen corresponding path program 1 times [2023-11-29 04:26:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182277680] [2023-11-29 04:26:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:26:14,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:26:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:26:14,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:26:14,471 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:26:14,473 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-29 04:26:14,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-11-29 04:26:14,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-11-29 04:26:14,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-11-29 04:26:14,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-11-29 04:26:14,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-11-29 04:26:14,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-11-29 04:26:14,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-11-29 04:26:14,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-11-29 04:26:14,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-11-29 04:26:14,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 04:26:14,477 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:14,479 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 04:26:14,479 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 04:26:14,510 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 04:26:14,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 249 transitions, 514 flow [2023-11-29 04:26:14,606 INFO L124 PetriNetUnfolderBase]: 27/482 cut-off events. [2023-11-29 04:26:14,606 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 04:26:14,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 482 events. 27/482 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1212 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 289. Up to 9 conditions per place. [2023-11-29 04:26:14,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 249 transitions, 514 flow [2023-11-29 04:26:14,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 249 transitions, 514 flow [2023-11-29 04:26:14,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:26:14,614 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a46650e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:26:14,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-29 04:26:14,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:26:14,618 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-29 04:26:14,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:26:14,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:14,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:14,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:14,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:14,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1581107677, now seen corresponding path program 1 times [2023-11-29 04:26:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:14,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344739867] [2023-11-29 04:26:14,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:14,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:14,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:14,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344739867] [2023-11-29 04:26:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344739867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:26:14,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14413390] [2023-11-29 04:26:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:14,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:14,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:14,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:14,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249 [2023-11-29 04:26:14,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 249 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:14,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:14,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249 [2023-11-29 04:26:14,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:15,054 INFO L124 PetriNetUnfolderBase]: 237/2093 cut-off events. [2023-11-29 04:26:15,054 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-29 04:26:15,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 2093 events. 237/2093 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14803 event pairs, 132 based on Foata normal form. 40/1820 useless extension candidates. Maximal degree in co-relation 1763. Up to 258 conditions per place. [2023-11-29 04:26:15,070 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 17 selfloop transitions, 2 changer transitions 2/244 dead transitions. [2023-11-29 04:26:15,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 244 transitions, 542 flow [2023-11-29 04:26:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:26:15,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2023-11-29 04:26:15,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2023-11-29 04:26:15,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 699 transitions. [2023-11-29 04:26:15,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions. [2023-11-29 04:26:15,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:15,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions. [2023-11-29 04:26:15,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,074 INFO L175 Difference]: Start difference. First operand has 239 places, 249 transitions, 514 flow. Second operand 3 states and 699 transitions. [2023-11-29 04:26:15,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 244 transitions, 542 flow [2023-11-29 04:26:15,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 244 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:26:15,079 INFO L231 Difference]: Finished difference. Result has 240 places, 242 transitions, 504 flow [2023-11-29 04:26:15,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=240, PETRI_TRANSITIONS=242} [2023-11-29 04:26:15,080 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2023-11-29 04:26:15,080 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 242 transitions, 504 flow [2023-11-29 04:26:15,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:15,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:15,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 04:26:15,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:15,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:15,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1181063058, now seen corresponding path program 1 times [2023-11-29 04:26:15,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:15,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494372872] [2023-11-29 04:26:15,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:15,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:15,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494372872] [2023-11-29 04:26:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494372872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:15,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:26:15,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198464838] [2023-11-29 04:26:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:15,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:15,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:15,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 249 [2023-11-29 04:26:15,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 242 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:15,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 249 [2023-11-29 04:26:15,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:15,922 INFO L124 PetriNetUnfolderBase]: 1364/6164 cut-off events. [2023-11-29 04:26:15,922 INFO L125 PetriNetUnfolderBase]: For 119/131 co-relation queries the response was YES. [2023-11-29 04:26:15,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7813 conditions, 6164 events. 1364/6164 cut-off events. For 119/131 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 59173 event pairs, 374 based on Foata normal form. 1/5216 useless extension candidates. Maximal degree in co-relation 7766. Up to 850 conditions per place. [2023-11-29 04:26:15,952 INFO L140 encePairwiseOnDemand]: 234/249 looper letters, 34 selfloop transitions, 11 changer transitions 0/262 dead transitions. [2023-11-29 04:26:15,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 262 transitions, 645 flow [2023-11-29 04:26:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:26:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2023-11-29 04:26:15,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9491298527443106 [2023-11-29 04:26:15,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 709 transitions. [2023-11-29 04:26:15,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 709 transitions. [2023-11-29 04:26:15,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:15,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 709 transitions. [2023-11-29 04:26:15,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,954 INFO L175 Difference]: Start difference. First operand has 240 places, 242 transitions, 504 flow. Second operand 3 states and 709 transitions. [2023-11-29 04:26:15,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 262 transitions, 645 flow [2023-11-29 04:26:15,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:26:15,958 INFO L231 Difference]: Finished difference. Result has 240 places, 253 transitions, 596 flow [2023-11-29 04:26:15,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=240, PETRI_TRANSITIONS=253} [2023-11-29 04:26:15,959 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2023-11-29 04:26:15,959 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 253 transitions, 596 flow [2023-11-29 04:26:15,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:15,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:15,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:15,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 04:26:15,960 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:15,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash -14479288, now seen corresponding path program 1 times [2023-11-29 04:26:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670235840] [2023-11-29 04:26:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670235840] [2023-11-29 04:26:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670235840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:26:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171158063] [2023-11-29 04:26:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:16,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:26:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:26:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:26:16,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249 [2023-11-29 04:26:16,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 253 transitions, 596 flow. Second operand has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:16,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:16,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249 [2023-11-29 04:26:16,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:16,688 INFO L124 PetriNetUnfolderBase]: 864/5441 cut-off events. [2023-11-29 04:26:16,688 INFO L125 PetriNetUnfolderBase]: For 273/281 co-relation queries the response was YES. [2023-11-29 04:26:16,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7046 conditions, 5441 events. 864/5441 cut-off events. For 273/281 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 53256 event pairs, 269 based on Foata normal form. 1/4677 useless extension candidates. Maximal degree in co-relation 3901. Up to 569 conditions per place. [2023-11-29 04:26:16,718 INFO L140 encePairwiseOnDemand]: 241/249 looper letters, 24 selfloop transitions, 6 changer transitions 1/263 dead transitions. [2023-11-29 04:26:16,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 263 transitions, 678 flow [2023-11-29 04:26:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:26:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:26:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1376 transitions. [2023-11-29 04:26:16,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9210174029451138 [2023-11-29 04:26:16,719 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1376 transitions. [2023-11-29 04:26:16,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1376 transitions. [2023-11-29 04:26:16,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:16,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1376 transitions. [2023-11-29 04:26:16,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:16,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:16,722 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:16,722 INFO L175 Difference]: Start difference. First operand has 240 places, 253 transitions, 596 flow. Second operand 6 states and 1376 transitions. [2023-11-29 04:26:16,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 263 transitions, 678 flow [2023-11-29 04:26:16,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 263 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:26:16,727 INFO L231 Difference]: Finished difference. Result has 247 places, 258 transitions, 620 flow [2023-11-29 04:26:16,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=247, PETRI_TRANSITIONS=258} [2023-11-29 04:26:16,728 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2023-11-29 04:26:16,728 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 258 transitions, 620 flow [2023-11-29 04:26:16,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:16,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:16,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:16,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 04:26:16,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:16,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2076789280, now seen corresponding path program 1 times [2023-11-29 04:26:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182700369] [2023-11-29 04:26:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:16,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:16,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182700369] [2023-11-29 04:26:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182700369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:16,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:26:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981527957] [2023-11-29 04:26:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:16,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:26:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:26:16,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:26:17,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 249 [2023-11-29 04:26:17,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 258 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:17,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:17,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 249 [2023-11-29 04:26:17,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:20,402 INFO L124 PetriNetUnfolderBase]: 6503/26023 cut-off events. [2023-11-29 04:26:20,402 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2023-11-29 04:26:20,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36352 conditions, 26023 events. 6503/26023 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 323715 event pairs, 1207 based on Foata normal form. 0/22665 useless extension candidates. Maximal degree in co-relation 36195. Up to 5287 conditions per place. [2023-11-29 04:26:20,509 INFO L140 encePairwiseOnDemand]: 222/249 looper letters, 70 selfloop transitions, 48 changer transitions 0/336 dead transitions. [2023-11-29 04:26:20,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 336 transitions, 1023 flow [2023-11-29 04:26:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:26:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:26:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions. [2023-11-29 04:26:20,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9042838018741634 [2023-11-29 04:26:20,511 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions. [2023-11-29 04:26:20,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions. [2023-11-29 04:26:20,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:20,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions. [2023-11-29 04:26:20,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:20,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:20,513 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:20,513 INFO L175 Difference]: Start difference. First operand has 247 places, 258 transitions, 620 flow. Second operand 6 states and 1351 transitions. [2023-11-29 04:26:20,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 336 transitions, 1023 flow [2023-11-29 04:26:20,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 336 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:26:20,520 INFO L231 Difference]: Finished difference. Result has 256 places, 306 transitions, 960 flow [2023-11-29 04:26:20,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=960, PETRI_PLACES=256, PETRI_TRANSITIONS=306} [2023-11-29 04:26:20,520 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places. [2023-11-29 04:26:20,520 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 306 transitions, 960 flow [2023-11-29 04:26:20,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:20,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:20,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:20,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 04:26:20,521 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:20,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2104474752, now seen corresponding path program 1 times [2023-11-29 04:26:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529058316] [2023-11-29 04:26:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:20,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529058316] [2023-11-29 04:26:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529058316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:20,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:20,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:26:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410430716] [2023-11-29 04:26:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:20,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:20,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:20,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:20,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249 [2023-11-29 04:26:20,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 306 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:20,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:20,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249 [2023-11-29 04:26:20,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:21,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][162], [278#(= |#race~datas~0| 0), Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 119#L1048-9true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true]) [2023-11-29 04:26:21,315 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is not cut-off event [2023-11-29 04:26:21,315 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2023-11-29 04:26:21,315 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2023-11-29 04:26:21,315 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2023-11-29 04:26:21,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][162], [278#(= |#race~datas~0| 0), Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true]) [2023-11-29 04:26:21,353 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event [2023-11-29 04:26:21,353 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:21,353 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:21,353 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:23,771 INFO L124 PetriNetUnfolderBase]: 4926/24512 cut-off events. [2023-11-29 04:26:23,771 INFO L125 PetriNetUnfolderBase]: For 1622/1666 co-relation queries the response was YES. [2023-11-29 04:26:23,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35910 conditions, 24512 events. 4926/24512 cut-off events. For 1622/1666 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 314896 event pairs, 1055 based on Foata normal form. 0/21480 useless extension candidates. Maximal degree in co-relation 16682. Up to 2478 conditions per place. [2023-11-29 04:26:23,902 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 20 selfloop transitions, 3 changer transitions 4/309 dead transitions. [2023-11-29 04:26:23,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 309 transitions, 1017 flow [2023-11-29 04:26:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:26:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2023-11-29 04:26:23,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9384203480589023 [2023-11-29 04:26:23,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 701 transitions. [2023-11-29 04:26:23,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 701 transitions. [2023-11-29 04:26:23,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:23,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 701 transitions. [2023-11-29 04:26:23,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:23,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:23,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:23,906 INFO L175 Difference]: Start difference. First operand has 256 places, 306 transitions, 960 flow. Second operand 3 states and 701 transitions. [2023-11-29 04:26:23,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 309 transitions, 1017 flow [2023-11-29 04:26:23,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 309 transitions, 1017 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:26:23,930 INFO L231 Difference]: Finished difference. Result has 256 places, 302 transitions, 951 flow [2023-11-29 04:26:23,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=256, PETRI_TRANSITIONS=302} [2023-11-29 04:26:23,931 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places. [2023-11-29 04:26:23,931 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 302 transitions, 951 flow [2023-11-29 04:26:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:23,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:23,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:23,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 04:26:23,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:23,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 609091797, now seen corresponding path program 1 times [2023-11-29 04:26:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224191874] [2023-11-29 04:26:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:23,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224191874] [2023-11-29 04:26:23,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224191874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:23,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:23,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:23,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457991228] [2023-11-29 04:26:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:23,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:23,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:23,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:24,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249 [2023-11-29 04:26:24,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 302 transitions, 951 flow. Second operand has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:24,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:24,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249 [2023-11-29 04:26:24,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:24,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][155], [278#(= |#race~datas~0| 0), 281#true, Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 119#L1048-9true, threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#L1048-8true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true]) [2023-11-29 04:26:24,722 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is not cut-off event [2023-11-29 04:26:24,722 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2023-11-29 04:26:24,722 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2023-11-29 04:26:24,722 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2023-11-29 04:26:24,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][155], [278#(= |#race~datas~0| 0), 281#true, Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, 138#L1048-8true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true]) [2023-11-29 04:26:24,754 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event [2023-11-29 04:26:24,754 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:24,754 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:24,754 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:24,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L1070-5-->L1070-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0))) InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} AuxVars[] AssignedVars[][168], [278#(= |#race~datas~0| 0), 281#true, Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, 138#L1048-8true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), 89#L1070-6true]) [2023-11-29 04:26:24,795 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2023-11-29 04:26:24,795 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:24,795 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:24,795 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:27,347 INFO L124 PetriNetUnfolderBase]: 5048/24150 cut-off events. [2023-11-29 04:26:27,348 INFO L125 PetriNetUnfolderBase]: For 2076/2081 co-relation queries the response was YES. [2023-11-29 04:26:27,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37783 conditions, 24150 events. 5048/24150 cut-off events. For 2076/2081 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 309971 event pairs, 1376 based on Foata normal form. 1/21529 useless extension candidates. Maximal degree in co-relation 35775. Up to 2663 conditions per place. [2023-11-29 04:26:27,477 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions. [2023-11-29 04:26:27,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 308 transitions, 1015 flow [2023-11-29 04:26:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:26:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions. [2023-11-29 04:26:27,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9307228915662651 [2023-11-29 04:26:27,478 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 927 transitions. [2023-11-29 04:26:27,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions. [2023-11-29 04:26:27,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:27,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions. [2023-11-29 04:26:27,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:27,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:27,480 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:27,481 INFO L175 Difference]: Start difference. First operand has 256 places, 302 transitions, 951 flow. Second operand 4 states and 927 transitions. [2023-11-29 04:26:27,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 308 transitions, 1015 flow [2023-11-29 04:26:27,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 308 transitions, 1005 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-29 04:26:27,515 INFO L231 Difference]: Finished difference. Result has 255 places, 305 transitions, 966 flow [2023-11-29 04:26:27,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=966, PETRI_PLACES=255, PETRI_TRANSITIONS=305} [2023-11-29 04:26:27,515 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2023-11-29 04:26:27,516 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 305 transitions, 966 flow [2023-11-29 04:26:27,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:27,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:27,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:27,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 04:26:27,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:27,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1184349591, now seen corresponding path program 1 times [2023-11-29 04:26:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:27,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800487719] [2023-11-29 04:26:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:27,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800487719] [2023-11-29 04:26:27,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800487719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:27,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:27,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302318354] [2023-11-29 04:26:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:27,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:27,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:27,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:27,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249 [2023-11-29 04:26:27,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 305 transitions, 966 flow. Second operand has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:27,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:27,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249 [2023-11-29 04:26:27,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:28,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][154], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 119#L1048-9true, threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#L1048-8true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:28,134 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event [2023-11-29 04:26:28,134 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:28,134 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:28,134 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:28,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][154], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, Black: 276#true, 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:28,170 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2023-11-29 04:26:28,170 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:28,170 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:28,170 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:28,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L1070-5-->L1070-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0))) InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} AuxVars[] AssignedVars[][167], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, Black: 276#true, 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), 89#L1070-6true, Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:28,216 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event [2023-11-29 04:26:28,216 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2023-11-29 04:26:28,216 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2023-11-29 04:26:28,216 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2023-11-29 04:26:31,239 INFO L124 PetriNetUnfolderBase]: 5047/24148 cut-off events. [2023-11-29 04:26:31,239 INFO L125 PetriNetUnfolderBase]: For 2159/2164 co-relation queries the response was YES. [2023-11-29 04:26:31,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37804 conditions, 24148 events. 5047/24148 cut-off events. For 2159/2164 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 310262 event pairs, 1376 based on Foata normal form. 1/21470 useless extension candidates. Maximal degree in co-relation 35791. Up to 2663 conditions per place. [2023-11-29 04:26:31,365 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 21 selfloop transitions, 4 changer transitions 0/307 dead transitions. [2023-11-29 04:26:31,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 307 transitions, 1020 flow [2023-11-29 04:26:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:26:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 926 transitions. [2023-11-29 04:26:31,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.929718875502008 [2023-11-29 04:26:31,367 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 926 transitions. [2023-11-29 04:26:31,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 926 transitions. [2023-11-29 04:26:31,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:31,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 926 transitions. [2023-11-29 04:26:31,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 231.5) internal successors, (926), 4 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:31,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:31,369 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:31,369 INFO L175 Difference]: Start difference. First operand has 255 places, 305 transitions, 966 flow. Second operand 4 states and 926 transitions. [2023-11-29 04:26:31,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 307 transitions, 1020 flow [2023-11-29 04:26:31,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 307 transitions, 1020 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:26:31,397 INFO L231 Difference]: Finished difference. Result has 260 places, 306 transitions, 985 flow [2023-11-29 04:26:31,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=985, PETRI_PLACES=260, PETRI_TRANSITIONS=306} [2023-11-29 04:26:31,398 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places. [2023-11-29 04:26:31,398 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 306 transitions, 985 flow [2023-11-29 04:26:31,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:31,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:31,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:31,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 04:26:31,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:31,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash 30266230, now seen corresponding path program 1 times [2023-11-29 04:26:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79457787] [2023-11-29 04:26:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:31,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79457787] [2023-11-29 04:26:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79457787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:31,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:31,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788929402] [2023-11-29 04:26:31,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:31,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:31,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249 [2023-11-29 04:26:31,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 306 transitions, 985 flow. Second operand has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:31,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:31,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249 [2023-11-29 04:26:31,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:32,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][155], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 295#true, 119#L1048-9true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#L1048-8true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:32,143 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event [2023-11-29 04:26:32,143 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:32,143 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:32,143 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-29 04:26:32,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][155], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, Black: 276#true, 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:32,176 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2023-11-29 04:26:32,176 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:32,176 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:32,176 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-29 04:26:32,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L1070-5-->L1070-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0))) InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} AuxVars[] AssignedVars[][168], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, Black: 276#true, 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), 89#L1070-6true, Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:32,219 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event [2023-11-29 04:26:32,219 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2023-11-29 04:26:32,219 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2023-11-29 04:26:32,219 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2023-11-29 04:26:34,862 INFO L124 PetriNetUnfolderBase]: 5165/24365 cut-off events. [2023-11-29 04:26:34,863 INFO L125 PetriNetUnfolderBase]: For 2373/2378 co-relation queries the response was YES. [2023-11-29 04:26:34,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38437 conditions, 24365 events. 5165/24365 cut-off events. For 2373/2378 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 313070 event pairs, 1478 based on Foata normal form. 1/21716 useless extension candidates. Maximal degree in co-relation 38318. Up to 2861 conditions per place. [2023-11-29 04:26:35,001 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 23 selfloop transitions, 4 changer transitions 0/308 dead transitions. [2023-11-29 04:26:35,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 308 transitions, 1043 flow [2023-11-29 04:26:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:26:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 924 transitions. [2023-11-29 04:26:35,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.927710843373494 [2023-11-29 04:26:35,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 924 transitions. [2023-11-29 04:26:35,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 924 transitions. [2023-11-29 04:26:35,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:35,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 924 transitions. [2023-11-29 04:26:35,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:35,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:35,007 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:35,007 INFO L175 Difference]: Start difference. First operand has 260 places, 306 transitions, 985 flow. Second operand 4 states and 924 transitions. [2023-11-29 04:26:35,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 308 transitions, 1043 flow [2023-11-29 04:26:35,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 308 transitions, 1040 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:26:35,054 INFO L231 Difference]: Finished difference. Result has 263 places, 306 transitions, 994 flow [2023-11-29 04:26:35,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=994, PETRI_PLACES=263, PETRI_TRANSITIONS=306} [2023-11-29 04:26:35,054 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places. [2023-11-29 04:26:35,055 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 306 transitions, 994 flow [2023-11-29 04:26:35,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:35,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:35,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:35,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 04:26:35,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:35,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 268158050, now seen corresponding path program 1 times [2023-11-29 04:26:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:35,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502719893] [2023-11-29 04:26:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:35,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:35,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502719893] [2023-11-29 04:26:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502719893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:35,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:35,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:35,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503707015] [2023-11-29 04:26:35,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:35,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:35,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249 [2023-11-29 04:26:35,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 306 transitions, 994 flow. Second operand has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:35,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:35,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249 [2023-11-29 04:26:35,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:35,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][154], [278#(= |#race~datas~0| 0), 281#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 295#true, Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 119#L1048-9true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 303#true, Black: 276#true, 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:35,829 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2023-11-29 04:26:35,829 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is not cut-off event [2023-11-29 04:26:35,829 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is not cut-off event [2023-11-29 04:26:35,830 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is not cut-off event [2023-11-29 04:26:35,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][154], [278#(= |#race~datas~0| 0), 281#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 295#true, Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, 303#true, Black: 276#true, 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:35,878 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event [2023-11-29 04:26:35,878 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2023-11-29 04:26:35,878 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2023-11-29 04:26:35,878 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2023-11-29 04:26:35,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L1070-5-->L1070-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0))) InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} AuxVars[] AssignedVars[][167], [278#(= |#race~datas~0| 0), 281#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 295#true, Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 85#L1048-10true, 303#true, Black: 276#true, 138#L1048-8true, Black: 248#(= |#race~threads_mask~0| 0), 89#L1070-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:35,939 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2023-11-29 04:26:35,940 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2023-11-29 04:26:35,940 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2023-11-29 04:26:35,940 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2023-11-29 04:26:38,978 INFO L124 PetriNetUnfolderBase]: 5057/24173 cut-off events. [2023-11-29 04:26:38,979 INFO L125 PetriNetUnfolderBase]: For 2451/2456 co-relation queries the response was YES. [2023-11-29 04:26:39,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38116 conditions, 24173 events. 5057/24173 cut-off events. For 2451/2456 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 310687 event pairs, 1382 based on Foata normal form. 1/21578 useless extension candidates. Maximal degree in co-relation 37996. Up to 2673 conditions per place. [2023-11-29 04:26:39,112 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 21 selfloop transitions, 4 changer transitions 0/307 dead transitions. [2023-11-29 04:26:39,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 1046 flow [2023-11-29 04:26:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:26:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 926 transitions. [2023-11-29 04:26:39,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.929718875502008 [2023-11-29 04:26:39,114 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 926 transitions. [2023-11-29 04:26:39,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 926 transitions. [2023-11-29 04:26:39,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:39,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 926 transitions. [2023-11-29 04:26:39,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 231.5) internal successors, (926), 4 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:39,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:39,116 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:39,116 INFO L175 Difference]: Start difference. First operand has 263 places, 306 transitions, 994 flow. Second operand 4 states and 926 transitions. [2023-11-29 04:26:39,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 1046 flow [2023-11-29 04:26:39,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 307 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:26:39,146 INFO L231 Difference]: Finished difference. Result has 264 places, 306 transitions, 998 flow [2023-11-29 04:26:39,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=998, PETRI_PLACES=264, PETRI_TRANSITIONS=306} [2023-11-29 04:26:39,146 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 25 predicate places. [2023-11-29 04:26:39,146 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 306 transitions, 998 flow [2023-11-29 04:26:39,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:39,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:39,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:39,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 04:26:39,147 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:39,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1383880817, now seen corresponding path program 1 times [2023-11-29 04:26:39,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:39,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683984769] [2023-11-29 04:26:39,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:39,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:39,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:39,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683984769] [2023-11-29 04:26:39,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683984769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:39,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:39,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:26:39,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321986575] [2023-11-29 04:26:39,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:39,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:39,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:39,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:39,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 249 [2023-11-29 04:26:39,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 306 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:39,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:39,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 249 [2023-11-29 04:26:39,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:39,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][152], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 119#L1048-9true, threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 303#true, 138#L1048-8true, Black: 276#true, 309#true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:39,746 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event [2023-11-29 04:26:39,746 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is not cut-off event [2023-11-29 04:26:39,746 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is not cut-off event [2023-11-29 04:26:39,746 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is not cut-off event [2023-11-29 04:26:39,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1068-5-->L1068-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|)))) InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][152], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 303#true, 85#L1048-10true, 138#L1048-8true, Black: 276#true, 309#true, Black: 248#(= |#race~threads_mask~0| 0), 127#L1068-6true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:39,784 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event [2023-11-29 04:26:39,784 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2023-11-29 04:26:39,784 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2023-11-29 04:26:39,784 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2023-11-29 04:26:39,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L1070-5-->L1070-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0))) InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|} AuxVars[] AssignedVars[][165], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 85#L1048-10true, 303#true, 138#L1048-8true, Black: 276#true, 309#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), 89#L1070-6true, Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|))]) [2023-11-29 04:26:39,835 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2023-11-29 04:26:39,836 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2023-11-29 04:26:39,836 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2023-11-29 04:26:39,836 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2023-11-29 04:26:42,866 INFO L124 PetriNetUnfolderBase]: 5519/25053 cut-off events. [2023-11-29 04:26:42,866 INFO L125 PetriNetUnfolderBase]: For 3428/3762 co-relation queries the response was YES. [2023-11-29 04:26:42,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39700 conditions, 25053 events. 5519/25053 cut-off events. For 3428/3762 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 319446 event pairs, 1296 based on Foata normal form. 45/22253 useless extension candidates. Maximal degree in co-relation 39581. Up to 3512 conditions per place. [2023-11-29 04:26:43,043 INFO L140 encePairwiseOnDemand]: 241/249 looper letters, 32 selfloop transitions, 12 changer transitions 0/320 dead transitions. [2023-11-29 04:26:43,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 320 transitions, 1130 flow [2023-11-29 04:26:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:26:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2023-11-29 04:26:43,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9370816599732262 [2023-11-29 04:26:43,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 700 transitions. [2023-11-29 04:26:43,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 700 transitions. [2023-11-29 04:26:43,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:43,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 700 transitions. [2023-11-29 04:26:43,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:43,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:43,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:43,047 INFO L175 Difference]: Start difference. First operand has 264 places, 306 transitions, 998 flow. Second operand 3 states and 700 transitions. [2023-11-29 04:26:43,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 320 transitions, 1130 flow [2023-11-29 04:26:43,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 320 transitions, 1122 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:26:43,078 INFO L231 Difference]: Finished difference. Result has 265 places, 316 transitions, 1096 flow [2023-11-29 04:26:43,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=265, PETRI_TRANSITIONS=316} [2023-11-29 04:26:43,079 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 26 predicate places. [2023-11-29 04:26:43,079 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 316 transitions, 1096 flow [2023-11-29 04:26:43,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:43,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:43,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:43,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 04:26:43,080 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:43,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1942247241, now seen corresponding path program 1 times [2023-11-29 04:26:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482465576] [2023-11-29 04:26:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:43,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:43,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482465576] [2023-11-29 04:26:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482465576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:43,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:43,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:26:43,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102670718] [2023-11-29 04:26:43,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:43,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:26:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:43,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:26:43,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:26:43,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249 [2023-11-29 04:26:43,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 316 transitions, 1096 flow. Second operand has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:43,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:43,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249 [2023-11-29 04:26:43,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:26:52,353 INFO L124 PetriNetUnfolderBase]: 16566/60758 cut-off events. [2023-11-29 04:26:52,353 INFO L125 PetriNetUnfolderBase]: For 13822/15337 co-relation queries the response was YES. [2023-11-29 04:26:52,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106834 conditions, 60758 events. 16566/60758 cut-off events. For 13822/15337 co-relation queries the response was YES. Maximal size of possible extension queue 1661. Compared 846068 event pairs, 4243 based on Foata normal form. 47/53476 useless extension candidates. Maximal degree in co-relation 106553. Up to 14789 conditions per place. [2023-11-29 04:26:52,745 INFO L140 encePairwiseOnDemand]: 222/249 looper letters, 125 selfloop transitions, 136 changer transitions 0/492 dead transitions. [2023-11-29 04:26:52,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 492 transitions, 2362 flow [2023-11-29 04:26:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:26:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:26:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1387 transitions. [2023-11-29 04:26:52,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.928380187416332 [2023-11-29 04:26:52,748 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1387 transitions. [2023-11-29 04:26:52,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1387 transitions. [2023-11-29 04:26:52,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:26:52,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1387 transitions. [2023-11-29 04:26:52,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:52,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:52,751 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:52,751 INFO L175 Difference]: Start difference. First operand has 265 places, 316 transitions, 1096 flow. Second operand 6 states and 1387 transitions. [2023-11-29 04:26:52,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 492 transitions, 2362 flow [2023-11-29 04:26:52,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 492 transitions, 2338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:26:52,881 INFO L231 Difference]: Finished difference. Result has 272 places, 449 transitions, 2210 flow [2023-11-29 04:26:52,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2210, PETRI_PLACES=272, PETRI_TRANSITIONS=449} [2023-11-29 04:26:52,881 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places. [2023-11-29 04:26:52,881 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 449 transitions, 2210 flow [2023-11-29 04:26:52,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:52,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:26:52,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:52,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 04:26:52,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:26:52,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash -160850609, now seen corresponding path program 1 times [2023-11-29 04:26:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:26:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305636035] [2023-11-29 04:26:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:26:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:26:53,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:26:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305636035] [2023-11-29 04:26:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305636035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:53,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:26:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099054869] [2023-11-29 04:26:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:53,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:26:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:26:53,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:26:53,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:26:53,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 249 [2023-11-29 04:26:53,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 449 transitions, 2210 flow. Second operand has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:53,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:26:53,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 249 [2023-11-29 04:26:53,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:27:03,445 INFO L124 PetriNetUnfolderBase]: 16236/68452 cut-off events. [2023-11-29 04:27:03,446 INFO L125 PetriNetUnfolderBase]: For 29672/30933 co-relation queries the response was YES. [2023-11-29 04:27:03,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127439 conditions, 68452 events. 16236/68452 cut-off events. For 29672/30933 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 1018823 event pairs, 2971 based on Foata normal form. 52/60439 useless extension candidates. Maximal degree in co-relation 127147. Up to 12712 conditions per place. [2023-11-29 04:27:04,134 INFO L140 encePairwiseOnDemand]: 234/249 looper letters, 132 selfloop transitions, 119 changer transitions 0/581 dead transitions. [2023-11-29 04:27:04,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 581 transitions, 3612 flow [2023-11-29 04:27:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:27:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:27:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1371 transitions. [2023-11-29 04:27:04,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9176706827309237 [2023-11-29 04:27:04,136 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1371 transitions. [2023-11-29 04:27:04,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1371 transitions. [2023-11-29 04:27:04,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:27:04,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1371 transitions. [2023-11-29 04:27:04,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:04,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:04,139 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:04,139 INFO L175 Difference]: Start difference. First operand has 272 places, 449 transitions, 2210 flow. Second operand 6 states and 1371 transitions. [2023-11-29 04:27:04,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 581 transitions, 3612 flow [2023-11-29 04:27:04,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 581 transitions, 3558 flow, removed 27 selfloop flow, removed 0 redundant places. [2023-11-29 04:27:04,268 INFO L231 Difference]: Finished difference. Result has 282 places, 563 transitions, 3576 flow [2023-11-29 04:27:04,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3576, PETRI_PLACES=282, PETRI_TRANSITIONS=563} [2023-11-29 04:27:04,269 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 43 predicate places. [2023-11-29 04:27:04,269 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 563 transitions, 3576 flow [2023-11-29 04:27:04,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:04,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:27:04,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:04,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 04:27:04,270 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:27:04,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash 470109862, now seen corresponding path program 1 times [2023-11-29 04:27:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:04,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901043476] [2023-11-29 04:27:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:27:04,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:04,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901043476] [2023-11-29 04:27:04,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901043476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:04,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:27:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98725380] [2023-11-29 04:27:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:04,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:27:04,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:27:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:27:05,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249 [2023-11-29 04:27:05,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 563 transitions, 3576 flow. Second operand has 10 states, 10 states have (on average 200.1) internal successors, (2001), 10 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:05,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:27:05,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249 [2023-11-29 04:27:05,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:27:19,066 INFO L124 PetriNetUnfolderBase]: 23393/78879 cut-off events. [2023-11-29 04:27:19,066 INFO L125 PetriNetUnfolderBase]: For 59470/65269 co-relation queries the response was YES. [2023-11-29 04:27:19,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182649 conditions, 78879 events. 23393/78879 cut-off events. For 59470/65269 co-relation queries the response was YES. Maximal size of possible extension queue 2206. Compared 1114229 event pairs, 5081 based on Foata normal form. 884/71490 useless extension candidates. Maximal degree in co-relation 182365. Up to 14922 conditions per place. [2023-11-29 04:27:19,911 INFO L140 encePairwiseOnDemand]: 229/249 looper letters, 424 selfloop transitions, 224 changer transitions 0/874 dead transitions. [2023-11-29 04:27:19,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 874 transitions, 7068 flow [2023-11-29 04:27:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:27:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 04:27:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions. [2023-11-29 04:27:19,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8682000730193501 [2023-11-29 04:27:19,914 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2378 transitions. [2023-11-29 04:27:19,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2378 transitions. [2023-11-29 04:27:19,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:27:19,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2378 transitions. [2023-11-29 04:27:19,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 216.1818181818182) internal successors, (2378), 11 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:19,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:19,920 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:19,920 INFO L175 Difference]: Start difference. First operand has 282 places, 563 transitions, 3576 flow. Second operand 11 states and 2378 transitions. [2023-11-29 04:27:19,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 874 transitions, 7068 flow [2023-11-29 04:27:20,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 874 transitions, 7020 flow, removed 24 selfloop flow, removed 0 redundant places. [2023-11-29 04:27:20,458 INFO L231 Difference]: Finished difference. Result has 299 places, 689 transitions, 5536 flow [2023-11-29 04:27:20,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3528, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5536, PETRI_PLACES=299, PETRI_TRANSITIONS=689} [2023-11-29 04:27:20,458 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 60 predicate places. [2023-11-29 04:27:20,459 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 689 transitions, 5536 flow [2023-11-29 04:27:20,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 200.1) internal successors, (2001), 10 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:20,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:27:20,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:20,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 04:27:20,459 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:27:20,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash 297173042, now seen corresponding path program 1 times [2023-11-29 04:27:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613868686] [2023-11-29 04:27:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:27:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613868686] [2023-11-29 04:27:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613868686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:20,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:20,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:27:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619117309] [2023-11-29 04:27:20,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:27:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:20,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:27:20,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:27:21,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 249 [2023-11-29 04:27:21,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 689 transitions, 5536 flow. Second operand has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:21,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:27:21,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 249 [2023-11-29 04:27:21,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:27:35,434 INFO L124 PetriNetUnfolderBase]: 19891/72993 cut-off events. [2023-11-29 04:27:35,434 INFO L125 PetriNetUnfolderBase]: For 104352/108506 co-relation queries the response was YES. [2023-11-29 04:27:35,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183357 conditions, 72993 events. 19891/72993 cut-off events. For 104352/108506 co-relation queries the response was YES. Maximal size of possible extension queue 2108. Compared 1059888 event pairs, 4555 based on Foata normal form. 1037/66085 useless extension candidates. Maximal degree in co-relation 183063. Up to 20527 conditions per place. [2023-11-29 04:27:36,123 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 404 selfloop transitions, 18 changer transitions 0/702 dead transitions. [2023-11-29 04:27:36,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 702 transitions, 6478 flow [2023-11-29 04:27:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:27:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:27:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2072 transitions. [2023-11-29 04:27:36,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8321285140562249 [2023-11-29 04:27:36,126 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2072 transitions. [2023-11-29 04:27:36,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2072 transitions. [2023-11-29 04:27:36,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:27:36,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2072 transitions. [2023-11-29 04:27:36,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 207.2) internal successors, (2072), 10 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:36,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:36,132 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:36,132 INFO L175 Difference]: Start difference. First operand has 299 places, 689 transitions, 5536 flow. Second operand 10 states and 2072 transitions. [2023-11-29 04:27:36,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 702 transitions, 6478 flow [2023-11-29 04:27:37,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 702 transitions, 6434 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-11-29 04:27:37,241 INFO L231 Difference]: Finished difference. Result has 306 places, 690 transitions, 5564 flow [2023-11-29 04:27:37,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5480, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5564, PETRI_PLACES=306, PETRI_TRANSITIONS=690} [2023-11-29 04:27:37,241 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 67 predicate places. [2023-11-29 04:27:37,241 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 690 transitions, 5564 flow [2023-11-29 04:27:37,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:37,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:27:37,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:37,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 04:27:37,242 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:27:37,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 659851237, now seen corresponding path program 1 times [2023-11-29 04:27:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050447931] [2023-11-29 04:27:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:27:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050447931] [2023-11-29 04:27:37,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050447931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:37,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:37,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:27:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337683258] [2023-11-29 04:27:37,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:37,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:27:37,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:27:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:27:37,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249 [2023-11-29 04:27:37,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 690 transitions, 5564 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:37,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:27:37,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249 [2023-11-29 04:27:37,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:27:40,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 152#L1068-2true, Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 27#L1050-1true, Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true]) [2023-11-29 04:27:40,759 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 04:27:40,759 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 04:27:40,759 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 04:27:40,759 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 04:27:41,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, 315#true, Black: 276#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 13#L1049-3true, Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 127#L1068-6true]) [2023-11-29 04:27:41,206 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-29 04:27:41,206 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 04:27:41,206 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 04:27:41,206 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 04:27:41,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 27#L1050-1true, Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true, 127#L1068-6true]) [2023-11-29 04:27:41,843 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-29 04:27:41,843 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-29 04:27:41,843 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-29 04:27:41,843 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-29 04:27:41,885 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 27#L1050-1true, Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true, 127#L1068-6true]) [2023-11-29 04:27:41,885 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-29 04:27:41,885 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-29 04:27:41,885 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-29 04:27:41,885 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-29 04:27:41,886 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-29 04:27:42,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 152#L1068-2true, Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, 315#true, Black: 276#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 232#L1050-19true, 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true]) [2023-11-29 04:27:42,643 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-29 04:27:42,643 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-29 04:27:42,643 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-29 04:27:42,643 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-29 04:27:43,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 152#L1068-2true, Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 52#L1050-20true, Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)]) [2023-11-29 04:27:43,054 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2023-11-29 04:27:43,054 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2023-11-29 04:27:43,054 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2023-11-29 04:27:43,054 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2023-11-29 04:27:43,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), 113#L1050-21true, Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 152#L1068-2true, Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)]) [2023-11-29 04:27:43,400 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-29 04:27:43,400 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-29 04:27:43,400 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-29 04:27:43,401 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-29 04:27:44,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 232#L1050-19true, 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true, 127#L1068-6true]) [2023-11-29 04:27:44,055 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,055 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,055 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,055 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,095 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 232#L1050-19true, 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true, 127#L1068-6true]) [2023-11-29 04:27:44,096 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), 113#L1050-21true, Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 127#L1068-6true, 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)]) [2023-11-29 04:27:44,096 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 52#L1050-20true, Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 127#L1068-6true, 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)]) [2023-11-29 04:27:44,096 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,096 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,097 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,374 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 52#L1050-20true, Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 127#L1068-6true, 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)]) [2023-11-29 04:27:44,374 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,374 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,374 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,375 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,375 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2023-11-29 04:27:44,865 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), 113#L1050-21true, Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 127#L1068-6true, 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)]) [2023-11-29 04:27:44,865 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,865 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,865 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,865 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,865 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 152#L1068-2true, Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, 62#L1051-3true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|)]) [2023-11-29 04:27:44,902 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,902 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,903 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:44,903 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-29 04:27:45,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 166#L1051true, Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 326#true, 281#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread1of2ForFork0InUse, Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 127#L1068-6true]) [2023-11-29 04:27:45,860 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2023-11-29 04:27:45,860 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2023-11-29 04:27:45,860 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2023-11-29 04:27:45,860 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2023-11-29 04:27:46,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, 62#L1051-3true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 127#L1068-6true]) [2023-11-29 04:27:46,302 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2023-11-29 04:27:46,302 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 04:27:46,302 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 04:27:46,302 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 04:27:46,332 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([775] L1049-->L1049-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 15#L1049-3true, 315#true, Black: 276#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 281#true, 326#true, Black: 291#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, 62#L1051-3true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 300#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 127#L1068-6true]) [2023-11-29 04:27:46,333 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2023-11-29 04:27:46,333 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 04:27:46,333 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 04:27:46,333 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 04:27:46,333 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-29 04:27:51,063 INFO L124 PetriNetUnfolderBase]: 17542/74117 cut-off events. [2023-11-29 04:27:51,063 INFO L125 PetriNetUnfolderBase]: For 80191/86136 co-relation queries the response was YES. [2023-11-29 04:27:51,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166040 conditions, 74117 events. 17542/74117 cut-off events. For 80191/86136 co-relation queries the response was YES. Maximal size of possible extension queue 1965. Compared 1117811 event pairs, 2555 based on Foata normal form. 227/66434 useless extension candidates. Maximal degree in co-relation 165654. Up to 8989 conditions per place. [2023-11-29 04:27:51,765 INFO L140 encePairwiseOnDemand]: 240/249 looper letters, 38 selfloop transitions, 19 changer transitions 0/711 dead transitions. [2023-11-29 04:27:51,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 711 transitions, 5772 flow [2023-11-29 04:27:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:27:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:27:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2023-11-29 04:27:51,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9464524765729585 [2023-11-29 04:27:51,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 707 transitions. [2023-11-29 04:27:51,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions. [2023-11-29 04:27:51,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:27:51,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions. [2023-11-29 04:27:51,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 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) [2023-11-29 04:27:51,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:51,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:51,769 INFO L175 Difference]: Start difference. First operand has 306 places, 690 transitions, 5564 flow. Second operand 3 states and 707 transitions. [2023-11-29 04:27:51,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 711 transitions, 5772 flow [2023-11-29 04:27:52,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 711 transitions, 5736 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-29 04:27:52,577 INFO L231 Difference]: Finished difference. Result has 305 places, 705 transitions, 5710 flow [2023-11-29 04:27:52,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5528, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5710, PETRI_PLACES=305, PETRI_TRANSITIONS=705} [2023-11-29 04:27:52,578 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 66 predicate places. [2023-11-29 04:27:52,578 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 705 transitions, 5710 flow [2023-11-29 04:27:52,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:52,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:27:52,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:52,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 04:27:52,579 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:27:52,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash -229663673, now seen corresponding path program 1 times [2023-11-29 04:27:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:52,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097638291] [2023-11-29 04:27:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:27:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097638291] [2023-11-29 04:27:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097638291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150643319] [2023-11-29 04:27:53,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:53,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:27:53,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:53,073 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:27:53,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 04:27:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:53,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 04:27:53,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:53,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:27:53,235 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:27:53,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 04:27:53,294 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 04:27:53,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:27:53,696 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:27:53,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 04:27:53,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:27:53,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:27:53,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:27:53,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:27:53,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:27:53,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:27:53,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:27:53,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:27:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:27:53,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:27:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150643319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:53,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:27:53,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 19 [2023-11-29 04:27:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72702765] [2023-11-29 04:27:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:53,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:27:53,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:53,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:27:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:27:54,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 249 [2023-11-29 04:27:54,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 705 transitions, 5710 flow. Second operand has 14 states, 14 states have (on average 187.35714285714286) internal successors, (2623), 14 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:54,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:27:54,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 249 [2023-11-29 04:27:54,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:20,074 INFO L124 PetriNetUnfolderBase]: 37739/118788 cut-off events. [2023-11-29 04:28:20,075 INFO L125 PetriNetUnfolderBase]: For 214225/215406 co-relation queries the response was YES. [2023-11-29 04:28:20,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324571 conditions, 118788 events. 37739/118788 cut-off events. For 214225/215406 co-relation queries the response was YES. Maximal size of possible extension queue 3049. Compared 1720615 event pairs, 6611 based on Foata normal form. 227/108344 useless extension candidates. Maximal degree in co-relation 323798. Up to 14794 conditions per place. [2023-11-29 04:28:21,309 INFO L140 encePairwiseOnDemand]: 225/249 looper letters, 1026 selfloop transitions, 487 changer transitions 0/1737 dead transitions. [2023-11-29 04:28:21,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1737 transitions, 19545 flow [2023-11-29 04:28:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:28:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-29 04:28:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3980 transitions. [2023-11-29 04:28:21,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7991967871485943 [2023-11-29 04:28:21,313 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3980 transitions. [2023-11-29 04:28:21,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3980 transitions. [2023-11-29 04:28:21,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:21,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3980 transitions. [2023-11-29 04:28:21,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 199.0) internal successors, (3980), 20 states have internal predecessors, (3980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:21,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:21,319 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:21,319 INFO L175 Difference]: Start difference. First operand has 305 places, 705 transitions, 5710 flow. Second operand 20 states and 3980 transitions. [2023-11-29 04:28:21,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1737 transitions, 19545 flow [2023-11-29 04:28:23,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1737 transitions, 19507 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:28:23,893 INFO L231 Difference]: Finished difference. Result has 332 places, 1116 transitions, 12628 flow [2023-11-29 04:28:23,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5672, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12628, PETRI_PLACES=332, PETRI_TRANSITIONS=1116} [2023-11-29 04:28:23,894 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 93 predicate places. [2023-11-29 04:28:23,894 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 1116 transitions, 12628 flow [2023-11-29 04:28:23,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 187.35714285714286) internal successors, (2623), 14 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:23,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:28:23,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:28:23,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 04:28:24,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-11-29 04:28:24,096 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:28:24,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash 579946045, now seen corresponding path program 2 times [2023-11-29 04:28:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:28:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015358400] [2023-11-29 04:28:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:28:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:24,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:28:24,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015358400] [2023-11-29 04:28:24,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015358400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:28:24,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101457068] [2023-11-29 04:28:24,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:28:24,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:28:24,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:28:24,927 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:28:24,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 04:28:25,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:28:25,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:28:25,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 04:28:25,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:25,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:28:25,166 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:28:25,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:28:25,503 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:28:25,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:28:25,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:28:25,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:28:25,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:28:25,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:28:25,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:25,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:28:25,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:25,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:28:25,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:28:25,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:28:25,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:28:26,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:28:26,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:28:26,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:28:26,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:28:26,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:28:26,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:28:26,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:28:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:28:26,116 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:28:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101457068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:28:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-29 04:28:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556974610] [2023-11-29 04:28:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:26,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:28:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:28:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:28:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:28:27,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249 [2023-11-29 04:28:27,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1116 transitions, 12628 flow. Second operand has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:27,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:28:27,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249 [2023-11-29 04:28:27,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:28:57,226 INFO L124 PetriNetUnfolderBase]: 37020/114028 cut-off events. [2023-11-29 04:28:57,226 INFO L125 PetriNetUnfolderBase]: For 347874/352011 co-relation queries the response was YES. [2023-11-29 04:28:58,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350631 conditions, 114028 events. 37020/114028 cut-off events. For 347874/352011 co-relation queries the response was YES. Maximal size of possible extension queue 3039. Compared 1635695 event pairs, 6496 based on Foata normal form. 723/103580 useless extension candidates. Maximal degree in co-relation 350231. Up to 18658 conditions per place. [2023-11-29 04:28:58,497 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 814 selfloop transitions, 789 changer transitions 28/1856 dead transitions. [2023-11-29 04:28:58,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1856 transitions, 24287 flow [2023-11-29 04:28:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 04:28:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-29 04:28:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5046 transitions. [2023-11-29 04:28:58,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8106024096385542 [2023-11-29 04:28:58,501 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5046 transitions. [2023-11-29 04:28:58,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5046 transitions. [2023-11-29 04:28:58,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:28:58,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5046 transitions. [2023-11-29 04:28:58,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 201.84) internal successors, (5046), 25 states have internal predecessors, (5046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:58,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:58,510 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:58,510 INFO L175 Difference]: Start difference. First operand has 332 places, 1116 transitions, 12628 flow. Second operand 25 states and 5046 transitions. [2023-11-29 04:28:58,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1856 transitions, 24287 flow [2023-11-29 04:29:02,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1856 transitions, 24157 flow, removed 59 selfloop flow, removed 6 redundant places. [2023-11-29 04:29:02,979 INFO L231 Difference]: Finished difference. Result has 360 places, 1423 transitions, 19922 flow [2023-11-29 04:29:02,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=12504, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=19922, PETRI_PLACES=360, PETRI_TRANSITIONS=1423} [2023-11-29 04:29:02,980 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 121 predicate places. [2023-11-29 04:29:02,980 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 1423 transitions, 19922 flow [2023-11-29 04:29:02,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:02,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:29:02,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:29:02,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 04:29:03,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-11-29 04:29:03,182 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:29:03,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1292672639, now seen corresponding path program 3 times [2023-11-29 04:29:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:29:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514080441] [2023-11-29 04:29:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:29:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:29:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514080441] [2023-11-29 04:29:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514080441] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:29:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707091027] [2023-11-29 04:29:03,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:29:03,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:29:03,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:29:03,972 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:29:03,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 04:29:04,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 04:29:04,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:29:04,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 04:29:04,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:04,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:29:04,214 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:29:04,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:29:04,522 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:29:04,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:29:04,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:04,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:29:04,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:29:04,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:29:04,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:29:04,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:29:04,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:29:04,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:29:04,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:29:04,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:04,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:04,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:04,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:05,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:05,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:05,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:05,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:05,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:05,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:29:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707091027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:05,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:29:05,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-29 04:29:05,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325774448] [2023-11-29 04:29:05,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:05,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:29:05,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:29:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:29:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:29:06,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249 [2023-11-29 04:29:06,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1423 transitions, 19922 flow. Second operand has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:06,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:29:06,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249 [2023-11-29 04:29:06,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:29:43,393 INFO L124 PetriNetUnfolderBase]: 41317/125757 cut-off events. [2023-11-29 04:29:43,394 INFO L125 PetriNetUnfolderBase]: For 582670/587224 co-relation queries the response was YES. [2023-11-29 04:29:44,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428867 conditions, 125757 events. 41317/125757 cut-off events. For 582670/587224 co-relation queries the response was YES. Maximal size of possible extension queue 3397. Compared 1820614 event pairs, 6844 based on Foata normal form. 942/114536 useless extension candidates. Maximal degree in co-relation 428437. Up to 19550 conditions per place. [2023-11-29 04:29:45,183 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 1075 selfloop transitions, 1039 changer transitions 16/2355 dead transitions. [2023-11-29 04:29:45,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 2355 transitions, 36398 flow [2023-11-29 04:29:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 04:29:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-29 04:29:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4841 transitions. [2023-11-29 04:29:45,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8100736278447122 [2023-11-29 04:29:45,187 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4841 transitions. [2023-11-29 04:29:45,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4841 transitions. [2023-11-29 04:29:45,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:29:45,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4841 transitions. [2023-11-29 04:29:45,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 201.70833333333334) internal successors, (4841), 24 states have internal predecessors, (4841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:45,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 249.0) internal successors, (6225), 25 states have internal predecessors, (6225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:45,194 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 249.0) internal successors, (6225), 25 states have internal predecessors, (6225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:45,194 INFO L175 Difference]: Start difference. First operand has 360 places, 1423 transitions, 19922 flow. Second operand 24 states and 4841 transitions. [2023-11-29 04:29:45,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 2355 transitions, 36398 flow [2023-11-29 04:29:55,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 2355 transitions, 35368 flow, removed 441 selfloop flow, removed 10 redundant places. [2023-11-29 04:29:55,871 INFO L231 Difference]: Finished difference. Result has 383 places, 1846 transitions, 30151 flow [2023-11-29 04:29:55,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=19064, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=661, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=30151, PETRI_PLACES=383, PETRI_TRANSITIONS=1846} [2023-11-29 04:29:55,873 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 144 predicate places. [2023-11-29 04:29:55,873 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 1846 transitions, 30151 flow [2023-11-29 04:29:55,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:55,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:29:55,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:29:55,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 04:29:56,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-11-29 04:29:56,074 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:29:56,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 252868891, now seen corresponding path program 4 times [2023-11-29 04:29:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:29:56,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885417471] [2023-11-29 04:29:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:29:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:29:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885417471] [2023-11-29 04:29:56,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885417471] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:29:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411731664] [2023-11-29 04:29:56,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:29:56,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:29:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:29:56,789 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:29:56,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 04:29:57,059 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:29:57,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:29:57,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 04:29:57,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:57,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:29:57,141 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:29:57,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:29:57,414 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:29:57,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:29:57,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:57,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:29:57,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:29:57,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:29:57,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:29:57,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:29:57,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:29:57,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:29:57,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:29:57,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:57,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:57,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:57,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:57,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:57,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:57,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:57,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:29:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:29:57,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:29:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411731664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:57,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:29:57,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-29 04:29:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015735486] [2023-11-29 04:29:57,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:57,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:29:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:29:57,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:29:57,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:29:58,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249 [2023-11-29 04:29:58,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1846 transitions, 30151 flow. Second operand has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:58,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:29:58,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249 [2023-11-29 04:29:58,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:30:44,898 INFO L124 PetriNetUnfolderBase]: 43172/132043 cut-off events. [2023-11-29 04:30:44,898 INFO L125 PetriNetUnfolderBase]: For 864134/869308 co-relation queries the response was YES. [2023-11-29 04:30:46,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492337 conditions, 132043 events. 43172/132043 cut-off events. For 864134/869308 co-relation queries the response was YES. Maximal size of possible extension queue 3640. Compared 1928335 event pairs, 7157 based on Foata normal form. 1071/120436 useless extension candidates. Maximal degree in co-relation 491912. Up to 22789 conditions per place. [2023-11-29 04:30:46,913 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 1030 selfloop transitions, 1269 changer transitions 18/2542 dead transitions. [2023-11-29 04:30:46,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 2542 transitions, 44039 flow [2023-11-29 04:30:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 04:30:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-29 04:30:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5253 transitions. [2023-11-29 04:30:46,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8113994439295644 [2023-11-29 04:30:46,917 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 5253 transitions. [2023-11-29 04:30:46,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 5253 transitions. [2023-11-29 04:30:46,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:30:46,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5253 transitions. [2023-11-29 04:30:46,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 202.03846153846155) internal successors, (5253), 26 states have internal predecessors, (5253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:30:46,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 249.0) internal successors, (6723), 27 states have internal predecessors, (6723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:30:46,925 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 249.0) internal successors, (6723), 27 states have internal predecessors, (6723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:30:46,925 INFO L175 Difference]: Start difference. First operand has 383 places, 1846 transitions, 30151 flow. Second operand 26 states and 5253 transitions. [2023-11-29 04:30:46,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 2542 transitions, 44039 flow [2023-11-29 04:31:00,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 2542 transitions, 43417 flow, removed 105 selfloop flow, removed 17 redundant places. [2023-11-29 04:31:00,090 INFO L231 Difference]: Finished difference. Result has 400 places, 2084 transitions, 38968 flow [2023-11-29 04:31:00,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=29627, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=38968, PETRI_PLACES=400, PETRI_TRANSITIONS=2084} [2023-11-29 04:31:00,092 INFO L281 CegarLoopForPetriNet]: 239 programPoint places, 161 predicate places. [2023-11-29 04:31:00,092 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 2084 transitions, 38968 flow [2023-11-29 04:31:00,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:31:00,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:31:00,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:00,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 04:31:00,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-11-29 04:31:00,293 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 04:31:00,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash -571692679, now seen corresponding path program 5 times [2023-11-29 04:31:00,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:31:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524230436] [2023-11-29 04:31:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:00,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:31:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:31:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:31:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524230436] [2023-11-29 04:31:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524230436] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131998318] [2023-11-29 04:31:00,971 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:31:00,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:31:00,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:31:00,972 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:31:00,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b464d32a-1be3-494a-abd2-e975210efe2f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 04:31:01,144 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:31:01,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:31:01,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 04:31:01,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:01,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:31:01,233 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 04:31:01,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 04:31:01,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:31:01,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 04:31:01,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:31:01,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 04:31:01,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 04:31:01,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:31:01,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-29 04:31:01,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:31:01,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 04:31:01,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:31:01,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-29 04:31:01,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:31:01,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:31:01,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:31:01,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:31:01,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:31:01,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:31:01,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:31:01,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:31:02,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 04:31:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:31:02,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:31:02,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131998318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:02,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:31:02,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-29 04:31:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766509495] [2023-11-29 04:31:02,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:31:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:31:02,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:31:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:31:03,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249 [2023-11-29 04:31:03,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 2084 transitions, 38968 flow. Second operand has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:31:03,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:31:03,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249 [2023-11-29 04:31:03,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand