./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/sssc12-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/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_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/sssc12-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/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_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:34:36,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:34:37,041 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-28 23:34:37,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:34:37,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:34:37,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:34:37,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:34:37,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:34:37,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:34:37,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:34:37,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:34:37,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:34:37,074 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:34:37,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:34:37,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:34:37,076 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:34:37,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:34:37,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:34:37,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:34:37,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:34:37,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:34:37,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:34:37,080 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-28 23:34:37,080 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:34:37,081 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:34:37,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:34:37,081 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:34:37,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:34:37,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:34:37,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:34:37,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:34:37,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:34:37,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:34:37,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:34:37,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:34:37,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:34:37,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:34:37,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:34:37,085 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:34:37,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:34:37,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:34:37,086 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_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/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_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2023-11-28 23:34:37,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:34:37,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:34:37,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:34:37,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:34:37,332 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:34:37,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-lit/sssc12-pthread.i [2023-11-28 23:34:40,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:34:40,276 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:34:40,277 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/sv-benchmarks/c/pthread-lit/sssc12-pthread.i [2023-11-28 23:34:40,295 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/data/4897541d3/1c265e01bb9a43e1ad586e7de54a42de/FLAG0a3609d80 [2023-11-28 23:34:40,310 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/data/4897541d3/1c265e01bb9a43e1ad586e7de54a42de [2023-11-28 23:34:40,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:34:40,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:34:40,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:34:40,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:34:40,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:34:40,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:40" (1/1) ... [2023-11-28 23:34:40,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf316e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:40, skipping insertion in model container [2023-11-28 23:34:40,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:34:40" (1/1) ... [2023-11-28 23:34:40,376 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:34:40,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:34:40,901 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:34:40,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:34:41,007 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:34:41,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41 WrapperNode [2023-11-28 23:34:41,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:34:41,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:34:41,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:34:41,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:34:41,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,057 INFO L138 Inliner]: procedures = 273, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-11-28 23:34:41,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:34:41,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:34:41,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:34:41,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:34:41,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:34:41,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:34:41,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:34:41,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:34:41,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (1/1) ... [2023-11-28 23:34:41,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:34:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:34:41,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:34:41,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c01fba3a-5c2b-46b1-b112-ef48d887f4f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:34:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2023-11-28 23:34:41,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2023-11-28 23:34:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:34:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:34:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-28 23:34:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-28 23:34:41,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-28 23:34:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 23:34:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:34:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-28 23:34:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:34:41,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:34:41,161 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:34:41,280 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:34:41,282 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:34:41,488 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:34:41,509 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:34:41,509 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-28 23:34:41,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:41 BoogieIcfgContainer [2023-11-28 23:34:41,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:34:41,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:34:41,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:34:41,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:34:41,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:34:40" (1/3) ... [2023-11-28 23:34:41,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3c939a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:41, skipping insertion in model container [2023-11-28 23:34:41,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:34:41" (2/3) ... [2023-11-28 23:34:41,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3c939a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:34:41, skipping insertion in model container [2023-11-28 23:34:41,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:34:41" (3/3) ... [2023-11-28 23:34:41,518 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12-pthread.i [2023-11-28 23:34:41,525 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-28 23:34:41,533 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:34:41,534 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-28 23:34:41,534 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:34:41,597 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:34:41,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 151 transitions, 306 flow [2023-11-28 23:34:41,694 INFO L124 PetriNetUnfolderBase]: 10/163 cut-off events. [2023-11-28 23:34:41,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:41,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 163 events. 10/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 169 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 85. Up to 4 conditions per place. [2023-11-28 23:34:41,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 151 transitions, 306 flow [2023-11-28 23:34:41,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 151 transitions, 306 flow [2023-11-28 23:34:41,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:34:41,725 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;@1e699725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:34:41,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-11-28 23:34:41,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:34:41,732 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-28 23:34:41,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:41,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:41,733 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] [2023-11-28 23:34:41,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2023-11-28 23:34:41,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1347033221, now seen corresponding path program 1 times [2023-11-28 23:34:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377854467] [2023-11-28 23:34:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:41,993 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-28 23:34:41,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377854467] [2023-11-28 23:34:41,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377854467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:41,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:41,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:41,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965877307] [2023-11-28 23:34:41,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:42,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:42,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 151 [2023-11-28 23:34:42,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 151 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:42,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 151 [2023-11-28 23:34:42,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:42,131 INFO L124 PetriNetUnfolderBase]: 4/139 cut-off events. [2023-11-28 23:34:42,131 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-28 23:34:42,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 139 events. 4/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 12/132 useless extension candidates. Maximal degree in co-relation 77. Up to 11 conditions per place. [2023-11-28 23:34:42,133 INFO L140 encePairwiseOnDemand]: 142/151 looper letters, 10 selfloop transitions, 2 changer transitions 1/135 dead transitions. [2023-11-28 23:34:42,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 298 flow [2023-11-28 23:34:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-11-28 23:34:42,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9028697571743929 [2023-11-28 23:34:42,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-11-28 23:34:42,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-11-28 23:34:42,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:42,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-11-28 23:34:42,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,169 INFO L175 Difference]: Start difference. First operand has 145 places, 151 transitions, 306 flow. Second operand 3 states and 409 transitions. [2023-11-28 23:34:42,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 298 flow [2023-11-28 23:34:42,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:34:42,178 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 276 flow [2023-11-28 23:34:42,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2023-11-28 23:34:42,184 INFO L281 CegarLoopForPetriNet]: 145 programPoint places, -9 predicate places. [2023-11-28 23:34:42,184 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 276 flow [2023-11-28 23:34:42,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:42,185 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] [2023-11-28 23:34:42,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:34:42,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2023-11-28 23:34:42,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1832179261, now seen corresponding path program 1 times [2023-11-28 23:34:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959366312] [2023-11-28 23:34:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:42,259 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-28 23:34:42,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959366312] [2023-11-28 23:34:42,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959366312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:42,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:42,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:42,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756084528] [2023-11-28 23:34:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:42,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:42,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:42,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 151 [2023-11-28 23:34:42,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:42,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 151 [2023-11-28 23:34:42,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:42,332 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2023-11-28 23:34:42,332 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-28 23:34:42,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 137 events. 4/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 127. Up to 12 conditions per place. [2023-11-28 23:34:42,334 INFO L140 encePairwiseOnDemand]: 148/151 looper letters, 11 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2023-11-28 23:34:42,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 133 transitions, 300 flow [2023-11-28 23:34:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-11-28 23:34:42,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8852097130242825 [2023-11-28 23:34:42,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-11-28 23:34:42,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-11-28 23:34:42,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:42,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-11-28 23:34:42,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,343 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 276 flow. Second operand 3 states and 401 transitions. [2023-11-28 23:34:42,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 133 transitions, 300 flow [2023-11-28 23:34:42,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 133 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:42,349 INFO L231 Difference]: Finished difference. Result has 134 places, 133 transitions, 274 flow [2023-11-28 23:34:42,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=134, PETRI_TRANSITIONS=133} [2023-11-28 23:34:42,350 INFO L281 CegarLoopForPetriNet]: 145 programPoint places, -11 predicate places. [2023-11-28 23:34:42,351 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 133 transitions, 274 flow [2023-11-28 23:34:42,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:42,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:42,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:34:42,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2023-11-28 23:34:42,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2125847697, now seen corresponding path program 1 times [2023-11-28 23:34:42,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:42,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843301514] [2023-11-28 23:34:42,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:42,409 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-28 23:34:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843301514] [2023-11-28 23:34:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843301514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:42,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:42,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008525127] [2023-11-28 23:34:42,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:42,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:42,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:42,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:42,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:42,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 151 [2023-11-28 23:34:42,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:42,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 151 [2023-11-28 23:34:42,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:42,471 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2023-11-28 23:34:42,471 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-28 23:34:42,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 132 events. 4/132 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 115. Up to 13 conditions per place. [2023-11-28 23:34:42,473 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 13 selfloop transitions, 1 changer transitions 0/128 dead transitions. [2023-11-28 23:34:42,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 128 transitions, 292 flow [2023-11-28 23:34:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-28 23:34:42,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.869757174392936 [2023-11-28 23:34:42,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-28 23:34:42,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-28 23:34:42,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:42,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-28 23:34:42,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,480 INFO L175 Difference]: Start difference. First operand has 134 places, 133 transitions, 274 flow. Second operand 3 states and 394 transitions. [2023-11-28 23:34:42,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 128 transitions, 292 flow [2023-11-28 23:34:42,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 128 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:42,484 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 262 flow [2023-11-28 23:34:42,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2023-11-28 23:34:42,485 INFO L281 CegarLoopForPetriNet]: 145 programPoint places, -16 predicate places. [2023-11-28 23:34:42,485 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 262 flow [2023-11-28 23:34:42,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:42,486 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] [2023-11-28 23:34:42,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:34:42,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2023-11-28 23:34:42,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1877174168, now seen corresponding path program 1 times [2023-11-28 23:34:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:42,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167817996] [2023-11-28 23:34:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:42,557 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-28 23:34:42,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:42,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167817996] [2023-11-28 23:34:42,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167817996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:42,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:42,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847316926] [2023-11-28 23:34:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:42,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:42,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:42,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:42,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 151 [2023-11-28 23:34:42,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:42,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 151 [2023-11-28 23:34:42,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:42,600 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events. [2023-11-28 23:34:42,600 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-28 23:34:42,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 131 events. 4/131 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 108. Up to 8 conditions per place. [2023-11-28 23:34:42,601 INFO L140 encePairwiseOnDemand]: 148/151 looper letters, 7 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2023-11-28 23:34:42,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 127 transitions, 278 flow [2023-11-28 23:34:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-11-28 23:34:42,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9028697571743929 [2023-11-28 23:34:42,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-11-28 23:34:42,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-11-28 23:34:42,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:42,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-11-28 23:34:42,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,608 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 262 flow. Second operand 3 states and 409 transitions. [2023-11-28 23:34:42,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 127 transitions, 278 flow [2023-11-28 23:34:42,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:34:42,611 INFO L231 Difference]: Finished difference. Result has 129 places, 127 transitions, 263 flow [2023-11-28 23:34:42,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=129, PETRI_TRANSITIONS=127} [2023-11-28 23:34:42,613 INFO L281 CegarLoopForPetriNet]: 145 programPoint places, -16 predicate places. [2023-11-28 23:34:42,613 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 127 transitions, 263 flow [2023-11-28 23:34:42,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:42,614 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] [2023-11-28 23:34:42,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:34:42,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2023-11-28 23:34:42,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash -37872595, now seen corresponding path program 1 times [2023-11-28 23:34:42,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:42,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954709587] [2023-11-28 23:34:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:42,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-28 23:34:42,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:42,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954709587] [2023-11-28 23:34:42,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954709587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:42,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:42,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:34:42,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324374365] [2023-11-28 23:34:42,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:42,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:34:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:34:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:34:42,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 151 [2023-11-28 23:34:42,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 127 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:42,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 151 [2023-11-28 23:34:42,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:42,891 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-11-28 23:34:42,891 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-28 23:34:42,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 134 events. 3/134 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 122. Up to 15 conditions per place. [2023-11-28 23:34:42,892 INFO L140 encePairwiseOnDemand]: 147/151 looper letters, 14 selfloop transitions, 0 changer transitions 4/130 dead transitions. [2023-11-28 23:34:42,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 130 transitions, 305 flow [2023-11-28 23:34:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:34:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:34:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-11-28 23:34:42,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.866225165562914 [2023-11-28 23:34:42,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-11-28 23:34:42,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-11-28 23:34:42,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:42,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-11-28 23:34:42,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 151.0) internal successors, (906), 6 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-28 23:34:42,902 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 151.0) internal successors, (906), 6 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-28 23:34:42,903 INFO L175 Difference]: Start difference. First operand has 129 places, 127 transitions, 263 flow. Second operand 5 states and 654 transitions. [2023-11-28 23:34:42,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 130 transitions, 305 flow [2023-11-28 23:34:42,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:42,906 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 263 flow [2023-11-28 23:34:42,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2023-11-28 23:34:42,907 INFO L281 CegarLoopForPetriNet]: 145 programPoint places, -11 predicate places. [2023-11-28 23:34:42,908 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 263 flow [2023-11-28 23:34:42,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:42,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:42,909 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] [2023-11-28 23:34:42,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:34:42,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2023-11-28 23:34:42,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:42,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1364596238, now seen corresponding path program 1 times [2023-11-28 23:34:42,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:42,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425787846] [2023-11-28 23:34:42,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:42,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:34:42,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:34:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:34:42,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:34:42,981 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:34:42,982 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2023-11-28 23:34:42,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2023-11-28 23:34:42,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2023-11-28 23:34:42,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2023-11-28 23:34:42,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2023-11-28 23:34:42,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2023-11-28 23:34:42,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2023-11-28 23:34:42,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2023-11-28 23:34:42,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2023-11-28 23:34:42,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2023-11-28 23:34:42,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2023-11-28 23:34:42,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2023-11-28 23:34:42,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2023-11-28 23:34:42,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2023-11-28 23:34:42,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2023-11-28 23:34:42,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2023-11-28 23:34:42,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2023-11-28 23:34:42,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2023-11-28 23:34:42,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2023-11-28 23:34:42,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2023-11-28 23:34:42,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2023-11-28 23:34:42,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2023-11-28 23:34:42,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2023-11-28 23:34:42,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:34:42,988 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-28 23:34:42,990 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-28 23:34:42,990 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-28 23:34:43,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:34:43,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 223 transitions, 456 flow [2023-11-28 23:34:43,071 INFO L124 PetriNetUnfolderBase]: 17/249 cut-off events. [2023-11-28 23:34:43,071 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-28 23:34:43,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 249 events. 17/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 567 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 164. Up to 6 conditions per place. [2023-11-28 23:34:43,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 223 transitions, 456 flow [2023-11-28 23:34:43,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 223 transitions, 456 flow [2023-11-28 23:34:43,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:34:43,080 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;@1e699725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:34:43,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-28 23:34:43,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:34:43,083 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-28 23:34:43,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:43,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:43,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] [2023-11-28 23:34:43,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:34:43,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1135280836, now seen corresponding path program 1 times [2023-11-28 23:34:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:43,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961193057] [2023-11-28 23:34:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:43,110 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-28 23:34:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961193057] [2023-11-28 23:34:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961193057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:43,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836571143] [2023-11-28 23:34:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:43,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:43,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:43,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:43,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 223 [2023-11-28 23:34:43,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 223 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:43,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 223 [2023-11-28 23:34:43,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:43,304 INFO L124 PetriNetUnfolderBase]: 70/673 cut-off events. [2023-11-28 23:34:43,304 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-28 23:34:43,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 673 events. 70/673 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3824 event pairs, 42 based on Foata normal form. 99/657 useless extension candidates. Maximal degree in co-relation 616. Up to 102 conditions per place. [2023-11-28 23:34:43,313 INFO L140 encePairwiseOnDemand]: 211/223 looper letters, 17 selfloop transitions, 2 changer transitions 1/201 dead transitions. [2023-11-28 23:34:43,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 201 transitions, 450 flow [2023-11-28 23:34:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2023-11-28 23:34:43,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8998505231689088 [2023-11-28 23:34:43,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 602 transitions. [2023-11-28 23:34:43,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 602 transitions. [2023-11-28 23:34:43,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:43,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 602 transitions. [2023-11-28 23:34:43,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:43,323 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:43,323 INFO L175 Difference]: Start difference. First operand has 213 places, 223 transitions, 456 flow. Second operand 3 states and 602 transitions. [2023-11-28 23:34:43,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 201 transitions, 450 flow [2023-11-28 23:34:43,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 201 transitions, 450 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:34:43,329 INFO L231 Difference]: Finished difference. Result has 201 places, 200 transitions, 414 flow [2023-11-28 23:34:43,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=201, PETRI_TRANSITIONS=200} [2023-11-28 23:34:43,331 INFO L281 CegarLoopForPetriNet]: 213 programPoint places, -12 predicate places. [2023-11-28 23:34:43,331 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 200 transitions, 414 flow [2023-11-28 23:34:43,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:43,332 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] [2023-11-28 23:34:43,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:34:43,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:34:43,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -284671907, now seen corresponding path program 1 times [2023-11-28 23:34:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699151366] [2023-11-28 23:34:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:34:43,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:43,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699151366] [2023-11-28 23:34:43,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699151366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:43,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:43,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116825572] [2023-11-28 23:34:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:43,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:43,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:43,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:43,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 223 [2023-11-28 23:34:43,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 200 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:43,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 223 [2023-11-28 23:34:43,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:43,538 INFO L124 PetriNetUnfolderBase]: 42/529 cut-off events. [2023-11-28 23:34:43,538 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-28 23:34:43,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 529 events. 42/529 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2585 event pairs, 20 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 579. Up to 57 conditions per place. [2023-11-28 23:34:43,544 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 16 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2023-11-28 23:34:43,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 199 transitions, 448 flow [2023-11-28 23:34:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2023-11-28 23:34:43,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8893871449925261 [2023-11-28 23:34:43,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 595 transitions. [2023-11-28 23:34:43,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions. [2023-11-28 23:34:43,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:43,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions. [2023-11-28 23:34:43,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:43,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:43,553 INFO L175 Difference]: Start difference. First operand has 201 places, 200 transitions, 414 flow. Second operand 3 states and 595 transitions. [2023-11-28 23:34:43,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 199 transitions, 448 flow [2023-11-28 23:34:43,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 199 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:43,559 INFO L231 Difference]: Finished difference. Result has 199 places, 199 transitions, 412 flow [2023-11-28 23:34:43,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=199, PETRI_TRANSITIONS=199} [2023-11-28 23:34:43,561 INFO L281 CegarLoopForPetriNet]: 213 programPoint places, -14 predicate places. [2023-11-28 23:34:43,561 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 199 transitions, 412 flow [2023-11-28 23:34:43,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:43,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:43,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:34:43,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:34:43,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1225787791, now seen corresponding path program 1 times [2023-11-28 23:34:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355469121] [2023-11-28 23:34:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:43,595 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-28 23:34:43,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:43,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355469121] [2023-11-28 23:34:43,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355469121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:43,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:43,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100132380] [2023-11-28 23:34:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:43,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:43,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:43,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:43,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 223 [2023-11-28 23:34:43,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 199 transitions, 412 flow. Second operand has 3 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-28 23:34:43,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:43,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 223 [2023-11-28 23:34:43,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:43,795 INFO L124 PetriNetUnfolderBase]: 82/811 cut-off events. [2023-11-28 23:34:43,795 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-28 23:34:43,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 811 events. 82/811 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4803 event pairs, 42 based on Foata normal form. 0/689 useless extension candidates. Maximal degree in co-relation 911. Up to 109 conditions per place. [2023-11-28 23:34:43,802 INFO L140 encePairwiseOnDemand]: 215/223 looper letters, 20 selfloop transitions, 1 changer transitions 0/192 dead transitions. [2023-11-28 23:34:43,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 192 transitions, 440 flow [2023-11-28 23:34:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-11-28 23:34:43,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.866965620328849 [2023-11-28 23:34:43,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-11-28 23:34:43,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-11-28 23:34:43,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:43,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-11-28 23:34:43,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:43,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:43,810 INFO L175 Difference]: Start difference. First operand has 199 places, 199 transitions, 412 flow. Second operand 3 states and 580 transitions. [2023-11-28 23:34:43,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 192 transitions, 440 flow [2023-11-28 23:34:43,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 192 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:43,815 INFO L231 Difference]: Finished difference. Result has 192 places, 192 transitions, 396 flow [2023-11-28 23:34:43,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=192, PETRI_TRANSITIONS=192} [2023-11-28 23:34:43,816 INFO L281 CegarLoopForPetriNet]: 213 programPoint places, -21 predicate places. [2023-11-28 23:34:43,816 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 192 transitions, 396 flow [2023-11-28 23:34:43,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 23:34:43,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:43,817 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] [2023-11-28 23:34:43,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 23:34:43,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:34:43,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash -39407288, now seen corresponding path program 1 times [2023-11-28 23:34:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056206158] [2023-11-28 23:34:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:43,857 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-28 23:34:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:43,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056206158] [2023-11-28 23:34:43,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056206158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:43,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:43,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061419354] [2023-11-28 23:34:43,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:43,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:43,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:43,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:43,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 223 [2023-11-28 23:34:43,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 192 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:43,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 223 [2023-11-28 23:34:43,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:43,973 INFO L124 PetriNetUnfolderBase]: 31/445 cut-off events. [2023-11-28 23:34:43,973 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-28 23:34:43,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 445 events. 31/445 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1855 event pairs, 12 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 462. Up to 36 conditions per place. [2023-11-28 23:34:43,977 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 11 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2023-11-28 23:34:43,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 420 flow [2023-11-28 23:34:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 605 transitions. [2023-11-28 23:34:43,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9043348281016442 [2023-11-28 23:34:43,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 605 transitions. [2023-11-28 23:34:43,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 605 transitions. [2023-11-28 23:34:43,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:43,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 605 transitions. [2023-11-28 23:34:43,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:43,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:43,985 INFO L175 Difference]: Start difference. First operand has 192 places, 192 transitions, 396 flow. Second operand 3 states and 605 transitions. [2023-11-28 23:34:43,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 420 flow [2023-11-28 23:34:43,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 191 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:34:43,990 INFO L231 Difference]: Finished difference. Result has 192 places, 191 transitions, 397 flow [2023-11-28 23:34:43,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=192, PETRI_TRANSITIONS=191} [2023-11-28 23:34:43,991 INFO L281 CegarLoopForPetriNet]: 213 programPoint places, -21 predicate places. [2023-11-28 23:34:43,991 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 191 transitions, 397 flow [2023-11-28 23:34:43,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:43,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:43,992 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] [2023-11-28 23:34:43,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:34:43,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:34:43,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:43,993 INFO L85 PathProgramCache]: Analyzing trace with hash 963078458, now seen corresponding path program 1 times [2023-11-28 23:34:43,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:43,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036584811] [2023-11-28 23:34:43,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:44,040 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-28 23:34:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:44,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036584811] [2023-11-28 23:34:44,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036584811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:44,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:44,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369589721] [2023-11-28 23:34:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:44,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:44,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:44,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:44,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:44,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 223 [2023-11-28 23:34:44,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 191 transitions, 397 flow. Second operand has 3 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-28 23:34:44,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:44,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 223 [2023-11-28 23:34:44,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:44,351 INFO L124 PetriNetUnfolderBase]: 195/1598 cut-off events. [2023-11-28 23:34:44,351 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-28 23:34:44,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 1598 events. 195/1598 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12537 event pairs, 57 based on Foata normal form. 0/1387 useless extension candidates. Maximal degree in co-relation 1888. Up to 204 conditions per place. [2023-11-28 23:34:44,359 INFO L140 encePairwiseOnDemand]: 203/223 looper letters, 32 selfloop transitions, 14 changer transitions 0/210 dead transitions. [2023-11-28 23:34:44,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 210 transitions, 532 flow [2023-11-28 23:34:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2023-11-28 23:34:44,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9073243647234679 [2023-11-28 23:34:44,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 607 transitions. [2023-11-28 23:34:44,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 607 transitions. [2023-11-28 23:34:44,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:44,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 607 transitions. [2023-11-28 23:34:44,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:44,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 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-28 23:34:44,366 INFO L175 Difference]: Start difference. First operand has 192 places, 191 transitions, 397 flow. Second operand 3 states and 607 transitions. [2023-11-28 23:34:44,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 210 transitions, 532 flow [2023-11-28 23:34:44,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 210 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:44,370 INFO L231 Difference]: Finished difference. Result has 194 places, 205 transitions, 517 flow [2023-11-28 23:34:44,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=194, PETRI_TRANSITIONS=205} [2023-11-28 23:34:44,371 INFO L281 CegarLoopForPetriNet]: 213 programPoint places, -19 predicate places. [2023-11-28 23:34:44,371 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 205 transitions, 517 flow [2023-11-28 23:34:44,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-28 23:34:44,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:44,372 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:34:44,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:34:44,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:34:44,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1382079632, now seen corresponding path program 1 times [2023-11-28 23:34:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328343852] [2023-11-28 23:34:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-28 23:34:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328343852] [2023-11-28 23:34:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328343852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:34:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249209856] [2023-11-28 23:34:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:44,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:34:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:44,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:34:44,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:34:44,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 223 [2023-11-28 23:34:44,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 205 transitions, 517 flow. Second operand has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:44,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 223 [2023-11-28 23:34:44,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:44,732 INFO L124 PetriNetUnfolderBase]: 130/1495 cut-off events. [2023-11-28 23:34:44,732 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-28 23:34:44,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1495 events. 130/1495 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11569 event pairs, 41 based on Foata normal form. 1/1300 useless extension candidates. Maximal degree in co-relation 1727. Up to 120 conditions per place. [2023-11-28 23:34:44,745 INFO L140 encePairwiseOnDemand]: 219/223 looper letters, 17 selfloop transitions, 0 changer transitions 4/208 dead transitions. [2023-11-28 23:34:44,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 208 transitions, 565 flow [2023-11-28 23:34:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:34:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:34:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 982 transitions. [2023-11-28 23:34:44,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8807174887892377 [2023-11-28 23:34:44,749 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 982 transitions. [2023-11-28 23:34:44,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 982 transitions. [2023-11-28 23:34:44,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:44,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 982 transitions. [2023-11-28 23:34:44,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.4) internal successors, (982), 5 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-28 23:34:44,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,757 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,757 INFO L175 Difference]: Start difference. First operand has 194 places, 205 transitions, 517 flow. Second operand 5 states and 982 transitions. [2023-11-28 23:34:44,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 208 transitions, 565 flow [2023-11-28 23:34:44,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 208 transitions, 537 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:44,765 INFO L231 Difference]: Finished difference. Result has 199 places, 204 transitions, 493 flow [2023-11-28 23:34:44,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=493, PETRI_PLACES=199, PETRI_TRANSITIONS=204} [2023-11-28 23:34:44,766 INFO L281 CegarLoopForPetriNet]: 213 programPoint places, -14 predicate places. [2023-11-28 23:34:44,766 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 204 transitions, 493 flow [2023-11-28 23:34:44,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:44,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:44,767 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:34:44,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 23:34:44,767 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:34:44,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1366276976, now seen corresponding path program 1 times [2023-11-28 23:34:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175291873] [2023-11-28 23:34:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:34:44,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:34:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:34:44,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:34:44,818 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:34:44,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-11-28 23:34:44,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2023-11-28 23:34:44,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2023-11-28 23:34:44,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2023-11-28 23:34:44,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2023-11-28 23:34:44,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2023-11-28 23:34:44,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2023-11-28 23:34:44,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2023-11-28 23:34:44,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2023-11-28 23:34:44,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2023-11-28 23:34:44,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2023-11-28 23:34:44,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2023-11-28 23:34:44,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2023-11-28 23:34:44,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2023-11-28 23:34:44,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2023-11-28 23:34:44,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2023-11-28 23:34:44,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2023-11-28 23:34:44,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2023-11-28 23:34:44,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2023-11-28 23:34:44,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2023-11-28 23:34:44,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2023-11-28 23:34:44,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2023-11-28 23:34:44,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2023-11-28 23:34:44,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2023-11-28 23:34:44,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2023-11-28 23:34:44,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2023-11-28 23:34:44,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2023-11-28 23:34:44,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2023-11-28 23:34:44,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2023-11-28 23:34:44,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2023-11-28 23:34:44,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2023-11-28 23:34:44,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 23:34:44,822 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:44,823 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-28 23:34:44,823 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-28 23:34:44,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:34:44,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 295 transitions, 608 flow [2023-11-28 23:34:44,930 INFO L124 PetriNetUnfolderBase]: 24/335 cut-off events. [2023-11-28 23:34:44,930 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-28 23:34:44,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 335 events. 24/335 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1031 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 253. Up to 8 conditions per place. [2023-11-28 23:34:44,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 295 transitions, 608 flow [2023-11-28 23:34:44,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 295 transitions, 608 flow [2023-11-28 23:34:44,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:34:44,940 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;@1e699725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:34:44,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-11-28 23:34:44,942 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:34:44,942 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-28 23:34:44,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:44,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:44,943 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] [2023-11-28 23:34:44,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-11-28 23:34:44,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash -955274677, now seen corresponding path program 1 times [2023-11-28 23:34:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:44,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180521663] [2023-11-28 23:34:44,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:44,966 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-28 23:34:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:44,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180521663] [2023-11-28 23:34:44,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180521663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:44,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:44,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:44,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888844342] [2023-11-28 23:34:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:44,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:45,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 295 [2023-11-28 23:34:45,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 295 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:45,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 295 [2023-11-28 23:34:45,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:45,808 INFO L124 PetriNetUnfolderBase]: 829/4693 cut-off events. [2023-11-28 23:34:45,808 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2023-11-28 23:34:45,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5951 conditions, 4693 events. 829/4693 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 48166 event pairs, 630 based on Foata normal form. 847/4741 useless extension candidates. Maximal degree in co-relation 4863. Up to 1033 conditions per place. [2023-11-28 23:34:45,869 INFO L140 encePairwiseOnDemand]: 280/295 looper letters, 24 selfloop transitions, 2 changer transitions 1/267 dead transitions. [2023-11-28 23:34:45,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 267 transitions, 604 flow [2023-11-28 23:34:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2023-11-28 23:34:45,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8983050847457628 [2023-11-28 23:34:45,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2023-11-28 23:34:45,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2023-11-28 23:34:45,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:45,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2023-11-28 23:34:45,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,879 INFO L175 Difference]: Start difference. First operand has 281 places, 295 transitions, 608 flow. Second operand 3 states and 795 transitions. [2023-11-28 23:34:45,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 267 transitions, 604 flow [2023-11-28 23:34:45,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 602 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-28 23:34:45,885 INFO L231 Difference]: Finished difference. Result has 266 places, 266 transitions, 552 flow [2023-11-28 23:34:45,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=266, PETRI_TRANSITIONS=266} [2023-11-28 23:34:45,886 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -15 predicate places. [2023-11-28 23:34:45,886 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 266 transitions, 552 flow [2023-11-28 23:34:45,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:45,887 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] [2023-11-28 23:34:45,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 23:34:45,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-11-28 23:34:45,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1017377149, now seen corresponding path program 1 times [2023-11-28 23:34:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:45,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261536265] [2023-11-28 23:34:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:45,913 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-28 23:34:45,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:45,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261536265] [2023-11-28 23:34:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261536265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:45,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:45,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917670133] [2023-11-28 23:34:45,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:45,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:45,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:45,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 295 [2023-11-28 23:34:45,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 266 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:45,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:45,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 295 [2023-11-28 23:34:45,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:46,349 INFO L124 PetriNetUnfolderBase]: 335/2601 cut-off events. [2023-11-28 23:34:46,349 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-28 23:34:46,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 2601 events. 335/2601 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 23517 event pairs, 220 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 3051. Up to 382 conditions per place. [2023-11-28 23:34:46,377 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 21 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2023-11-28 23:34:46,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 596 flow [2023-11-28 23:34:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2023-11-28 23:34:46,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8915254237288136 [2023-11-28 23:34:46,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 789 transitions. [2023-11-28 23:34:46,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 789 transitions. [2023-11-28 23:34:46,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:46,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 789 transitions. [2023-11-28 23:34:46,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,387 INFO L175 Difference]: Start difference. First operand has 266 places, 266 transitions, 552 flow. Second operand 3 states and 789 transitions. [2023-11-28 23:34:46,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 596 flow [2023-11-28 23:34:46,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:46,393 INFO L231 Difference]: Finished difference. Result has 264 places, 265 transitions, 550 flow [2023-11-28 23:34:46,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=264, PETRI_TRANSITIONS=265} [2023-11-28 23:34:46,394 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -17 predicate places. [2023-11-28 23:34:46,394 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 265 transitions, 550 flow [2023-11-28 23:34:46,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:46,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:46,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 23:34:46,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-11-28 23:34:46,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2140711249, now seen corresponding path program 1 times [2023-11-28 23:34:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272982940] [2023-11-28 23:34:46,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:46,420 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-28 23:34:46,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272982940] [2023-11-28 23:34:46,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272982940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:46,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:46,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:46,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33831302] [2023-11-28 23:34:46,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:46,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:46,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:46,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:46,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:46,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 295 [2023-11-28 23:34:46,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:46,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:46,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 295 [2023-11-28 23:34:46,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:47,419 INFO L124 PetriNetUnfolderBase]: 985/6371 cut-off events. [2023-11-28 23:34:47,420 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2023-11-28 23:34:47,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7670 conditions, 6371 events. 985/6371 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 69450 event pairs, 630 based on Foata normal form. 0/5359 useless extension candidates. Maximal degree in co-relation 7629. Up to 1120 conditions per place. [2023-11-28 23:34:47,472 INFO L140 encePairwiseOnDemand]: 285/295 looper letters, 27 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2023-11-28 23:34:47,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 256 transitions, 588 flow [2023-11-28 23:34:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2023-11-28 23:34:47,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8655367231638418 [2023-11-28 23:34:47,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 766 transitions. [2023-11-28 23:34:47,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 766 transitions. [2023-11-28 23:34:47,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:47,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 766 transitions. [2023-11-28 23:34:47,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,483 INFO L175 Difference]: Start difference. First operand has 264 places, 265 transitions, 550 flow. Second operand 3 states and 766 transitions. [2023-11-28 23:34:47,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 256 transitions, 588 flow [2023-11-28 23:34:47,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 256 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:47,488 INFO L231 Difference]: Finished difference. Result has 255 places, 256 transitions, 530 flow [2023-11-28 23:34:47,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=255, PETRI_TRANSITIONS=256} [2023-11-28 23:34:47,489 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -26 predicate places. [2023-11-28 23:34:47,490 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 256 transitions, 530 flow [2023-11-28 23:34:47,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:47,490 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] [2023-11-28 23:34:47,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 23:34:47,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-11-28 23:34:47,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:47,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1082043176, now seen corresponding path program 1 times [2023-11-28 23:34:47,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:47,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812664807] [2023-11-28 23:34:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:47,525 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-28 23:34:47,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812664807] [2023-11-28 23:34:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812664807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:47,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920468907] [2023-11-28 23:34:47,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:47,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:47,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:47,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:47,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:47,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 295 [2023-11-28 23:34:47,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 256 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:47,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 295 [2023-11-28 23:34:47,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:47,804 INFO L124 PetriNetUnfolderBase]: 190/1771 cut-off events. [2023-11-28 23:34:47,804 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-28 23:34:47,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2037 conditions, 1771 events. 190/1771 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13694 event pairs, 108 based on Foata normal form. 0/1490 useless extension candidates. Maximal degree in co-relation 1996. Up to 196 conditions per place. [2023-11-28 23:34:47,819 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 15 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2023-11-28 23:34:47,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 255 transitions, 562 flow [2023-11-28 23:34:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2023-11-28 23:34:47,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9050847457627119 [2023-11-28 23:34:47,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 801 transitions. [2023-11-28 23:34:47,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 801 transitions. [2023-11-28 23:34:47,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:47,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 801 transitions. [2023-11-28 23:34:47,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,828 INFO L175 Difference]: Start difference. First operand has 255 places, 256 transitions, 530 flow. Second operand 3 states and 801 transitions. [2023-11-28 23:34:47,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 255 transitions, 562 flow [2023-11-28 23:34:47,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 255 transitions, 561 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:34:47,834 INFO L231 Difference]: Finished difference. Result has 255 places, 255 transitions, 531 flow [2023-11-28 23:34:47,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=255, PETRI_TRANSITIONS=255} [2023-11-28 23:34:47,836 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -26 predicate places. [2023-11-28 23:34:47,836 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 255 transitions, 531 flow [2023-11-28 23:34:47,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:47,836 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] [2023-11-28 23:34:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 23:34:47,837 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-11-28 23:34:47,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2112122092, now seen corresponding path program 1 times [2023-11-28 23:34:47,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:47,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159418178] [2023-11-28 23:34:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:47,876 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-28 23:34:47,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:47,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159418178] [2023-11-28 23:34:47,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159418178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:47,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:47,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:47,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37353935] [2023-11-28 23:34:47,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:47,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:47,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:47,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:47,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 295 [2023-11-28 23:34:47,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 255 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:47,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:47,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 295 [2023-11-28 23:34:47,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:50,611 INFO L124 PetriNetUnfolderBase]: 4660/23986 cut-off events. [2023-11-28 23:34:50,611 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2023-11-28 23:34:50,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30445 conditions, 23986 events. 4660/23986 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 330586 event pairs, 1667 based on Foata normal form. 0/20563 useless extension candidates. Maximal degree in co-relation 30404. Up to 4132 conditions per place. [2023-11-28 23:34:50,834 INFO L140 encePairwiseOnDemand]: 265/295 looper letters, 48 selfloop transitions, 21 changer transitions 0/284 dead transitions. [2023-11-28 23:34:50,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 284 transitions, 737 flow [2023-11-28 23:34:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 798 transitions. [2023-11-28 23:34:50,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9016949152542373 [2023-11-28 23:34:50,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 798 transitions. [2023-11-28 23:34:50,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 798 transitions. [2023-11-28 23:34:50,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:50,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 798 transitions. [2023-11-28 23:34:50,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,845 INFO L175 Difference]: Start difference. First operand has 255 places, 255 transitions, 531 flow. Second operand 3 states and 798 transitions. [2023-11-28 23:34:50,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 284 transitions, 737 flow [2023-11-28 23:34:50,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 284 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:50,854 INFO L231 Difference]: Finished difference. Result has 257 places, 276 transitions, 713 flow [2023-11-28 23:34:50,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=257, PETRI_TRANSITIONS=276} [2023-11-28 23:34:50,855 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -24 predicate places. [2023-11-28 23:34:50,855 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 276 transitions, 713 flow [2023-11-28 23:34:50,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:50,856 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:34:50,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 23:34:50,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-11-28 23:34:50,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2108648492, now seen corresponding path program 1 times [2023-11-28 23:34:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570965857] [2023-11-28 23:34:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-28 23:34:50,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:50,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570965857] [2023-11-28 23:34:50,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570965857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:50,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:50,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:34:50,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810844044] [2023-11-28 23:34:50,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:50,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:34:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:34:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:34:50,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 295 [2023-11-28 23:34:50,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 276 transitions, 713 flow. Second operand has 5 states, 5 states have (on average 259.6) internal successors, (1298), 5 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:50,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:50,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 295 [2023-11-28 23:34:50,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:51,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([888] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of3ForFork0_#t~nondet6#1=|v_thrThread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~nondet6#1][87], [Black: 302#(= |#race~next~0| 0), 59#L1060-4true, thrThread1of3ForFork0InUse, 294#(= |#race~len~0| 0), thrThread2of3ForFork0InUse, 47#$Ultimate##0true, 300#true, 133#L1045-2true, 207#L1045-2true, thrThread3of3ForFork0InUse, 306#true]) [2023-11-28 23:34:51,947 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2023-11-28 23:34:51,947 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-28 23:34:51,947 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-28 23:34:51,947 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-28 23:34:52,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([888] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of3ForFork0_#t~nondet6#1=|v_thrThread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~nondet6#1][87], [Black: 302#(= |#race~next~0| 0), 59#L1060-4true, thrThread1of3ForFork0InUse, 294#(= |#race~len~0| 0), 70#L1040-3true, thrThread2of3ForFork0InUse, 300#true, 133#L1045-2true, 207#L1045-2true, thrThread3of3ForFork0InUse, 306#true]) [2023-11-28 23:34:52,340 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-28 23:34:52,340 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-28 23:34:52,340 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-28 23:34:52,340 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-28 23:34:52,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([959] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, thrThread3of3ForFork0_#t~nondet6#1=|v_thrThread3of3ForFork0_#t~nondet6#1_1|, ~#lock~0.base=|v_~#lock~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~nondet6#1][168], [Black: 300#true, 231#L1045-2true, 59#L1060-4true, thrThread1of3ForFork0InUse, 302#(= |#race~next~0| 0), 294#(= |#race~len~0| 0), thrThread2of3ForFork0InUse, 133#L1045-2true, thrThread3of3ForFork0InUse, 246#L1043-6true, 306#true]) [2023-11-28 23:34:52,719 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-28 23:34:52,719 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-28 23:34:52,719 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-28 23:34:52,719 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-28 23:34:52,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1030] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~nondet6#1=|v_thrThread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~nondet6#1][120], [Black: 302#(= |#race~next~0| 0), 59#L1060-4true, 231#L1045-2true, thrThread1of3ForFork0InUse, 294#(= |#race~len~0| 0), thrThread2of3ForFork0InUse, 133#L1045-2true, 300#true, thrThread3of3ForFork0InUse, 207#L1045-2true, 306#true]) [2023-11-28 23:34:52,772 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2023-11-28 23:34:52,772 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-28 23:34:52,772 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-28 23:34:52,772 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-28 23:34:52,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([888] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of3ForFork0_#t~nondet6#1=|v_thrThread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~nondet6#1][87], [Black: 302#(= |#race~next~0| 0), 231#L1045-2true, 59#L1060-4true, thrThread1of3ForFork0InUse, 294#(= |#race~len~0| 0), thrThread2of3ForFork0InUse, 207#L1045-2true, 300#true, thrThread3of3ForFork0InUse, 133#L1045-2true, 306#true]) [2023-11-28 23:34:52,777 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2023-11-28 23:34:52,777 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-28 23:34:52,777 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-28 23:34:52,777 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-28 23:34:53,168 INFO L124 PetriNetUnfolderBase]: 2518/17391 cut-off events. [2023-11-28 23:34:53,168 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2023-11-28 23:34:53,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21914 conditions, 17391 events. 2518/17391 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 237289 event pairs, 1056 based on Foata normal form. 1/15069 useless extension candidates. Maximal degree in co-relation 21872. Up to 2203 conditions per place. [2023-11-28 23:34:53,307 INFO L140 encePairwiseOnDemand]: 291/295 looper letters, 20 selfloop transitions, 0 changer transitions 4/279 dead transitions. [2023-11-28 23:34:53,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 279 transitions, 767 flow [2023-11-28 23:34:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:34:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:34:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1310 transitions. [2023-11-28 23:34:53,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.888135593220339 [2023-11-28 23:34:53,311 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1310 transitions. [2023-11-28 23:34:53,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1310 transitions. [2023-11-28 23:34:53,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:53,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1310 transitions. [2023-11-28 23:34:53,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,317 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,318 INFO L175 Difference]: Start difference. First operand has 257 places, 276 transitions, 713 flow. Second operand 5 states and 1310 transitions. [2023-11-28 23:34:53,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 279 transitions, 767 flow [2023-11-28 23:34:53,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 279 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:34:53,344 INFO L231 Difference]: Finished difference. Result has 262 places, 275 transitions, 675 flow [2023-11-28 23:34:53,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=675, PETRI_PLACES=262, PETRI_TRANSITIONS=275} [2023-11-28 23:34:53,345 INFO L281 CegarLoopForPetriNet]: 281 programPoint places, -19 predicate places. [2023-11-28 23:34:53,345 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 275 transitions, 675 flow [2023-11-28 23:34:53,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 259.6) internal successors, (1298), 5 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:53,346 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 23:34:53,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 23:34:53,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2023-11-28 23:34:53,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1844838163, now seen corresponding path program 1 times [2023-11-28 23:34:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570949751] [2023-11-28 23:34:53,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:34:53,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:34:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:34:53,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:34:53,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:34:53,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2023-11-28 23:34:53,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2023-11-28 23:34:53,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2023-11-28 23:34:53,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2023-11-28 23:34:53,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2023-11-28 23:34:53,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2023-11-28 23:34:53,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2023-11-28 23:34:53,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2023-11-28 23:34:53,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2023-11-28 23:34:53,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2023-11-28 23:34:53,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2023-11-28 23:34:53,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2023-11-28 23:34:53,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2023-11-28 23:34:53,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2023-11-28 23:34:53,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2023-11-28 23:34:53,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2023-11-28 23:34:53,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2023-11-28 23:34:53,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2023-11-28 23:34:53,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2023-11-28 23:34:53,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2023-11-28 23:34:53,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2023-11-28 23:34:53,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2023-11-28 23:34:53,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2023-11-28 23:34:53,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2023-11-28 23:34:53,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2023-11-28 23:34:53,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2023-11-28 23:34:53,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2023-11-28 23:34:53,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2023-11-28 23:34:53,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2023-11-28 23:34:53,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2023-11-28 23:34:53,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2023-11-28 23:34:53,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2023-11-28 23:34:53,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2023-11-28 23:34:53,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2023-11-28 23:34:53,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2023-11-28 23:34:53,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2023-11-28 23:34:53,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2023-11-28 23:34:53,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2023-11-28 23:34:53,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2023-11-28 23:34:53,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 23:34:53,483 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:53,483 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-28 23:34:53,484 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-28 23:34:53,533 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:34:53,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 349 places, 367 transitions, 762 flow [2023-11-28 23:34:53,609 INFO L124 PetriNetUnfolderBase]: 31/421 cut-off events. [2023-11-28 23:34:53,609 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-28 23:34:53,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 421 events. 31/421 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1522 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 343. Up to 10 conditions per place. [2023-11-28 23:34:53,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 349 places, 367 transitions, 762 flow [2023-11-28 23:34:53,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 349 places, 367 transitions, 762 flow [2023-11-28 23:34:53,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:34:53,621 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;@1e699725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:34:53,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2023-11-28 23:34:53,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:34:53,622 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-28 23:34:53,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:34:53,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:53,623 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] [2023-11-28 23:34:53,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2023-11-28 23:34:53,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash -629666022, now seen corresponding path program 1 times [2023-11-28 23:34:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822228436] [2023-11-28 23:34:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:53,643 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-28 23:34:53,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822228436] [2023-11-28 23:34:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822228436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:53,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:53,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165695267] [2023-11-28 23:34:53,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:53,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:53,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 367 [2023-11-28 23:34:53,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 367 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:53,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:53,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 367 [2023-11-28 23:34:53,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:34:58,389 INFO L124 PetriNetUnfolderBase]: 8203/34879 cut-off events. [2023-11-28 23:34:58,389 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2023-11-28 23:34:58,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46428 conditions, 34879 events. 8203/34879 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 484913 event pairs, 6804 based on Foata normal form. 7100/36380 useless extension candidates. Maximal degree in co-relation 38090. Up to 9608 conditions per place. [2023-11-28 23:34:58,833 INFO L140 encePairwiseOnDemand]: 349/367 looper letters, 31 selfloop transitions, 2 changer transitions 1/333 dead transitions. [2023-11-28 23:34:58,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 333 transitions, 760 flow [2023-11-28 23:34:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:34:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:34:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 988 transitions. [2023-11-28 23:34:58,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8973660308810173 [2023-11-28 23:34:58,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 988 transitions. [2023-11-28 23:34:58,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 988 transitions. [2023-11-28 23:34:58,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:34:58,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 988 transitions. [2023-11-28 23:34:58,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,844 INFO L175 Difference]: Start difference. First operand has 349 places, 367 transitions, 762 flow. Second operand 3 states and 988 transitions. [2023-11-28 23:34:58,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 333 transitions, 760 flow [2023-11-28 23:34:58,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 333 transitions, 754 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-28 23:34:58,851 INFO L231 Difference]: Finished difference. Result has 331 places, 332 transitions, 690 flow [2023-11-28 23:34:58,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=331, PETRI_TRANSITIONS=332} [2023-11-28 23:34:58,853 INFO L281 CegarLoopForPetriNet]: 349 programPoint places, -18 predicate places. [2023-11-28 23:34:58,853 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 332 transitions, 690 flow [2023-11-28 23:34:58,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:34:58,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:34:58,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 23:34:58,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2023-11-28 23:34:58,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1443359133, now seen corresponding path program 1 times [2023-11-28 23:34:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:34:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830772425] [2023-11-28 23:34:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:58,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:34:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:58,876 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-28 23:34:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:34:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830772425] [2023-11-28 23:34:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830772425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:34:58,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:34:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:34:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077445461] [2023-11-28 23:34:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:34:58,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:34:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:34:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:34:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:34:58,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 367 [2023-11-28 23:34:58,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 332 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:34:58,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:34:58,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 367 [2023-11-28 23:34:58,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:01,114 INFO L124 PetriNetUnfolderBase]: 2303/13473 cut-off events. [2023-11-28 23:35:01,114 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2023-11-28 23:35:01,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16457 conditions, 13473 events. 2303/13473 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 168738 event pairs, 1720 based on Foata normal form. 0/11140 useless extension candidates. Maximal degree in co-relation 16423. Up to 2507 conditions per place. [2023-11-28 23:35:01,261 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 26 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2023-11-28 23:35:01,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 331 transitions, 744 flow [2023-11-28 23:35:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2023-11-28 23:35:01,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8928247048138056 [2023-11-28 23:35:01,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2023-11-28 23:35:01,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2023-11-28 23:35:01,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:01,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2023-11-28 23:35:01,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,268 INFO L175 Difference]: Start difference. First operand has 331 places, 332 transitions, 690 flow. Second operand 3 states and 983 transitions. [2023-11-28 23:35:01,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 331 transitions, 744 flow [2023-11-28 23:35:01,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 331 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:01,273 INFO L231 Difference]: Finished difference. Result has 329 places, 331 transitions, 688 flow [2023-11-28 23:35:01,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=329, PETRI_TRANSITIONS=331} [2023-11-28 23:35:01,274 INFO L281 CegarLoopForPetriNet]: 349 programPoint places, -20 predicate places. [2023-11-28 23:35:01,274 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 331 transitions, 688 flow [2023-11-28 23:35:01,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:01,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:35:01,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 23:35:01,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2023-11-28 23:35:01,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash -659557071, now seen corresponding path program 1 times [2023-11-28 23:35:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:35:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360962370] [2023-11-28 23:35:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:35:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:01,293 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-28 23:35:01,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:35:01,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360962370] [2023-11-28 23:35:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360962370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:01,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:01,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:35:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886632617] [2023-11-28 23:35:01,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:01,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:35:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:01,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 367 [2023-11-28 23:35:01,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 331 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:01,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:01,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 367 [2023-11-28 23:35:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:08,126 INFO L124 PetriNetUnfolderBase]: 9683/48118 cut-off events. [2023-11-28 23:35:08,126 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2023-11-28 23:35:08,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59883 conditions, 48118 events. 9683/48118 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 715492 event pairs, 6804 based on Foata normal form. 0/40526 useless extension candidates. Maximal degree in co-relation 59841. Up to 10556 conditions per place. [2023-11-28 23:35:08,711 INFO L140 encePairwiseOnDemand]: 355/367 looper letters, 34 selfloop transitions, 1 changer transitions 0/320 dead transitions. [2023-11-28 23:35:08,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 320 transitions, 736 flow [2023-11-28 23:35:08,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2023-11-28 23:35:08,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8646684831970936 [2023-11-28 23:35:08,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 952 transitions. [2023-11-28 23:35:08,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 952 transitions. [2023-11-28 23:35:08,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:08,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 952 transitions. [2023-11-28 23:35:08,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,721 INFO L175 Difference]: Start difference. First operand has 329 places, 331 transitions, 688 flow. Second operand 3 states and 952 transitions. [2023-11-28 23:35:08,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 320 transitions, 736 flow [2023-11-28 23:35:08,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 320 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:35:08,728 INFO L231 Difference]: Finished difference. Result has 318 places, 320 transitions, 664 flow [2023-11-28 23:35:08,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=318, PETRI_TRANSITIONS=320} [2023-11-28 23:35:08,729 INFO L281 CegarLoopForPetriNet]: 349 programPoint places, -31 predicate places. [2023-11-28 23:35:08,729 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 320 transitions, 664 flow [2023-11-28 23:35:08,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:08,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:08,730 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] [2023-11-28 23:35:08,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 23:35:08,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2023-11-28 23:35:08,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1487177224, now seen corresponding path program 1 times [2023-11-28 23:35:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:35:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079778944] [2023-11-28 23:35:08,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:08,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:35:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:08,760 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-28 23:35:08,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:35:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079778944] [2023-11-28 23:35:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079778944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:35:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95059433] [2023-11-28 23:35:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:08,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:35:08,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:08,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:08,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 367 [2023-11-28 23:35:08,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 320 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 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-28 23:35:08,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:08,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 367 [2023-11-28 23:35:08,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:09,804 INFO L124 PetriNetUnfolderBase]: 1021/7289 cut-off events. [2023-11-28 23:35:09,804 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2023-11-28 23:35:09,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8580 conditions, 7289 events. 1021/7289 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 79939 event pairs, 684 based on Foata normal form. 0/6128 useless extension candidates. Maximal degree in co-relation 8538. Up to 1028 conditions per place. [2023-11-28 23:35:09,888 INFO L140 encePairwiseOnDemand]: 364/367 looper letters, 19 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2023-11-28 23:35:09,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 704 flow [2023-11-28 23:35:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:35:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:35:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 997 transitions. [2023-11-28 23:35:09,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9055404178019982 [2023-11-28 23:35:09,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 997 transitions. [2023-11-28 23:35:09,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 997 transitions. [2023-11-28 23:35:09,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:35:09,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 997 transitions. [2023-11-28 23:35:09,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:09,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:09,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:09,897 INFO L175 Difference]: Start difference. First operand has 318 places, 320 transitions, 664 flow. Second operand 3 states and 997 transitions. [2023-11-28 23:35:09,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 704 flow [2023-11-28 23:35:09,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:35:09,904 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 665 flow [2023-11-28 23:35:09,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=665, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2023-11-28 23:35:09,905 INFO L281 CegarLoopForPetriNet]: 349 programPoint places, -31 predicate places. [2023-11-28 23:35:09,905 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 665 flow [2023-11-28 23:35:09,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 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-28 23:35:09,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:35:09,905 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] [2023-11-28 23:35:09,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-28 23:35:09,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2023-11-28 23:35:09,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash 477705829, now seen corresponding path program 1 times [2023-11-28 23:35:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:35:09,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308609080] [2023-11-28 23:35:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:35:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:09,942 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-28 23:35:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:35:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308609080] [2023-11-28 23:35:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308609080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:35:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:35:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:35:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585909383] [2023-11-28 23:35:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:35:09,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:35:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:35:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:35:09,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:35:10,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 367 [2023-11-28 23:35:10,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 665 flow. Second operand has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:35:10,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:35:10,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 367 [2023-11-28 23:35:10,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:35:57,191 INFO L124 PetriNetUnfolderBase]: 94175/357262 cut-off events. [2023-11-28 23:35:57,191 INFO L125 PetriNetUnfolderBase]: For 6739/6739 co-relation queries the response was YES. [2023-11-28 23:35:59,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478738 conditions, 357262 events. 94175/357262 cut-off events. For 6739/6739 co-relation queries the response was YES. Maximal size of possible extension queue 10119. Compared 6556204 event pairs, 36288 based on Foata normal form. 0/305077 useless extension candidates. Maximal degree in co-relation 478696. Up to 76888 conditions per place. [2023-11-28 23:36:01,326 INFO L140 encePairwiseOnDemand]: 327/367 looper letters, 64 selfloop transitions, 28 changer transitions 0/358 dead transitions. [2023-11-28 23:36:01,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 358 transitions, 942 flow [2023-11-28 23:36:01,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:36:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:36:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2023-11-28 23:36:01,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8982742960944596 [2023-11-28 23:36:01,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 989 transitions. [2023-11-28 23:36:01,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 989 transitions. [2023-11-28 23:36:01,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:36:01,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 989 transitions. [2023-11-28 23:36:01,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:36:01,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:36:01,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 367.0) internal successors, (1468), 4 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:36:01,334 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 665 flow. Second operand 3 states and 989 transitions. [2023-11-28 23:36:01,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 358 transitions, 942 flow [2023-11-28 23:36:01,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 358 transitions, 938 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:36:01,342 INFO L231 Difference]: Finished difference. Result has 320 places, 347 transitions, 909 flow [2023-11-28 23:36:01,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=909, PETRI_PLACES=320, PETRI_TRANSITIONS=347} [2023-11-28 23:36:01,343 INFO L281 CegarLoopForPetriNet]: 349 programPoint places, -29 predicate places. [2023-11-28 23:36:01,343 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 347 transitions, 909 flow [2023-11-28 23:36:01,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:36:01,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:36:01,343 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] [2023-11-28 23:36:01,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-28 23:36:01,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2023-11-28 23:36:01,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:36:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash 642345166, now seen corresponding path program 1 times [2023-11-28 23:36:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:36:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513256969] [2023-11-28 23:36:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:36:01,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:36:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:36:01,446 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-28 23:36:01,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:36:01,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513256969] [2023-11-28 23:36:01,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513256969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:36:01,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:36:01,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:36:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573106119] [2023-11-28 23:36:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:36:01,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:36:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:36:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:36:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:36:01,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 367 [2023-11-28 23:36:01,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 347 transitions, 909 flow. Second operand has 5 states, 5 states have (on average 319.4) internal successors, (1597), 5 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:36:01,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:36:01,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 367 [2023-11-28 23:36:01,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:36:15,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1397] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread3of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of4ForFork0_#t~nondet6#1=|v_thrThread3of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of4ForFork0_#t~nondet6#1][297], [33#L1043-4true, 370#(= |#race~next~0| 0), 262#L1045-2true, 362#(= |#race~len~0| 0), 14#$Ultimate##0true, 234#L1045-2true, Black: 368#true, 74#L1060-4true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:15,637 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-28 23:36:15,637 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-28 23:36:15,637 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-28 23:36:15,637 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-28 23:36:16,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1397] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread3of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of4ForFork0_#t~nondet6#1=|v_thrThread3of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of4ForFork0_#t~nondet6#1][297], [326#$Ultimate##0true, 370#(= |#race~next~0| 0), 33#L1043-4true, 262#L1045-2true, 362#(= |#race~len~0| 0), 229#L1045-2true, Black: 368#true, 74#L1060-4true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:16,224 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-28 23:36:16,224 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-28 23:36:16,224 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-28 23:36:16,224 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-28 23:36:24,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1397] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread3of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of4ForFork0_#t~nondet6#1=|v_thrThread3of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of4ForFork0_#t~nondet6#1][297], [33#L1043-4true, 370#(= |#race~next~0| 0), 262#L1045-2true, 362#(= |#race~len~0| 0), 234#L1045-2true, 341#L1040-3true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:24,487 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-28 23:36:24,488 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-28 23:36:24,488 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-28 23:36:24,488 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-28 23:36:27,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 229#L1045-2true, 362#(= |#race~len~0| 0), 187#L1045-2true, 36#L1042true, 158#L1042true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:27,836 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is not cut-off event [2023-11-28 23:36:27,836 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2023-11-28 23:36:27,836 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2023-11-28 23:36:27,836 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2023-11-28 23:36:29,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 229#L1045-2true, 362#(= |#race~len~0| 0), 187#L1045-2true, 234#L1045-2true, 36#L1042true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:29,596 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2023-11-28 23:36:29,596 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2023-11-28 23:36:29,596 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2023-11-28 23:36:29,596 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2023-11-28 23:36:29,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 262#L1045-2true, 362#(= |#race~len~0| 0), 229#L1045-2true, 187#L1045-2true, 158#L1042true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:29,604 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2023-11-28 23:36:29,604 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2023-11-28 23:36:29,604 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2023-11-28 23:36:29,604 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2023-11-28 23:36:30,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [33#L1043-4true, 370#(= |#race~next~0| 0), 229#L1045-2true, 362#(= |#race~len~0| 0), 234#L1045-2true, 239#L1041-2true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:30,772 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-28 23:36:30,772 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 23:36:30,772 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-28 23:36:30,772 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 23:36:31,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 262#L1045-2true, 362#(= |#race~len~0| 0), 229#L1045-2true, 187#L1045-2true, 234#L1045-2true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:31,380 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event [2023-11-28 23:36:31,380 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2023-11-28 23:36:31,380 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2023-11-28 23:36:31,380 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2023-11-28 23:36:35,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1397] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread3of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread3of4ForFork0_#t~nondet6#1=|v_thrThread3of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of4ForFork0_#t~nondet6#1][297], [370#(= |#race~next~0| 0), 33#L1043-4true, 262#L1045-2true, 16#L1042true, 362#(= |#race~len~0| 0), 234#L1045-2true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:35,616 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-28 23:36:35,616 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-28 23:36:35,616 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-28 23:36:35,616 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-28 23:36:35,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [323#L1042true, 370#(= |#race~next~0| 0), 262#L1045-2true, 362#(= |#race~len~0| 0), 229#L1045-2true, 227#L1043-4true, Black: 368#true, 74#L1060-4true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:35,782 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-28 23:36:35,782 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-28 23:36:35,782 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-28 23:36:35,782 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-28 23:36:37,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 262#L1045-2true, 229#L1045-2true, 362#(= |#race~len~0| 0), 187#L1045-2true, 227#L1043-4true, Black: 368#true, 74#L1060-4true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:37,132 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 23:36:37,132 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-28 23:36:37,132 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 23:36:37,132 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 23:36:37,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 362#(= |#race~len~0| 0), 229#L1045-2true, 36#L1042true, 158#L1042true, 74#L1060-4true, Black: 368#true, 236#L1043-6true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:37,399 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 23:36:37,399 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-28 23:36:37,399 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-28 23:36:37,399 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-28 23:36:39,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 362#(= |#race~len~0| 0), 229#L1045-2true, 243#L1043-6true, 187#L1045-2true, 36#L1042true, Black: 368#true, 74#L1060-4true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:39,133 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-28 23:36:39,133 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,133 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,133 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 229#L1045-2true, 362#(= |#race~len~0| 0), 187#L1045-2true, 158#L1042true, 265#L1043-6true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:39,134 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-28 23:36:39,134 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,135 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-28 23:36:39,135 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 229#L1045-2true, 362#(= |#race~len~0| 0), 234#L1045-2true, 36#L1042true, 74#L1060-4true, Black: 368#true, 236#L1043-6true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:39,471 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-28 23:36:39,471 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,472 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,472 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 262#L1045-2true, 229#L1045-2true, 362#(= |#race~len~0| 0), 158#L1042true, 74#L1060-4true, Black: 368#true, 236#L1043-6true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:39,513 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-28 23:36:39,513 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,513 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:39,513 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:41,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 262#L1045-2true, 229#L1045-2true, 362#(= |#race~len~0| 0), 243#L1043-6true, 187#L1045-2true, Black: 368#true, 74#L1060-4true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:41,061 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-28 23:36:41,061 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 23:36:41,061 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 23:36:41,061 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 23:36:41,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 262#L1045-2true, 229#L1045-2true, 362#(= |#race~len~0| 0), 234#L1045-2true, 74#L1060-4true, Black: 368#true, 236#L1043-6true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:41,299 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-28 23:36:41,299 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 23:36:41,299 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 23:36:41,299 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 23:36:42,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 262#L1045-2true, 362#(= |#race~len~0| 0), 229#L1045-2true, 151#L1042-1true, 227#L1043-4true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:42,633 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 23:36:42,633 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 23:36:42,633 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-28 23:36:42,633 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 23:36:44,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [338#L1042-2true, 370#(= |#race~next~0| 0), 262#L1045-2true, 229#L1045-2true, 362#(= |#race~len~0| 0), 227#L1043-4true, 74#L1060-4true, Black: 368#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:44,928 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-28 23:36:44,928 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 23:36:44,928 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-28 23:36:44,928 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-28 23:36:49,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [370#(= |#race~next~0| 0), 262#L1045-2true, 362#(= |#race~len~0| 0), 229#L1045-2true, 227#L1043-4true, 74#L1060-4true, Black: 368#true, 291#L1043-1true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:49,384 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-28 23:36:49,384 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-28 23:36:49,384 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-28 23:36:49,384 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-28 23:36:50,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1468] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread4of4ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread4of4ForFork0_#t~nondet6#1=|v_thrThread4of4ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread4of4ForFork0_#t~nondet6#1][341], [33#L1043-4true, 370#(= |#race~next~0| 0), 362#(= |#race~len~0| 0), 229#L1045-2true, 234#L1045-2true, Black: 368#true, 74#L1060-4true, 156#L1043-4true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 374#true, thrThread4of4ForFork0InUse]) [2023-11-28 23:36:50,087 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-28 23:36:50,087 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-28 23:36:50,088 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 23:36:50,088 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event