./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/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_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/sssc12_variant.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/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_31a41dca-3527-4300-8814-4583b8894779/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 726fce4da80b267da781dea82372ef1c43891e7d5d6ac2b3894c611bc25a242b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:21:34,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:21:34,593 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 02:21:34,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:21:34,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:21:34,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:21:34,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:21:34,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:21:34,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:21:34,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:21:34,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:21:34,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:21:34,623 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:21:34,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:21:34,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:21:34,624 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:21:34,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:21:34,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:21:34,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:21:34,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:21:34,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:21:34,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:21:34,627 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 02:21:34,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:21:34,628 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:21:34,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:21:34,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:21:34,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:21:34,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:21:34,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:21:34,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:21:34,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:21:34,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:21:34,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:21:34,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:21:34,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:21:34,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:21:34,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:21:34,632 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:21:34,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:21:34,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:21:34,633 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_31a41dca-3527-4300-8814-4583b8894779/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_31a41dca-3527-4300-8814-4583b8894779/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 -> 726fce4da80b267da781dea82372ef1c43891e7d5d6ac2b3894c611bc25a242b [2023-11-29 02:21:34,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:21:34,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:21:34,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:21:34,896 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:21:34,897 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:21:34,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-lit/sssc12_variant.i [2023-11-29 02:21:37,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:21:37,889 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:21:37,890 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2023-11-29 02:21:37,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/data/932828ef7/f48a16ba444b4c6bbe3dd7a3cdce1636/FLAG511f099ec [2023-11-29 02:21:37,922 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/data/932828ef7/f48a16ba444b4c6bbe3dd7a3cdce1636 [2023-11-29 02:21:37,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:21:37,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:21:37,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:21:37,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:21:37,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:21:37,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:21:37" (1/1) ... [2023-11-29 02:21:37,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2fb1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:37, skipping insertion in model container [2023-11-29 02:21:37,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:21:37" (1/1) ... [2023-11-29 02:21:37,987 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:21:38,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:21:38,409 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:21:38,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:21:38,500 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:21:38,501 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:21:38,506 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:21:38,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38 WrapperNode [2023-11-29 02:21:38,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:21:38,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:21:38,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:21:38,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:21:38,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,559 INFO L138 Inliner]: procedures = 275, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2023-11-29 02:21:38,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:21:38,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:21:38,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:21:38,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:21:38,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:21:38,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:21:38,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:21:38,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:21:38,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (1/1) ... [2023-11-29 02:21:38,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:21:38,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:21:38,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:21:38,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31a41dca-3527-4300-8814-4583b8894779/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:21:38,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:21:38,663 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2023-11-29 02:21:38,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2023-11-29 02:21:38,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:21:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:21:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:21:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 02:21:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 02:21:38,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:21:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:21:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 02:21:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:21:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:21:38,667 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 02:21:38,825 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:21:38,828 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:21:39,121 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:21:39,174 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:21:39,175 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 02:21:39,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:21:39 BoogieIcfgContainer [2023-11-29 02:21:39,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:21:39,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:21:39,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:21:39,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:21:39,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:21:37" (1/3) ... [2023-11-29 02:21:39,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693e3de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:21:39, skipping insertion in model container [2023-11-29 02:21:39,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:21:38" (2/3) ... [2023-11-29 02:21:39,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693e3de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:21:39, skipping insertion in model container [2023-11-29 02:21:39,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:21:39" (3/3) ... [2023-11-29 02:21:39,183 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2023-11-29 02:21:39,189 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 02:21:39,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:21:39,197 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2023-11-29 02:21:39,198 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:21:39,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:21:39,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 175 transitions, 354 flow [2023-11-29 02:21:39,385 INFO L124 PetriNetUnfolderBase]: 9/188 cut-off events. [2023-11-29 02:21:39,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:21:39,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 188 events. 9/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 179 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2023-11-29 02:21:39,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 175 transitions, 354 flow [2023-11-29 02:21:39,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 175 transitions, 354 flow [2023-11-29 02:21:39,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:21:39,416 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;@5cd76958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:21:39,416 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-11-29 02:21:39,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:21:39,422 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-29 02:21:39,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:21:39,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:39,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:39,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2023-11-29 02:21:39,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1893095273, now seen corresponding path program 1 times [2023-11-29 02:21:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:39,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912254015] [2023-11-29 02:21:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:39,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912254015] [2023-11-29 02:21:39,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912254015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:39,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:39,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145134833] [2023-11-29 02:21:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:39,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:39,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:39,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:39,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:39,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 175 [2023-11-29 02:21:39,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 175 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:39,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 175 [2023-11-29 02:21:39,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:39,756 INFO L124 PetriNetUnfolderBase]: 3/158 cut-off events. [2023-11-29 02:21:39,756 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:21:39,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 158 events. 3/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 8/144 useless extension candidates. Maximal degree in co-relation 90. Up to 7 conditions per place. [2023-11-29 02:21:39,758 INFO L140 encePairwiseOnDemand]: 162/175 looper letters, 6 selfloop transitions, 2 changer transitions 1/154 dead transitions. [2023-11-29 02:21:39,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 154 transitions, 328 flow [2023-11-29 02:21:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-11-29 02:21:39,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9161904761904762 [2023-11-29 02:21:39,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-11-29 02:21:39,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-11-29 02:21:39,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:39,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-11-29 02:21:39,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,794 INFO L175 Difference]: Start difference. First operand has 170 places, 175 transitions, 354 flow. Second operand 3 states and 481 transitions. [2023-11-29 02:21:39,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 154 transitions, 328 flow [2023-11-29 02:21:39,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 154 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:21:39,802 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 314 flow [2023-11-29 02:21:39,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2023-11-29 02:21:39,808 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -14 predicate places. [2023-11-29 02:21:39,808 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 314 flow [2023-11-29 02:21:39,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:39,809 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] [2023-11-29 02:21:39,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:21:39,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2023-11-29 02:21:39,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash -457357874, now seen corresponding path program 1 times [2023-11-29 02:21:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:39,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163815170] [2023-11-29 02:21:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:39,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:39,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:39,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163815170] [2023-11-29 02:21:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163815170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:39,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:39,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726406846] [2023-11-29 02:21:39,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:39,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:39,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:39,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:39,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:39,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 175 [2023-11-29 02:21:39,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:39,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 175 [2023-11-29 02:21:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:39,942 INFO L124 PetriNetUnfolderBase]: 3/156 cut-off events. [2023-11-29 02:21:39,942 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:21:39,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 156 events. 3/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 149. Up to 11 conditions per place. [2023-11-29 02:21:39,944 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 10 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2023-11-29 02:21:39,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 152 transitions, 336 flow [2023-11-29 02:21:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-11-29 02:21:39,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8819047619047619 [2023-11-29 02:21:39,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-11-29 02:21:39,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-11-29 02:21:39,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:39,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-11-29 02:21:39,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,953 INFO L175 Difference]: Start difference. First operand has 156 places, 153 transitions, 314 flow. Second operand 3 states and 463 transitions. [2023-11-29 02:21:39,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 152 transitions, 336 flow [2023-11-29 02:21:39,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 152 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:39,970 INFO L231 Difference]: Finished difference. Result has 154 places, 152 transitions, 312 flow [2023-11-29 02:21:39,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=154, PETRI_TRANSITIONS=152} [2023-11-29 02:21:39,971 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -16 predicate places. [2023-11-29 02:21:39,971 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 152 transitions, 312 flow [2023-11-29 02:21:39,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:39,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:39,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:39,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:21:39,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2023-11-29 02:21:39,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:39,974 INFO L85 PathProgramCache]: Analyzing trace with hash -608003830, now seen corresponding path program 1 times [2023-11-29 02:21:39,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:39,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321360365] [2023-11-29 02:21:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:39,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:40,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321360365] [2023-11-29 02:21:40,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321360365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:40,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:40,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819506136] [2023-11-29 02:21:40,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:40,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:40,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 175 [2023-11-29 02:21:40,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 152 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:40,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 175 [2023-11-29 02:21:40,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:40,094 INFO L124 PetriNetUnfolderBase]: 3/155 cut-off events. [2023-11-29 02:21:40,094 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:21:40,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 155 events. 3/155 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 11 conditions per place. [2023-11-29 02:21:40,096 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 10 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2023-11-29 02:21:40,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 334 flow [2023-11-29 02:21:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-11-29 02:21:40,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8819047619047619 [2023-11-29 02:21:40,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-11-29 02:21:40,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-11-29 02:21:40,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:40,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-11-29 02:21:40,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,103 INFO L175 Difference]: Start difference. First operand has 154 places, 152 transitions, 312 flow. Second operand 3 states and 463 transitions. [2023-11-29 02:21:40,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 334 flow [2023-11-29 02:21:40,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 151 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:40,108 INFO L231 Difference]: Finished difference. Result has 153 places, 151 transitions, 310 flow [2023-11-29 02:21:40,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=153, PETRI_TRANSITIONS=151} [2023-11-29 02:21:40,109 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -17 predicate places. [2023-11-29 02:21:40,109 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 151 transitions, 310 flow [2023-11-29 02:21:40,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:40,110 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] [2023-11-29 02:21:40,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:21:40,111 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2023-11-29 02:21:40,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1745274053, now seen corresponding path program 1 times [2023-11-29 02:21:40,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:40,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472603566] [2023-11-29 02:21:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472603566] [2023-11-29 02:21:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472603566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:40,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:40,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955913942] [2023-11-29 02:21:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:40,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:40,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 175 [2023-11-29 02:21:40,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 151 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:40,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 175 [2023-11-29 02:21:40,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:40,212 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2023-11-29 02:21:40,212 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 02:21:40,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 151 events. 3/151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 131. Up to 11 conditions per place. [2023-11-29 02:21:40,213 INFO L140 encePairwiseOnDemand]: 170/175 looper letters, 11 selfloop transitions, 1 changer transitions 0/147 dead transitions. [2023-11-29 02:21:40,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 147 transitions, 326 flow [2023-11-29 02:21:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-11-29 02:21:40,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2023-11-29 02:21:40,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-11-29 02:21:40,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-11-29 02:21:40,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:40,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-11-29 02:21:40,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,221 INFO L175 Difference]: Start difference. First operand has 153 places, 151 transitions, 310 flow. Second operand 3 states and 460 transitions. [2023-11-29 02:21:40,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 147 transitions, 326 flow [2023-11-29 02:21:40,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:40,224 INFO L231 Difference]: Finished difference. Result has 149 places, 147 transitions, 300 flow [2023-11-29 02:21:40,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=149, PETRI_TRANSITIONS=147} [2023-11-29 02:21:40,225 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -21 predicate places. [2023-11-29 02:21:40,225 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 147 transitions, 300 flow [2023-11-29 02:21:40,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:40,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:40,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:21:40,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2023-11-29 02:21:40,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:40,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1467890943, now seen corresponding path program 1 times [2023-11-29 02:21:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743099135] [2023-11-29 02:21:40,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743099135] [2023-11-29 02:21:40,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743099135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:40,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:40,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421323041] [2023-11-29 02:21:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:40,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:40,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 175 [2023-11-29 02:21:40,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 147 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:40,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 175 [2023-11-29 02:21:40,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:40,341 INFO L124 PetriNetUnfolderBase]: 3/150 cut-off events. [2023-11-29 02:21:40,341 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:21:40,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 150 events. 3/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 128. Up to 10 conditions per place. [2023-11-29 02:21:40,343 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 9 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2023-11-29 02:21:40,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 320 flow [2023-11-29 02:21:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-11-29 02:21:40,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2023-11-29 02:21:40,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-11-29 02:21:40,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-11-29 02:21:40,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:40,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-11-29 02:21:40,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,351 INFO L175 Difference]: Start difference. First operand has 149 places, 147 transitions, 300 flow. Second operand 3 states and 465 transitions. [2023-11-29 02:21:40,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 320 flow [2023-11-29 02:21:40,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:21:40,354 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 301 flow [2023-11-29 02:21:40,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2023-11-29 02:21:40,356 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -21 predicate places. [2023-11-29 02:21:40,356 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 301 flow [2023-11-29 02:21:40,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:40,357 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] [2023-11-29 02:21:40,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:21:40,358 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2023-11-29 02:21:40,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1868260891, now seen corresponding path program 1 times [2023-11-29 02:21:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:40,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980402308] [2023-11-29 02:21:40,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:40,478 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-29 02:21:40,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:40,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980402308] [2023-11-29 02:21:40,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980402308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:40,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:21:40,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180213236] [2023-11-29 02:21:40,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:40,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:21:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:40,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:21:40,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:21:40,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2023-11-29 02:21:40,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:40,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2023-11-29 02:21:40,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:40,565 INFO L124 PetriNetUnfolderBase]: 2/153 cut-off events. [2023-11-29 02:21:40,565 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:21:40,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 153 events. 2/153 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 140. Up to 15 conditions per place. [2023-11-29 02:21:40,566 INFO L140 encePairwiseOnDemand]: 171/175 looper letters, 14 selfloop transitions, 0 changer transitions 4/149 dead transitions. [2023-11-29 02:21:40,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 149 transitions, 343 flow [2023-11-29 02:21:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:21:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:21:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 754 transitions. [2023-11-29 02:21:40,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8617142857142858 [2023-11-29 02:21:40,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 754 transitions. [2023-11-29 02:21:40,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 754 transitions. [2023-11-29 02:21:40,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:40,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 754 transitions. [2023-11-29 02:21:40,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,574 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,575 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 301 flow. Second operand 5 states and 754 transitions. [2023-11-29 02:21:40,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 149 transitions, 343 flow [2023-11-29 02:21:40,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 149 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:40,578 INFO L231 Difference]: Finished difference. Result has 154 places, 145 transitions, 301 flow [2023-11-29 02:21:40,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=154, PETRI_TRANSITIONS=145} [2023-11-29 02:21:40,579 INFO L281 CegarLoopForPetriNet]: 170 programPoint places, -16 predicate places. [2023-11-29 02:21:40,579 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 145 transitions, 301 flow [2023-11-29 02:21:40,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:40,580 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:40,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:21:40,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2023-11-29 02:21:40,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:40,581 INFO L85 PathProgramCache]: Analyzing trace with hash -678968952, now seen corresponding path program 1 times [2023-11-29 02:21:40,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:40,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089742852] [2023-11-29 02:21:40,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:21:40,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:21:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:21:40,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:21:40,645 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:21:40,646 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2023-11-29 02:21:40,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2023-11-29 02:21:40,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2023-11-29 02:21:40,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2023-11-29 02:21:40,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2023-11-29 02:21:40,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2023-11-29 02:21:40,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2023-11-29 02:21:40,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2023-11-29 02:21:40,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2023-11-29 02:21:40,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2023-11-29 02:21:40,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2023-11-29 02:21:40,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2023-11-29 02:21:40,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2023-11-29 02:21:40,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2023-11-29 02:21:40,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2023-11-29 02:21:40,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2023-11-29 02:21:40,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2023-11-29 02:21:40,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2023-11-29 02:21:40,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2023-11-29 02:21:40,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2023-11-29 02:21:40,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2023-11-29 02:21:40,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2023-11-29 02:21:40,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2023-11-29 02:21:40,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2023-11-29 02:21:40,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2023-11-29 02:21:40,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2023-11-29 02:21:40,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2023-11-29 02:21:40,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2023-11-29 02:21:40,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2023-11-29 02:21:40,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2023-11-29 02:21:40,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2023-11-29 02:21:40,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2023-11-29 02:21:40,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2023-11-29 02:21:40,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2023-11-29 02:21:40,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2023-11-29 02:21:40,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2023-11-29 02:21:40,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2023-11-29 02:21:40,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2023-11-29 02:21:40,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:21:40,664 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:40,667 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:21:40,667 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 02:21:40,716 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:21:40,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 268 transitions, 546 flow [2023-11-29 02:21:40,760 INFO L124 PetriNetUnfolderBase]: 15/296 cut-off events. [2023-11-29 02:21:40,760 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 02:21:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 296 events. 15/296 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 611 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 199. Up to 6 conditions per place. [2023-11-29 02:21:40,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 260 places, 268 transitions, 546 flow [2023-11-29 02:21:40,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 268 transitions, 546 flow [2023-11-29 02:21:40,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:21:40,771 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;@5cd76958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:21:40,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-29 02:21:40,773 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:21:40,773 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-29 02:21:40,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:21:40,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:40,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:40,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-29 02:21:40,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 817912565, now seen corresponding path program 1 times [2023-11-29 02:21:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:40,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988134966] [2023-11-29 02:21:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988134966] [2023-11-29 02:21:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988134966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:40,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:40,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030333134] [2023-11-29 02:21:40,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:40,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:40,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 268 [2023-11-29 02:21:40,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 268 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:40,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 268 [2023-11-29 02:21:40,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:40,880 INFO L124 PetriNetUnfolderBase]: 17/481 cut-off events. [2023-11-29 02:21:40,880 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 02:21:40,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 481 events. 17/481 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1851 event pairs, 6 based on Foata normal form. 31/433 useless extension candidates. Maximal degree in co-relation 338. Up to 22 conditions per place. [2023-11-29 02:21:40,885 INFO L140 encePairwiseOnDemand]: 248/268 looper letters, 9 selfloop transitions, 2 changer transitions 1/237 dead transitions. [2023-11-29 02:21:40,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 237 transitions, 506 flow [2023-11-29 02:21:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2023-11-29 02:21:40,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2023-11-29 02:21:40,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 737 transitions. [2023-11-29 02:21:40,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 737 transitions. [2023-11-29 02:21:40,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:40,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 737 transitions. [2023-11-29 02:21:40,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,893 INFO L175 Difference]: Start difference. First operand has 260 places, 268 transitions, 546 flow. Second operand 3 states and 737 transitions. [2023-11-29 02:21:40,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 237 transitions, 506 flow [2023-11-29 02:21:40,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 237 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:21:40,897 INFO L231 Difference]: Finished difference. Result has 239 places, 236 transitions, 486 flow [2023-11-29 02:21:40,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=239, PETRI_TRANSITIONS=236} [2023-11-29 02:21:40,898 INFO L281 CegarLoopForPetriNet]: 260 programPoint places, -21 predicate places. [2023-11-29 02:21:40,898 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 236 transitions, 486 flow [2023-11-29 02:21:40,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:40,899 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] [2023-11-29 02:21:40,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:21:40,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-29 02:21:40,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:40,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1547561010, now seen corresponding path program 1 times [2023-11-29 02:21:40,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:40,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78796234] [2023-11-29 02:21:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78796234] [2023-11-29 02:21:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78796234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:40,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:40,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:40,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522513814] [2023-11-29 02:21:40,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:40,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:40,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:40,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:40,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:40,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 268 [2023-11-29 02:21:40,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 236 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:40,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:40,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 268 [2023-11-29 02:21:40,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:41,109 INFO L124 PetriNetUnfolderBase]: 61/819 cut-off events. [2023-11-29 02:21:41,109 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-29 02:21:41,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 819 events. 61/819 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4605 event pairs, 42 based on Foata normal form. 0/687 useless extension candidates. Maximal degree in co-relation 924. Up to 102 conditions per place. [2023-11-29 02:21:41,117 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 17 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2023-11-29 02:21:41,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 235 transitions, 522 flow [2023-11-29 02:21:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-11-29 02:21:41,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756218905472637 [2023-11-29 02:21:41,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-11-29 02:21:41,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-11-29 02:21:41,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:41,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-11-29 02:21:41,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,126 INFO L175 Difference]: Start difference. First operand has 239 places, 236 transitions, 486 flow. Second operand 3 states and 704 transitions. [2023-11-29 02:21:41,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 235 transitions, 522 flow [2023-11-29 02:21:41,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 235 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:41,132 INFO L231 Difference]: Finished difference. Result has 237 places, 235 transitions, 484 flow [2023-11-29 02:21:41,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=237, PETRI_TRANSITIONS=235} [2023-11-29 02:21:41,133 INFO L281 CegarLoopForPetriNet]: 260 programPoint places, -23 predicate places. [2023-11-29 02:21:41,133 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 235 transitions, 484 flow [2023-11-29 02:21:41,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:41,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:41,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:21:41,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-29 02:21:41,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:41,135 INFO L85 PathProgramCache]: Analyzing trace with hash -526068842, now seen corresponding path program 1 times [2023-11-29 02:21:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:41,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226347145] [2023-11-29 02:21:41,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:41,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226347145] [2023-11-29 02:21:41,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226347145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:41,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:41,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:41,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784763844] [2023-11-29 02:21:41,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:41,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:41,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:41,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:41,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 268 [2023-11-29 02:21:41,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 235 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:41,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 268 [2023-11-29 02:21:41,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:41,296 INFO L124 PetriNetUnfolderBase]: 25/560 cut-off events. [2023-11-29 02:21:41,296 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-29 02:21:41,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 560 events. 25/560 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2449 event pairs, 12 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 588. Up to 39 conditions per place. [2023-11-29 02:21:41,302 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 14 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2023-11-29 02:21:41,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 234 transitions, 514 flow [2023-11-29 02:21:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2023-11-29 02:21:41,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8830845771144279 [2023-11-29 02:21:41,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 710 transitions. [2023-11-29 02:21:41,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 710 transitions. [2023-11-29 02:21:41,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:41,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 710 transitions. [2023-11-29 02:21:41,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,310 INFO L175 Difference]: Start difference. First operand has 237 places, 235 transitions, 484 flow. Second operand 3 states and 710 transitions. [2023-11-29 02:21:41,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 234 transitions, 514 flow [2023-11-29 02:21:41,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 234 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:41,316 INFO L231 Difference]: Finished difference. Result has 236 places, 234 transitions, 482 flow [2023-11-29 02:21:41,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=236, PETRI_TRANSITIONS=234} [2023-11-29 02:21:41,317 INFO L281 CegarLoopForPetriNet]: 260 programPoint places, -24 predicate places. [2023-11-29 02:21:41,318 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 234 transitions, 482 flow [2023-11-29 02:21:41,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:41,318 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] [2023-11-29 02:21:41,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:21:41,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-29 02:21:41,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1788792121, now seen corresponding path program 1 times [2023-11-29 02:21:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:41,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115594164] [2023-11-29 02:21:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:41,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115594164] [2023-11-29 02:21:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115594164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:41,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:41,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408472213] [2023-11-29 02:21:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:41,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:41,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:41,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:41,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 268 [2023-11-29 02:21:41,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 234 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:41,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 268 [2023-11-29 02:21:41,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:41,490 INFO L124 PetriNetUnfolderBase]: 39/760 cut-off events. [2023-11-29 02:21:41,490 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 02:21:41,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 760 events. 39/760 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4155 event pairs, 20 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 800. Up to 56 conditions per place. [2023-11-29 02:21:41,497 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 16 selfloop transitions, 1 changer transitions 0/229 dead transitions. [2023-11-29 02:21:41,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 229 transitions, 506 flow [2023-11-29 02:21:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2023-11-29 02:21:41,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8743781094527363 [2023-11-29 02:21:41,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 703 transitions. [2023-11-29 02:21:41,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 703 transitions. [2023-11-29 02:21:41,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:41,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 703 transitions. [2023-11-29 02:21:41,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,507 INFO L175 Difference]: Start difference. First operand has 236 places, 234 transitions, 482 flow. Second operand 3 states and 703 transitions. [2023-11-29 02:21:41,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 229 transitions, 506 flow [2023-11-29 02:21:41,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 229 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:41,512 INFO L231 Difference]: Finished difference. Result has 231 places, 229 transitions, 470 flow [2023-11-29 02:21:41,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2023-11-29 02:21:41,514 INFO L281 CegarLoopForPetriNet]: 260 programPoint places, -29 predicate places. [2023-11-29 02:21:41,532 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 470 flow [2023-11-29 02:21:41,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:41,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:41,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:21:41,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-29 02:21:41,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash 822062733, now seen corresponding path program 1 times [2023-11-29 02:21:41,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:41,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162380518] [2023-11-29 02:21:41,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:41,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162380518] [2023-11-29 02:21:41,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162380518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:41,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:41,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125904490] [2023-11-29 02:21:41,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:41,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:41,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:41,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 268 [2023-11-29 02:21:41,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:41,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 268 [2023-11-29 02:21:41,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:41,762 INFO L124 PetriNetUnfolderBase]: 47/718 cut-off events. [2023-11-29 02:21:41,762 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 02:21:41,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 718 events. 47/718 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3554 event pairs, 30 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 780. Up to 76 conditions per place. [2023-11-29 02:21:41,769 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 15 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2023-11-29 02:21:41,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 228 transitions, 502 flow [2023-11-29 02:21:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2023-11-29 02:21:41,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8805970149253731 [2023-11-29 02:21:41,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 708 transitions. [2023-11-29 02:21:41,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 708 transitions. [2023-11-29 02:21:41,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:41,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 708 transitions. [2023-11-29 02:21:41,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,778 INFO L175 Difference]: Start difference. First operand has 231 places, 229 transitions, 470 flow. Second operand 3 states and 708 transitions. [2023-11-29 02:21:41,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 228 transitions, 502 flow [2023-11-29 02:21:41,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 228 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:21:41,784 INFO L231 Difference]: Finished difference. Result has 231 places, 228 transitions, 471 flow [2023-11-29 02:21:41,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=231, PETRI_TRANSITIONS=228} [2023-11-29 02:21:41,785 INFO L281 CegarLoopForPetriNet]: 260 programPoint places, -29 predicate places. [2023-11-29 02:21:41,785 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 228 transitions, 471 flow [2023-11-29 02:21:41,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:41,786 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] [2023-11-29 02:21:41,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:21:41,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-29 02:21:41,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash 804366495, now seen corresponding path program 1 times [2023-11-29 02:21:41,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:41,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151780243] [2023-11-29 02:21:41,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:41,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:41,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151780243] [2023-11-29 02:21:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151780243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279656282] [2023-11-29 02:21:41,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:41,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:41,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:41,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 268 [2023-11-29 02:21:41,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 228 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:41,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:41,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 268 [2023-11-29 02:21:41,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:42,220 INFO L124 PetriNetUnfolderBase]: 164/2130 cut-off events. [2023-11-29 02:21:42,220 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-29 02:21:42,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 2130 events. 164/2130 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 17571 event pairs, 57 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2419. Up to 204 conditions per place. [2023-11-29 02:21:42,238 INFO L140 encePairwiseOnDemand]: 248/268 looper letters, 32 selfloop transitions, 14 changer transitions 0/247 dead transitions. [2023-11-29 02:21:42,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 606 flow [2023-11-29 02:21:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2023-11-29 02:21:42,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8930348258706468 [2023-11-29 02:21:42,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 718 transitions. [2023-11-29 02:21:42,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 718 transitions. [2023-11-29 02:21:42,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:42,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 718 transitions. [2023-11-29 02:21:42,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,247 INFO L175 Difference]: Start difference. First operand has 231 places, 228 transitions, 471 flow. Second operand 3 states and 718 transitions. [2023-11-29 02:21:42,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 606 flow [2023-11-29 02:21:42,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 247 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:42,253 INFO L231 Difference]: Finished difference. Result has 233 places, 242 transitions, 591 flow [2023-11-29 02:21:42,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=233, PETRI_TRANSITIONS=242} [2023-11-29 02:21:42,254 INFO L281 CegarLoopForPetriNet]: 260 programPoint places, -27 predicate places. [2023-11-29 02:21:42,255 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 242 transitions, 591 flow [2023-11-29 02:21:42,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:42,255 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] [2023-11-29 02:21:42,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:21:42,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-29 02:21:42,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1524110184, now seen corresponding path program 1 times [2023-11-29 02:21:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924044024] [2023-11-29 02:21:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:42,341 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-29 02:21:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924044024] [2023-11-29 02:21:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924044024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:21:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466299143] [2023-11-29 02:21:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:42,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:21:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:42,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:21:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:21:42,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 268 [2023-11-29 02:21:42,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 242 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 231.4) internal successors, (1157), 5 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:42,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 268 [2023-11-29 02:21:42,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:42,711 INFO L124 PetriNetUnfolderBase]: 99/2023 cut-off events. [2023-11-29 02:21:42,711 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-29 02:21:42,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 2023 events. 99/2023 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 16517 event pairs, 41 based on Foata normal form. 1/1734 useless extension candidates. Maximal degree in co-relation 2254. Up to 120 conditions per place. [2023-11-29 02:21:42,729 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 17 selfloop transitions, 0 changer transitions 4/245 dead transitions. [2023-11-29 02:21:42,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 245 transitions, 639 flow [2023-11-29 02:21:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:21:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:21:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1167 transitions. [2023-11-29 02:21:42,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8708955223880597 [2023-11-29 02:21:42,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1167 transitions. [2023-11-29 02:21:42,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1167 transitions. [2023-11-29 02:21:42,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:42,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1167 transitions. [2023-11-29 02:21:42,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.4) internal successors, (1167), 5 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,742 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,742 INFO L175 Difference]: Start difference. First operand has 233 places, 242 transitions, 591 flow. Second operand 5 states and 1167 transitions. [2023-11-29 02:21:42,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 245 transitions, 639 flow [2023-11-29 02:21:42,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 245 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:42,750 INFO L231 Difference]: Finished difference. Result has 238 places, 241 transitions, 567 flow [2023-11-29 02:21:42,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=238, PETRI_TRANSITIONS=241} [2023-11-29 02:21:42,751 INFO L281 CegarLoopForPetriNet]: 260 programPoint places, -22 predicate places. [2023-11-29 02:21:42,752 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 241 transitions, 567 flow [2023-11-29 02:21:42,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 231.4) internal successors, (1157), 5 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:42,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:42,753 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, 1] [2023-11-29 02:21:42,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:21:42,753 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-11-29 02:21:42,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:42,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1650372631, now seen corresponding path program 1 times [2023-11-29 02:21:42,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544960618] [2023-11-29 02:21:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:21:42,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:21:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:21:42,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:21:42,802 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:21:42,802 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2023-11-29 02:21:42,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2023-11-29 02:21:42,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2023-11-29 02:21:42,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2023-11-29 02:21:42,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2023-11-29 02:21:42,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2023-11-29 02:21:42,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2023-11-29 02:21:42,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2023-11-29 02:21:42,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2023-11-29 02:21:42,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2023-11-29 02:21:42,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2023-11-29 02:21:42,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2023-11-29 02:21:42,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2023-11-29 02:21:42,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2023-11-29 02:21:42,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2023-11-29 02:21:42,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2023-11-29 02:21:42,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2023-11-29 02:21:42,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2023-11-29 02:21:42,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2023-11-29 02:21:42,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2023-11-29 02:21:42,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2023-11-29 02:21:42,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2023-11-29 02:21:42,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2023-11-29 02:21:42,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2023-11-29 02:21:42,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2023-11-29 02:21:42,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2023-11-29 02:21:42,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2023-11-29 02:21:42,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2023-11-29 02:21:42,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2023-11-29 02:21:42,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2023-11-29 02:21:42,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2023-11-29 02:21:42,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2023-11-29 02:21:42,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2023-11-29 02:21:42,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2023-11-29 02:21:42,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2023-11-29 02:21:42,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2023-11-29 02:21:42,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2023-11-29 02:21:42,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2023-11-29 02:21:42,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2023-11-29 02:21:42,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2023-11-29 02:21:42,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2023-11-29 02:21:42,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2023-11-29 02:21:42,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2023-11-29 02:21:42,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2023-11-29 02:21:42,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2023-11-29 02:21:42,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2023-11-29 02:21:42,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2023-11-29 02:21:42,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2023-11-29 02:21:42,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2023-11-29 02:21:42,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2023-11-29 02:21:42,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2023-11-29 02:21:42,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2023-11-29 02:21:42,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2023-11-29 02:21:42,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:21:42,809 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:42,810 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:21:42,810 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 02:21:42,870 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:21:42,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 361 transitions, 740 flow [2023-11-29 02:21:42,962 INFO L124 PetriNetUnfolderBase]: 21/404 cut-off events. [2023-11-29 02:21:42,962 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 02:21:42,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 404 events. 21/404 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1174 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 300. Up to 8 conditions per place. [2023-11-29 02:21:42,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 361 transitions, 740 flow [2023-11-29 02:21:42,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 361 transitions, 740 flow [2023-11-29 02:21:42,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:21:42,975 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;@5cd76958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:21:42,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2023-11-29 02:21:42,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:21:42,977 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-29 02:21:42,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:21:42,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:42,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:42,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:42,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1095128514, now seen corresponding path program 1 times [2023-11-29 02:21:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256129885] [2023-11-29 02:21:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:42,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:42,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256129885] [2023-11-29 02:21:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256129885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:42,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:42,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844779000] [2023-11-29 02:21:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:42,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:43,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:43,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:43,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 361 [2023-11-29 02:21:43,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 361 transitions, 740 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-29 02:21:43,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:43,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 361 [2023-11-29 02:21:43,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:43,255 INFO L124 PetriNetUnfolderBase]: 79/1518 cut-off events. [2023-11-29 02:21:43,255 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-29 02:21:43,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 1518 events. 79/1518 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10981 event pairs, 42 based on Foata normal form. 111/1363 useless extension candidates. Maximal degree in co-relation 1094. Up to 85 conditions per place. [2023-11-29 02:21:43,273 INFO L140 encePairwiseOnDemand]: 334/361 looper letters, 12 selfloop transitions, 2 changer transitions 1/320 dead transitions. [2023-11-29 02:21:43,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 320 transitions, 686 flow [2023-11-29 02:21:43,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2023-11-29 02:21:43,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9168975069252078 [2023-11-29 02:21:43,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 993 transitions. [2023-11-29 02:21:43,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 993 transitions. [2023-11-29 02:21:43,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:43,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 993 transitions. [2023-11-29 02:21:43,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:43,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:43,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:43,282 INFO L175 Difference]: Start difference. First operand has 350 places, 361 transitions, 740 flow. Second operand 3 states and 993 transitions. [2023-11-29 02:21:43,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 320 transitions, 686 flow [2023-11-29 02:21:43,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 320 transitions, 684 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 02:21:43,288 INFO L231 Difference]: Finished difference. Result has 322 places, 319 transitions, 658 flow [2023-11-29 02:21:43,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=322, PETRI_TRANSITIONS=319} [2023-11-29 02:21:43,289 INFO L281 CegarLoopForPetriNet]: 350 programPoint places, -28 predicate places. [2023-11-29 02:21:43,290 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 319 transitions, 658 flow [2023-11-29 02:21:43,290 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-29 02:21:43,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:43,290 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] [2023-11-29 02:21:43,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:21:43,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:43,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1230808398, now seen corresponding path program 1 times [2023-11-29 02:21:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:43,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985017168] [2023-11-29 02:21:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985017168] [2023-11-29 02:21:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985017168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:43,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707001328] [2023-11-29 02:21:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:43,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:43,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:43,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 361 [2023-11-29 02:21:43,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 319 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:43,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:43,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 361 [2023-11-29 02:21:43,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:44,215 INFO L124 PetriNetUnfolderBase]: 763/5752 cut-off events. [2023-11-29 02:21:44,215 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2023-11-29 02:21:44,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6964 conditions, 5752 events. 763/5752 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 60889 event pairs, 630 based on Foata normal form. 0/4822 useless extension candidates. Maximal degree in co-relation 6935. Up to 1033 conditions per place. [2023-11-29 02:21:44,258 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 24 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2023-11-29 02:21:44,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 318 transitions, 708 flow [2023-11-29 02:21:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 945 transitions. [2023-11-29 02:21:44,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8725761772853186 [2023-11-29 02:21:44,261 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 945 transitions. [2023-11-29 02:21:44,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 945 transitions. [2023-11-29 02:21:44,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:44,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 945 transitions. [2023-11-29 02:21:44,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,267 INFO L175 Difference]: Start difference. First operand has 322 places, 319 transitions, 658 flow. Second operand 3 states and 945 transitions. [2023-11-29 02:21:44,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 318 transitions, 708 flow [2023-11-29 02:21:44,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 318 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:44,272 INFO L231 Difference]: Finished difference. Result has 320 places, 318 transitions, 656 flow [2023-11-29 02:21:44,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=320, PETRI_TRANSITIONS=318} [2023-11-29 02:21:44,274 INFO L281 CegarLoopForPetriNet]: 350 programPoint places, -30 predicate places. [2023-11-29 02:21:44,274 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 318 transitions, 656 flow [2023-11-29 02:21:44,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:44,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:44,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:21:44,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:44,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1521495009, now seen corresponding path program 1 times [2023-11-29 02:21:44,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:44,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775257577] [2023-11-29 02:21:44,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:44,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:44,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775257577] [2023-11-29 02:21:44,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775257577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:44,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:44,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469211265] [2023-11-29 02:21:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:44,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:44,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 361 [2023-11-29 02:21:44,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 318 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:44,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 361 [2023-11-29 02:21:44,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:44,662 INFO L124 PetriNetUnfolderBase]: 163/2265 cut-off events. [2023-11-29 02:21:44,663 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-29 02:21:44,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 2265 events. 163/2265 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 19038 event pairs, 108 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 2501. Up to 199 conditions per place. [2023-11-29 02:21:44,680 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 18 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2023-11-29 02:21:44,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 317 transitions, 694 flow [2023-11-29 02:21:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2023-11-29 02:21:44,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8836565096952909 [2023-11-29 02:21:44,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 957 transitions. [2023-11-29 02:21:44,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 957 transitions. [2023-11-29 02:21:44,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:44,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 957 transitions. [2023-11-29 02:21:44,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,690 INFO L175 Difference]: Start difference. First operand has 320 places, 318 transitions, 656 flow. Second operand 3 states and 957 transitions. [2023-11-29 02:21:44,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 317 transitions, 694 flow [2023-11-29 02:21:44,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 317 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:44,696 INFO L231 Difference]: Finished difference. Result has 319 places, 317 transitions, 654 flow [2023-11-29 02:21:44,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=319, PETRI_TRANSITIONS=317} [2023-11-29 02:21:44,697 INFO L281 CegarLoopForPetriNet]: 350 programPoint places, -31 predicate places. [2023-11-29 02:21:44,698 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 317 transitions, 654 flow [2023-11-29 02:21:44,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:44,699 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] [2023-11-29 02:21:44,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:21:44,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:44,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 348150032, now seen corresponding path program 1 times [2023-11-29 02:21:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789395303] [2023-11-29 02:21:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789395303] [2023-11-29 02:21:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789395303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:44,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:44,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933220903] [2023-11-29 02:21:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:44,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:44,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:44,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:44,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 361 [2023-11-29 02:21:44,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 317 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:44,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:44,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 361 [2023-11-29 02:21:44,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:45,336 INFO L124 PetriNetUnfolderBase]: 325/4054 cut-off events. [2023-11-29 02:21:45,336 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 02:21:45,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4536 conditions, 4054 events. 325/4054 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 41107 event pairs, 220 based on Foata normal form. 0/3390 useless extension candidates. Maximal degree in co-relation 4494. Up to 381 conditions per place. [2023-11-29 02:21:45,372 INFO L140 encePairwiseOnDemand]: 354/361 looper letters, 21 selfloop transitions, 1 changer transitions 0/311 dead transitions. [2023-11-29 02:21:45,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 686 flow [2023-11-29 02:21:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 946 transitions. [2023-11-29 02:21:45,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8734995383194829 [2023-11-29 02:21:45,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 946 transitions. [2023-11-29 02:21:45,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 946 transitions. [2023-11-29 02:21:45,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:45,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 946 transitions. [2023-11-29 02:21:45,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:45,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:45,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:45,382 INFO L175 Difference]: Start difference. First operand has 319 places, 317 transitions, 654 flow. Second operand 3 states and 946 transitions. [2023-11-29 02:21:45,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 686 flow [2023-11-29 02:21:45,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 311 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:45,388 INFO L231 Difference]: Finished difference. Result has 313 places, 311 transitions, 640 flow [2023-11-29 02:21:45,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=313, PETRI_TRANSITIONS=311} [2023-11-29 02:21:45,389 INFO L281 CegarLoopForPetriNet]: 350 programPoint places, -37 predicate places. [2023-11-29 02:21:45,389 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 311 transitions, 640 flow [2023-11-29 02:21:45,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:45,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:45,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:45,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:21:45,390 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:45,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash -516510762, now seen corresponding path program 1 times [2023-11-29 02:21:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524668800] [2023-11-29 02:21:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:45,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524668800] [2023-11-29 02:21:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524668800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607305380] [2023-11-29 02:21:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:45,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:45,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:45,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 361 [2023-11-29 02:21:45,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 311 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:45,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:45,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 361 [2023-11-29 02:21:45,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:46,032 INFO L124 PetriNetUnfolderBase]: 493/4316 cut-off events. [2023-11-29 02:21:46,033 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-29 02:21:46,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 4316 events. 493/4316 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 41118 event pairs, 390 based on Foata normal form. 0/3625 useless extension candidates. Maximal degree in co-relation 5062. Up to 652 conditions per place. [2023-11-29 02:21:46,074 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 21 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2023-11-29 02:21:46,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 310 transitions, 684 flow [2023-11-29 02:21:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2023-11-29 02:21:46,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8781163434903048 [2023-11-29 02:21:46,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 951 transitions. [2023-11-29 02:21:46,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 951 transitions. [2023-11-29 02:21:46,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:46,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 951 transitions. [2023-11-29 02:21:46,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:46,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:46,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:46,083 INFO L175 Difference]: Start difference. First operand has 313 places, 311 transitions, 640 flow. Second operand 3 states and 951 transitions. [2023-11-29 02:21:46,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 310 transitions, 684 flow [2023-11-29 02:21:46,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 310 transitions, 683 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:21:46,088 INFO L231 Difference]: Finished difference. Result has 313 places, 310 transitions, 641 flow [2023-11-29 02:21:46,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=313, PETRI_TRANSITIONS=310} [2023-11-29 02:21:46,089 INFO L281 CegarLoopForPetriNet]: 350 programPoint places, -37 predicate places. [2023-11-29 02:21:46,089 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 641 flow [2023-11-29 02:21:46,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:46,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:46,090 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] [2023-11-29 02:21:46,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:21:46,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:46,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 953950907, now seen corresponding path program 1 times [2023-11-29 02:21:46,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:46,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982079543] [2023-11-29 02:21:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:46,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:46,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982079543] [2023-11-29 02:21:46,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982079543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:46,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:46,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:21:46,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116279523] [2023-11-29 02:21:46,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:46,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:21:46,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:46,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:21:46,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:21:46,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 361 [2023-11-29 02:21:46,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 310 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:46,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:46,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 361 [2023-11-29 02:21:46,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:49,807 INFO L124 PetriNetUnfolderBase]: 4171/30338 cut-off events. [2023-11-29 02:21:49,807 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2023-11-29 02:21:49,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36797 conditions, 30338 events. 4171/30338 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 443446 event pairs, 1667 based on Foata normal form. 0/25726 useless extension candidates. Maximal degree in co-relation 36755. Up to 4132 conditions per place. [2023-11-29 02:21:50,039 INFO L140 encePairwiseOnDemand]: 331/361 looper letters, 48 selfloop transitions, 21 changer transitions 0/339 dead transitions. [2023-11-29 02:21:50,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 339 transitions, 847 flow [2023-11-29 02:21:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:21:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:21:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2023-11-29 02:21:50,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8864265927977839 [2023-11-29 02:21:50,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 960 transitions. [2023-11-29 02:21:50,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 960 transitions. [2023-11-29 02:21:50,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:50,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 960 transitions. [2023-11-29 02:21:50,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:50,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:50,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:50,047 INFO L175 Difference]: Start difference. First operand has 313 places, 310 transitions, 641 flow. Second operand 3 states and 960 transitions. [2023-11-29 02:21:50,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 339 transitions, 847 flow [2023-11-29 02:21:50,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 339 transitions, 843 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:50,053 INFO L231 Difference]: Finished difference. Result has 315 places, 331 transitions, 823 flow [2023-11-29 02:21:50,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=315, PETRI_TRANSITIONS=331} [2023-11-29 02:21:50,054 INFO L281 CegarLoopForPetriNet]: 350 programPoint places, -35 predicate places. [2023-11-29 02:21:50,054 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 331 transitions, 823 flow [2023-11-29 02:21:50,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:50,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:50,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:50,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:21:50,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:50,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1094365633, now seen corresponding path program 1 times [2023-11-29 02:21:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579869373] [2023-11-29 02:21:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:50,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:21:50,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579869373] [2023-11-29 02:21:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579869373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:50,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:21:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884290973] [2023-11-29 02:21:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:50,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:21:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:21:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:21:50,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 361 [2023-11-29 02:21:50,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 331 transitions, 823 flow. Second operand has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:50,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:50,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 361 [2023-11-29 02:21:50,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:52,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1206] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of3ForFork0_release_#t~nondet4#1=|v_thrThread3of3ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread3of3ForFork0_assume_abort_if_not_~cond#1, thrThread3of3ForFork0_release_#t~nondet4#1, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1][164], [44#L1028-3true, 332#L1019true, Black: 373#true, 367#(= |#race~len~0| 0), thrThread1of3ForFork0InUse, 279#L1019true, 379#true, thrThread2of3ForFork0InUse, 270#L1047-4true, 375#(= |#race~next~0| 0), thrThread3of3ForFork0InUse]) [2023-11-29 02:21:52,531 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 02:21:52,531 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 02:21:52,531 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:52,531 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 02:21:52,613 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1206] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of3ForFork0_release_#t~nondet4#1=|v_thrThread3of3ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread3of3ForFork0_assume_abort_if_not_~cond#1, thrThread3of3ForFork0_release_#t~nondet4#1, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1][164], [44#L1028-3true, 332#L1019true, Black: 373#true, 367#(= |#race~len~0| 0), thrThread1of3ForFork0InUse, 279#L1019true, 379#true, thrThread2of3ForFork0InUse, 270#L1047-4true, 375#(= |#race~next~0| 0), thrThread3of3ForFork0InUse]) [2023-11-29 02:21:52,613 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 02:21:52,613 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 02:21:52,613 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:52,613 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:52,613 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 02:21:52,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of3ForFork0_release_#t~nondet4#1=|v_thrThread2of3ForFork0_release_#t~nondet4#1_5|, thrThread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of3ForFork0_release_#t~nondet4#1, thrThread2of3ForFork0_assume_abort_if_not_~cond#1, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1][126], [44#L1028-3true, 332#L1019true, 373#true, Black: 375#(= |#race~next~0| 0), 367#(= |#race~len~0| 0), thrThread1of3ForFork0InUse, 379#true, 279#L1019true, thrThread2of3ForFork0InUse, 270#L1047-4true, thrThread3of3ForFork0InUse]) [2023-11-29 02:21:52,799 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 02:21:52,799 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:52,800 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:52,800 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:53,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1206] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of3ForFork0_release_#t~nondet4#1=|v_thrThread3of3ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread3of3ForFork0_assume_abort_if_not_~cond#1, thrThread3of3ForFork0_release_#t~nondet4#1, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1][164], [44#L1028-3true, 332#L1019true, 373#true, Black: 375#(= |#race~next~0| 0), 367#(= |#race~len~0| 0), thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 279#L1019true, 379#true, 270#L1047-4true, thrThread3of3ForFork0InUse]) [2023-11-29 02:21:53,731 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-29 02:21:53,731 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:53,731 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:53,731 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:21:55,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of3ForFork0_release_#t~nondet4#1=|v_thrThread2of3ForFork0_release_#t~nondet4#1_5|, thrThread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of3ForFork0_release_#t~nondet4#1, thrThread2of3ForFork0_assume_abort_if_not_~cond#1, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1][126], [268#L1032true, 332#L1019true, 373#true, Black: 375#(= |#race~next~0| 0), 367#(= |#race~len~0| 0), thrThread1of3ForFork0InUse, 379#true, 279#L1019true, thrThread2of3ForFork0InUse, 270#L1047-4true, thrThread3of3ForFork0InUse]) [2023-11-29 02:21:55,705 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2023-11-29 02:21:55,705 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:21:55,705 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 02:21:55,705 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:21:55,882 INFO L124 PetriNetUnfolderBase]: 3553/39103 cut-off events. [2023-11-29 02:21:55,882 INFO L125 PetriNetUnfolderBase]: For 980/983 co-relation queries the response was YES. [2023-11-29 02:21:56,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46625 conditions, 39103 events. 3553/39103 cut-off events. For 980/983 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 611323 event pairs, 1741 based on Foata normal form. 59/33513 useless extension candidates. Maximal degree in co-relation 46583. Up to 3237 conditions per place. [2023-11-29 02:21:56,218 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 27 selfloop transitions, 3 changer transitions 0/344 dead transitions. [2023-11-29 02:21:56,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 344 transitions, 929 flow [2023-11-29 02:21:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:21:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:21:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1299 transitions. [2023-11-29 02:21:56,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.899584487534626 [2023-11-29 02:21:56,223 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1299 transitions. [2023-11-29 02:21:56,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1299 transitions. [2023-11-29 02:21:56,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:56,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1299 transitions. [2023-11-29 02:21:56,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 324.75) internal successors, (1299), 4 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:56,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:56,341 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:56,341 INFO L175 Difference]: Start difference. First operand has 315 places, 331 transitions, 823 flow. Second operand 4 states and 1299 transitions. [2023-11-29 02:21:56,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 344 transitions, 929 flow [2023-11-29 02:21:56,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 344 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:21:56,399 INFO L231 Difference]: Finished difference. Result has 317 places, 331 transitions, 791 flow [2023-11-29 02:21:56,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=791, PETRI_PLACES=317, PETRI_TRANSITIONS=331} [2023-11-29 02:21:56,400 INFO L281 CegarLoopForPetriNet]: 350 programPoint places, -33 predicate places. [2023-11-29 02:21:56,401 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 331 transitions, 791 flow [2023-11-29 02:21:56,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:56,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:56,401 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] [2023-11-29 02:21:56,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:21:56,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:56,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2086250991, now seen corresponding path program 1 times [2023-11-29 02:21:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:56,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31064371] [2023-11-29 02:21:56,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:56,464 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-29 02:21:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:21:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31064371] [2023-11-29 02:21:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31064371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:21:56,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:21:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:21:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246901885] [2023-11-29 02:21:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:21:56,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:21:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:21:56,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:21:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:21:56,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 361 [2023-11-29 02:21:56,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 331 transitions, 791 flow. Second operand has 5 states, 5 states have (on average 313.6) internal successors, (1568), 5 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:56,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:21:56,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 361 [2023-11-29 02:21:56,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:21:58,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1206] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of3ForFork0_release_#t~nondet4#1=|v_thrThread3of3ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread3of3ForFork0_assume_abort_if_not_~cond#1, thrThread3of3ForFork0_release_#t~nondet4#1, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1][155], [Black: 382#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 194#L1028-6true, 332#L1019true, 385#true, Black: 373#true, 367#(= |#race~len~0| 0), thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 379#true, 279#L1019true, 270#L1047-4true, thrThread3of3ForFork0InUse]) [2023-11-29 02:21:58,116 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-11-29 02:21:58,116 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:21:58,116 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:21:58,116 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 02:21:58,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of3ForFork0_release_#t~nondet4#1=|v_thrThread2of3ForFork0_release_#t~nondet4#1_5|, thrThread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of3ForFork0_release_#t~nondet4#1, thrThread2of3ForFork0_assume_abort_if_not_~cond#1, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [382#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 332#L1019true, 385#true, Black: 375#(= |#race~next~0| 0), 367#(= |#race~len~0| 0), thrThread1of3ForFork0InUse, 280#L1019true, thrThread2of3ForFork0InUse, 279#L1019true, 270#L1047-4true, thrThread3of3ForFork0InUse]) [2023-11-29 02:21:58,191 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-29 02:21:58,191 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:21:58,191 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:21:58,191 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:21:59,546 INFO L124 PetriNetUnfolderBase]: 2233/24524 cut-off events. [2023-11-29 02:21:59,546 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-29 02:21:59,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28569 conditions, 24524 events. 2233/24524 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 360400 event pairs, 1151 based on Foata normal form. 1/20858 useless extension candidates. Maximal degree in co-relation 28525. Up to 2300 conditions per place. [2023-11-29 02:21:59,737 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 20 selfloop transitions, 0 changer transitions 4/334 dead transitions. [2023-11-29 02:21:59,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 334 transitions, 845 flow [2023-11-29 02:21:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:21:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:21:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1580 transitions. [2023-11-29 02:21:59,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8753462603878116 [2023-11-29 02:21:59,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1580 transitions. [2023-11-29 02:21:59,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1580 transitions. [2023-11-29 02:21:59,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:21:59,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1580 transitions. [2023-11-29 02:21:59,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 316.0) internal successors, (1580), 5 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:59,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:59,750 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:59,750 INFO L175 Difference]: Start difference. First operand has 317 places, 331 transitions, 791 flow. Second operand 5 states and 1580 transitions. [2023-11-29 02:21:59,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 334 transitions, 845 flow [2023-11-29 02:21:59,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 334 transitions, 839 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 02:21:59,759 INFO L231 Difference]: Finished difference. Result has 321 places, 330 transitions, 789 flow [2023-11-29 02:21:59,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=789, PETRI_PLACES=321, PETRI_TRANSITIONS=330} [2023-11-29 02:21:59,760 INFO L281 CegarLoopForPetriNet]: 350 programPoint places, -29 predicate places. [2023-11-29 02:21:59,760 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 330 transitions, 789 flow [2023-11-29 02:21:59,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.6) internal successors, (1568), 5 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:21:59,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:21:59,761 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, 1] [2023-11-29 02:21:59,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:21:59,761 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 02:21:59,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:59,762 INFO L85 PathProgramCache]: Analyzing trace with hash 63594023, now seen corresponding path program 1 times [2023-11-29 02:21:59,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:21:59,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841924457] [2023-11-29 02:21:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:21:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:21:59,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:21:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:21:59,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:21:59,807 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:21:59,807 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 68 remaining) [2023-11-29 02:21:59,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (66 of 68 remaining) [2023-11-29 02:21:59,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (65 of 68 remaining) [2023-11-29 02:21:59,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (64 of 68 remaining) [2023-11-29 02:21:59,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 68 remaining) [2023-11-29 02:21:59,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (62 of 68 remaining) [2023-11-29 02:21:59,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (61 of 68 remaining) [2023-11-29 02:21:59,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (60 of 68 remaining) [2023-11-29 02:21:59,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (59 of 68 remaining) [2023-11-29 02:21:59,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (58 of 68 remaining) [2023-11-29 02:21:59,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (57 of 68 remaining) [2023-11-29 02:21:59,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (56 of 68 remaining) [2023-11-29 02:21:59,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (55 of 68 remaining) [2023-11-29 02:21:59,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (54 of 68 remaining) [2023-11-29 02:21:59,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (53 of 68 remaining) [2023-11-29 02:21:59,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (52 of 68 remaining) [2023-11-29 02:21:59,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (51 of 68 remaining) [2023-11-29 02:21:59,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (50 of 68 remaining) [2023-11-29 02:21:59,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (49 of 68 remaining) [2023-11-29 02:21:59,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (48 of 68 remaining) [2023-11-29 02:21:59,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (47 of 68 remaining) [2023-11-29 02:21:59,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (46 of 68 remaining) [2023-11-29 02:21:59,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (45 of 68 remaining) [2023-11-29 02:21:59,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (44 of 68 remaining) [2023-11-29 02:21:59,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (43 of 68 remaining) [2023-11-29 02:21:59,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (42 of 68 remaining) [2023-11-29 02:21:59,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (41 of 68 remaining) [2023-11-29 02:21:59,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (40 of 68 remaining) [2023-11-29 02:21:59,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (39 of 68 remaining) [2023-11-29 02:21:59,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (38 of 68 remaining) [2023-11-29 02:21:59,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (37 of 68 remaining) [2023-11-29 02:21:59,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (36 of 68 remaining) [2023-11-29 02:21:59,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (35 of 68 remaining) [2023-11-29 02:21:59,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (34 of 68 remaining) [2023-11-29 02:21:59,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (33 of 68 remaining) [2023-11-29 02:21:59,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (32 of 68 remaining) [2023-11-29 02:21:59,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (31 of 68 remaining) [2023-11-29 02:21:59,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (30 of 68 remaining) [2023-11-29 02:21:59,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (29 of 68 remaining) [2023-11-29 02:21:59,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (28 of 68 remaining) [2023-11-29 02:21:59,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (27 of 68 remaining) [2023-11-29 02:21:59,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (26 of 68 remaining) [2023-11-29 02:21:59,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (25 of 68 remaining) [2023-11-29 02:21:59,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (24 of 68 remaining) [2023-11-29 02:21:59,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (23 of 68 remaining) [2023-11-29 02:21:59,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (22 of 68 remaining) [2023-11-29 02:21:59,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (21 of 68 remaining) [2023-11-29 02:21:59,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (20 of 68 remaining) [2023-11-29 02:21:59,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (19 of 68 remaining) [2023-11-29 02:21:59,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (18 of 68 remaining) [2023-11-29 02:21:59,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (17 of 68 remaining) [2023-11-29 02:21:59,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (16 of 68 remaining) [2023-11-29 02:21:59,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (15 of 68 remaining) [2023-11-29 02:21:59,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (14 of 68 remaining) [2023-11-29 02:21:59,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (13 of 68 remaining) [2023-11-29 02:21:59,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (12 of 68 remaining) [2023-11-29 02:21:59,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (11 of 68 remaining) [2023-11-29 02:21:59,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (10 of 68 remaining) [2023-11-29 02:21:59,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (9 of 68 remaining) [2023-11-29 02:21:59,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 68 remaining) [2023-11-29 02:21:59,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (7 of 68 remaining) [2023-11-29 02:21:59,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (6 of 68 remaining) [2023-11-29 02:21:59,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 68 remaining) [2023-11-29 02:21:59,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (4 of 68 remaining) [2023-11-29 02:21:59,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (3 of 68 remaining) [2023-11-29 02:21:59,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr12ASSERT_VIOLATIONDATA_RACE (2 of 68 remaining) [2023-11-29 02:21:59,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr13ASSERT_VIOLATIONDATA_RACE (1 of 68 remaining) [2023-11-29 02:21:59,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr14ASSERT_VIOLATIONDATA_RACE (0 of 68 remaining) [2023-11-29 02:21:59,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:21:59,816 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:59,817 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:21:59,817 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-29 02:21:59,889 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:21:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 454 transitions, 936 flow [2023-11-29 02:22:00,004 INFO L124 PetriNetUnfolderBase]: 27/512 cut-off events. [2023-11-29 02:22:00,005 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 02:22:00,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 512 events. 27/512 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1815 event pairs, 0 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 412. Up to 10 conditions per place. [2023-11-29 02:22:00,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 440 places, 454 transitions, 936 flow [2023-11-29 02:22:00,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 440 places, 454 transitions, 936 flow [2023-11-29 02:22:00,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:22:00,015 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;@5cd76958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:22:00,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-11-29 02:22:00,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:22:00,017 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-29 02:22:00,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:22:00,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:22:00,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:22:00,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-29 02:22:00,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash 448939332, now seen corresponding path program 1 times [2023-11-29 02:22:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:00,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208325430] [2023-11-29 02:22:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:00,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208325430] [2023-11-29 02:22:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208325430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:22:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:22:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:22:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369885452] [2023-11-29 02:22:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:22:00,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:22:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:22:00,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:22:00,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 454 [2023-11-29 02:22:00,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 454 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:00,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:22:00,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 454 [2023-11-29 02:22:00,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:22:01,210 INFO L124 PetriNetUnfolderBase]: 321/4733 cut-off events. [2023-11-29 02:22:01,210 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-11-29 02:22:01,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5250 conditions, 4733 events. 321/4733 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 48586 event pairs, 204 based on Foata normal form. 388/4280 useless extension candidates. Maximal degree in co-relation 3422. Up to 328 conditions per place. [2023-11-29 02:22:01,282 INFO L140 encePairwiseOnDemand]: 420/454 looper letters, 15 selfloop transitions, 2 changer transitions 1/403 dead transitions. [2023-11-29 02:22:01,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 403 transitions, 868 flow [2023-11-29 02:22:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:22:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:22:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2023-11-29 02:22:01,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9170337738619677 [2023-11-29 02:22:01,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1249 transitions. [2023-11-29 02:22:01,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1249 transitions. [2023-11-29 02:22:01,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:22:01,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1249 transitions. [2023-11-29 02:22:01,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:01,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:01,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:01,293 INFO L175 Difference]: Start difference. First operand has 440 places, 454 transitions, 936 flow. Second operand 3 states and 1249 transitions. [2023-11-29 02:22:01,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 403 transitions, 868 flow [2023-11-29 02:22:01,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 403 transitions, 862 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-29 02:22:01,301 INFO L231 Difference]: Finished difference. Result has 405 places, 402 transitions, 830 flow [2023-11-29 02:22:01,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=405, PETRI_TRANSITIONS=402} [2023-11-29 02:22:01,302 INFO L281 CegarLoopForPetriNet]: 440 programPoint places, -35 predicate places. [2023-11-29 02:22:01,302 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 402 transitions, 830 flow [2023-11-29 02:22:01,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:01,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:22:01,302 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] [2023-11-29 02:22:01,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:22:01,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-29 02:22:01,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:01,303 INFO L85 PathProgramCache]: Analyzing trace with hash -712184242, now seen corresponding path program 1 times [2023-11-29 02:22:01,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:01,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782888197] [2023-11-29 02:22:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:01,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:01,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782888197] [2023-11-29 02:22:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782888197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:22:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:22:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:22:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641288062] [2023-11-29 02:22:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:22:01,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:22:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:01,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:22:01,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:22:01,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 454 [2023-11-29 02:22:01,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 402 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:01,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:22:01,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 454 [2023-11-29 02:22:01,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:22:08,392 INFO L124 PetriNetUnfolderBase]: 7737/42339 cut-off events. [2023-11-29 02:22:08,392 INFO L125 PetriNetUnfolderBase]: For 1204/1204 co-relation queries the response was YES. [2023-11-29 02:22:08,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53156 conditions, 42339 events. 7737/42339 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 620494 event pairs, 6804 based on Foata normal form. 0/35809 useless extension candidates. Maximal degree in co-relation 53126. Up to 9608 conditions per place. [2023-11-29 02:22:08,920 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 31 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2023-11-29 02:22:08,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 401 transitions, 894 flow [2023-11-29 02:22:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:22:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:22:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1186 transitions. [2023-11-29 02:22:08,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8707782672540382 [2023-11-29 02:22:08,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1186 transitions. [2023-11-29 02:22:08,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1186 transitions. [2023-11-29 02:22:08,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:22:08,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1186 transitions. [2023-11-29 02:22:08,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:08,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:08,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:08,935 INFO L175 Difference]: Start difference. First operand has 405 places, 402 transitions, 830 flow. Second operand 3 states and 1186 transitions. [2023-11-29 02:22:08,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 401 transitions, 894 flow [2023-11-29 02:22:08,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 401 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:22:08,946 INFO L231 Difference]: Finished difference. Result has 403 places, 401 transitions, 828 flow [2023-11-29 02:22:08,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=403, PETRI_TRANSITIONS=401} [2023-11-29 02:22:08,947 INFO L281 CegarLoopForPetriNet]: 440 programPoint places, -37 predicate places. [2023-11-29 02:22:08,948 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 401 transitions, 828 flow [2023-11-29 02:22:08,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:08,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:22:08,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:22:08,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 02:22:08,949 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-29 02:22:08,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash 700684965, now seen corresponding path program 1 times [2023-11-29 02:22:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:08,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728857381] [2023-11-29 02:22:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:08,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728857381] [2023-11-29 02:22:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728857381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:22:08,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:22:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:22:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106549069] [2023-11-29 02:22:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:22:08,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:22:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:08,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:22:08,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:22:09,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 454 [2023-11-29 02:22:09,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 401 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:09,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:22:09,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 454 [2023-11-29 02:22:09,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:22:11,116 INFO L124 PetriNetUnfolderBase]: 909/9314 cut-off events. [2023-11-29 02:22:11,117 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2023-11-29 02:22:11,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10609 conditions, 9314 events. 909/9314 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 111073 event pairs, 684 based on Foata normal form. 0/7741 useless extension candidates. Maximal degree in co-relation 10574. Up to 1031 conditions per place. [2023-11-29 02:22:11,275 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 22 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2023-11-29 02:22:11,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 874 flow [2023-11-29 02:22:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:22:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:22:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2023-11-29 02:22:11,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8839941262848752 [2023-11-29 02:22:11,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1204 transitions. [2023-11-29 02:22:11,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1204 transitions. [2023-11-29 02:22:11,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:22:11,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1204 transitions. [2023-11-29 02:22:11,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:11,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:11,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:11,290 INFO L175 Difference]: Start difference. First operand has 403 places, 401 transitions, 828 flow. Second operand 3 states and 1204 transitions. [2023-11-29 02:22:11,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 874 flow [2023-11-29 02:22:11,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 400 transitions, 870 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:22:11,299 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 826 flow [2023-11-29 02:22:11,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2023-11-29 02:22:11,300 INFO L281 CegarLoopForPetriNet]: 440 programPoint places, -38 predicate places. [2023-11-29 02:22:11,300 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 826 flow [2023-11-29 02:22:11,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:11,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:22:11,301 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] [2023-11-29 02:22:11,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 02:22:11,301 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-29 02:22:11,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash 370585110, now seen corresponding path program 1 times [2023-11-29 02:22:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:11,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456438185] [2023-11-29 02:22:11,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:11,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:11,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:11,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456438185] [2023-11-29 02:22:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456438185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:22:11,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:22:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:22:11,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349906991] [2023-11-29 02:22:11,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:22:11,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:22:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:22:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:22:11,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 454 [2023-11-29 02:22:11,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:11,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:22:11,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 454 [2023-11-29 02:22:11,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:22:14,997 INFO L124 PetriNetUnfolderBase]: 2261/21173 cut-off events. [2023-11-29 02:22:14,997 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2023-11-29 02:22:15,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24156 conditions, 21173 events. 2261/21173 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 298465 event pairs, 1720 based on Foata normal form. 0/17737 useless extension candidates. Maximal degree in co-relation 24113. Up to 2506 conditions per place. [2023-11-29 02:22:15,228 INFO L140 encePairwiseOnDemand]: 446/454 looper letters, 26 selfloop transitions, 1 changer transitions 0/393 dead transitions. [2023-11-29 02:22:15,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 393 transitions, 866 flow [2023-11-29 02:22:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:22:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:22:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2023-11-29 02:22:15,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8729809104258444 [2023-11-29 02:22:15,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1189 transitions. [2023-11-29 02:22:15,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1189 transitions. [2023-11-29 02:22:15,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:22:15,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1189 transitions. [2023-11-29 02:22:15,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 396.3333333333333) internal successors, (1189), 3 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:15,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:15,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:15,239 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 826 flow. Second operand 3 states and 1189 transitions. [2023-11-29 02:22:15,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 393 transitions, 866 flow [2023-11-29 02:22:15,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 393 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:22:15,246 INFO L231 Difference]: Finished difference. Result has 395 places, 393 transitions, 810 flow [2023-11-29 02:22:15,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=395, PETRI_TRANSITIONS=393} [2023-11-29 02:22:15,247 INFO L281 CegarLoopForPetriNet]: 440 programPoint places, -45 predicate places. [2023-11-29 02:22:15,247 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 393 transitions, 810 flow [2023-11-29 02:22:15,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:15,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:22:15,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:22:15,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 02:22:15,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-29 02:22:15,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1188644132, now seen corresponding path program 1 times [2023-11-29 02:22:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565221665] [2023-11-29 02:22:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565221665] [2023-11-29 02:22:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565221665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:22:15,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:22:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:22:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816395587] [2023-11-29 02:22:15,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:22:15,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:22:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:22:15,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:22:15,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 454 [2023-11-29 02:22:15,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 393 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:15,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:22:15,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 454 [2023-11-29 02:22:15,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:22:20,561 INFO L124 PetriNetUnfolderBase]: 4251/26994 cut-off events. [2023-11-29 02:22:20,561 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2023-11-29 02:22:20,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32967 conditions, 26994 events. 4251/26994 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 361633 event pairs, 3630 based on Foata normal form. 0/22789 useless extension candidates. Maximal degree in co-relation 32924. Up to 5188 conditions per place. [2023-11-29 02:22:20,923 INFO L140 encePairwiseOnDemand]: 451/454 looper letters, 27 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2023-11-29 02:22:20,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 392 transitions, 866 flow [2023-11-29 02:22:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:22:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:22:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1194 transitions. [2023-11-29 02:22:20,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8766519823788547 [2023-11-29 02:22:20,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1194 transitions. [2023-11-29 02:22:20,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1194 transitions. [2023-11-29 02:22:20,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:22:20,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1194 transitions. [2023-11-29 02:22:20,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:20,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:20,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:20,939 INFO L175 Difference]: Start difference. First operand has 395 places, 393 transitions, 810 flow. Second operand 3 states and 1194 transitions. [2023-11-29 02:22:20,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 392 transitions, 866 flow [2023-11-29 02:22:20,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 392 transitions, 865 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:22:20,953 INFO L231 Difference]: Finished difference. Result has 395 places, 392 transitions, 811 flow [2023-11-29 02:22:20,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=395, PETRI_TRANSITIONS=392} [2023-11-29 02:22:20,954 INFO L281 CegarLoopForPetriNet]: 440 programPoint places, -45 predicate places. [2023-11-29 02:22:20,954 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 392 transitions, 811 flow [2023-11-29 02:22:20,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:20,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:22:20,955 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] [2023-11-29 02:22:20,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 02:22:20,956 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-29 02:22:20,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash -303056489, now seen corresponding path program 1 times [2023-11-29 02:22:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:22:20,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510652898] [2023-11-29 02:22:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:22:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:22:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:22:21,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510652898] [2023-11-29 02:22:21,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510652898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:22:21,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:22:21,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:22:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324527130] [2023-11-29 02:22:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:22:21,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:22:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:22:21,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:22:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:22:21,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 454 [2023-11-29 02:22:21,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 392 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 367.6666666666667) internal successors, (1103), 3 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:22:21,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:22:21,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 454 [2023-11-29 02:22:21,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:23:35,052 INFO L124 PetriNetUnfolderBase]: 87483/441286 cut-off events. [2023-11-29 02:23:35,052 INFO L125 PetriNetUnfolderBase]: For 6739/6739 co-relation queries the response was YES. [2023-11-29 02:23:38,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562762 conditions, 441286 events. 87483/441286 cut-off events. For 6739/6739 co-relation queries the response was YES. Maximal size of possible extension queue 9838. Compared 8731905 event pairs, 36288 based on Foata normal form. 0/372699 useless extension candidates. Maximal degree in co-relation 562719. Up to 76888 conditions per place. [2023-11-29 02:23:40,945 INFO L140 encePairwiseOnDemand]: 414/454 looper letters, 64 selfloop transitions, 28 changer transitions 0/431 dead transitions. [2023-11-29 02:23:40,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 431 transitions, 1088 flow [2023-11-29 02:23:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:23:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:23:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1202 transitions. [2023-11-29 02:23:40,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.882525697503671 [2023-11-29 02:23:40,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1202 transitions. [2023-11-29 02:23:40,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1202 transitions. [2023-11-29 02:23:40,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:23:40,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1202 transitions. [2023-11-29 02:23:40,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:23:40,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:23:40,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 454.0) internal successors, (1816), 4 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:23:40,953 INFO L175 Difference]: Start difference. First operand has 395 places, 392 transitions, 811 flow. Second operand 3 states and 1202 transitions. [2023-11-29 02:23:40,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 431 transitions, 1088 flow [2023-11-29 02:23:40,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 431 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:23:40,962 INFO L231 Difference]: Finished difference. Result has 397 places, 420 transitions, 1055 flow [2023-11-29 02:23:40,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=454, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=397, PETRI_TRANSITIONS=420} [2023-11-29 02:23:40,962 INFO L281 CegarLoopForPetriNet]: 440 programPoint places, -43 predicate places. [2023-11-29 02:23:40,963 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 420 transitions, 1055 flow [2023-11-29 02:23:40,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.6666666666667) internal successors, (1103), 3 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:23:40,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:23:40,963 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] [2023-11-29 02:23:40,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 02:23:40,964 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-29 02:23:40,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:23:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 570576297, now seen corresponding path program 1 times [2023-11-29 02:23:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:23:40,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889676101] [2023-11-29 02:23:40,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:23:40,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:23:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:23:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:23:41,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:23:41,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889676101] [2023-11-29 02:23:41,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889676101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:23:41,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:23:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:23:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503418722] [2023-11-29 02:23:41,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:23:41,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:23:41,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:23:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:23:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:23:41,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 454 [2023-11-29 02:23:41,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 420 transitions, 1055 flow. Second operand has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:23:41,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:23:41,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 454 [2023-11-29 02:23:41,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:23:48,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 102#$Ultimate##0true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:48,141 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2023-11-29 02:23:48,141 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 02:23:48,141 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 02:23:48,141 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:23:48,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, Black: 463#true, 170#L1047-4true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 457#(= |#race~len~0| 0), thrThread3of4ForFork0InUse, thrThread4of4ForFork0NotInUse, 465#(= |#race~next~0| 0), 246#L1028-3true, 469#true, 307#L1019true]) [2023-11-29 02:23:48,192 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 02:23:48,192 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 02:23:48,192 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:23:48,192 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 02:23:48,781 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 170#L1047-4true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 457#(= |#race~len~0| 0), thrThread3of4ForFork0InUse, thrThread4of4ForFork0NotInUse, 465#(= |#race~next~0| 0), 246#L1028-3true, 469#true, 307#L1019true]) [2023-11-29 02:23:48,781 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 02:23:48,781 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:23:48,781 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 02:23:48,781 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:23:48,781 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 02:23:49,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 81#L1022-1true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:49,568 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2023-11-29 02:23:49,568 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 02:23:49,568 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-29 02:23:49,568 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 02:23:50,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 71#L1023true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:50,253 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2023-11-29 02:23:50,254 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 02:23:50,254 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 02:23:50,254 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 02:23:50,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, thrThread1of4ForFork0InUse, 463#true, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, 457#(= |#race~len~0| 0), thrThread3of4ForFork0InUse, thrThread4of4ForFork0NotInUse, 246#L1028-3true, 469#true, 307#L1019true]) [2023-11-29 02:23:50,412 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 02:23:50,412 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:23:50,413 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:23:50,413 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:23:50,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:23:50,875 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2023-11-29 02:23:50,875 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-29 02:23:50,875 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-29 02:23:50,875 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:23:51,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][154], [201#L1024true, 395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 471#(= |thrThread1of4ForFork0_~c~0#1| 0), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:23:51,135 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2023-11-29 02:23:51,135 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:23:51,135 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-29 02:23:51,136 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-29 02:23:51,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 457#(= |#race~len~0| 0), 276#L1028true, 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:51,487 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-11-29 02:23:51,487 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:23:51,487 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:23:51,487 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 02:23:51,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 245#L1025true, 307#L1019true]) [2023-11-29 02:23:51,860 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-11-29 02:23:51,860 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 02:23:51,860 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 02:23:51,860 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:23:53,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:53,355 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,355 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,355 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,355 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:53,374 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,374 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,374 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:53,374 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:53,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 244#$Ultimate##0true, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:23:53,423 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,423 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,423 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:53,423 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:53,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 240#L1013true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:23:53,669 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-11-29 02:23:53,670 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:23:53,670 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 02:23:53,670 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 02:23:53,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 423#$Ultimate##0true, 469#true, 307#L1019true]) [2023-11-29 02:23:53,944 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,944 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:53,944 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:53,944 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:54,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 102#$Ultimate##0true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:54,267 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-11-29 02:23:54,267 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 02:23:54,267 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 02:23:54,267 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:23:54,494 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:54,494 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,494 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,494 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:54,494 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,494 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:54,606 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 244#$Ultimate##0true, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:23:54,606 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,607 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,607 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:54,607 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:54,607 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,944 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 423#$Ultimate##0true, 469#true, 307#L1019true]) [2023-11-29 02:23:54,944 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,944 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:54,944 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,944 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:23:54,944 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 02:23:56,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 81#L1022-1true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:56,351 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-29 02:23:56,351 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 02:23:56,351 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 02:23:56,351 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:23:57,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 71#L1023true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:57,586 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-29 02:23:57,586 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 02:23:57,586 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:23:57,586 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 02:23:57,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 429#L1028-6true, 469#true, 307#L1019true]) [2023-11-29 02:23:57,968 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-29 02:23:57,968 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:23:57,968 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:23:57,968 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:23:58,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:23:58,280 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-29 02:23:58,280 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:23:58,281 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:23:58,281 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:23:58,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][154], [201#L1024true, 395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, 471#(= |thrThread1of4ForFork0_~c~0#1| 0), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:23:58,917 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-29 02:23:58,918 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:23:58,918 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:23:58,918 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:23:59,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 276#L1028true, 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:23:59,495 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-29 02:23:59,495 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:23:59,495 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:23:59,495 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:00,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), 431#L1013true, thrThread4of4ForFork0InUse, 245#L1025true, 307#L1019true]) [2023-11-29 02:24:00,057 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-29 02:24:00,057 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:24:00,057 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:00,057 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:24:00,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 170#L1047-4true, thrThread1of4ForFork0InUse, 463#true, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, 457#(= |#race~len~0| 0), thrThread3of4ForFork0InUse, thrThread4of4ForFork0NotInUse, 246#L1028-3true, 469#true, 307#L1019true]) [2023-11-29 02:24:00,647 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-29 02:24:00,647 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:24:00,647 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:24:00,648 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:24:00,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, 125#L1013true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:00,901 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:00,901 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:00,901 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:00,901 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:01,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [308#L1026-1true, 170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:01,215 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-29 02:24:01,215 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-29 02:24:01,215 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-29 02:24:01,215 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:02,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1738] L1026-->L1026-1: Formula: (= |v_#race~next~0_4| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_4|} AuxVars[] AssignedVars[#race~next~0][188], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 36#L1026-2true, 246#L1028-3true, 237#L1026-1true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:02,366 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-29 02:24:02,367 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:24:02,367 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 02:24:02,367 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:02,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:02,448 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,449 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,449 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,449 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:02,503 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,503 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:02,503 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:02,503 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 312#L1013true, 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:02,545 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,545 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,545 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:02,545 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:02,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:02,706 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:02,706 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:02,706 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:02,706 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:02,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][214], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 349#thrErr2ASSERT_VIOLATIONDATA_RACEtrue, 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:02,714 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,714 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,714 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,714 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [72#L1026-2true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:02,716 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,716 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,717 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 02:24:02,717 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 02:24:02,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][214], [170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), 138#thrErr2ASSERT_VIOLATIONDATA_RACEtrue, thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:02,720 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,720 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,720 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,720 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 240#L1013true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:02,897 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-29 02:24:02,897 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 02:24:02,897 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 02:24:02,897 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:03,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 405#L1028-6true, 102#$Ultimate##0true, 133#L1019true, 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:03,328 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-29 02:24:03,328 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 02:24:03,328 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:03,328 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:03,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 76#L1019true, 469#true, 307#L1019true]) [2023-11-29 02:24:03,747 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:03,747 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:03,747 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:03,747 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:03,862 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, 125#L1013true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:03,862 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:03,862 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:03,862 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:03,863 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:03,863 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:03,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1738] L1026-->L1026-1: Formula: (= |v_#race~next~0_4| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_4|} AuxVars[] AssignedVars[#race~next~0][188], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 246#L1028-3true, 237#L1026-1true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 45#L1027-1true, 469#true]) [2023-11-29 02:24:03,925 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-29 02:24:03,925 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:24:03,925 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:24:03,925 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 02:24:03,928 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:03,928 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:03,928 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:03,928 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:03,928 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:03,928 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:04,088 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 312#L1013true, 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:04,088 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:04,088 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:04,088 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,088 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,089 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:04,276 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:04,276 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:04,277 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,277 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,277 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:04,277 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 102#$Ultimate##0true, 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:04,892 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:04,892 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,892 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,892 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 102#$Ultimate##0true, 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:04,906 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:04,906 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,906 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:04,906 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:05,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 276#L1028true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:05,797 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-29 02:24:05,797 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:24:05,797 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 02:24:05,797 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:24:06,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 320#L1026-1true, 133#L1019true, 125#L1013true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse]) [2023-11-29 02:24:06,087 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-29 02:24:06,087 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:24:06,087 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:24:06,087 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:24:06,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 405#L1028-6true, 133#L1019true, 465#(= |#race~next~0| 0), 81#L1022-1true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:06,513 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-29 02:24:06,513 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:06,513 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:06,513 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-29 02:24:06,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 174#L1032true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:06,738 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:06,738 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:06,738 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:06,738 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:06,882 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:06,882 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:06,882 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:06,882 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:06,882 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:06,882 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:07,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 131#L1026-1true, 465#(= |#race~next~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:07,179 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:07,179 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:07,179 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:07,179 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:07,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [308#L1026-1true, 170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:07,491 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:07,491 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:07,491 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:07,491 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:07,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [308#L1026-1true, 170#L1047-4true, 457#(= |#race~len~0| 0), 276#L1028true, 133#L1019true, 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:07,493 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-29 02:24:07,493 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 02:24:07,493 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:07,493 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:07,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 125#L1013true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), 181#L1026-2true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse]) [2023-11-29 02:24:07,744 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:07,744 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:07,744 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:07,744 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:08,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 405#L1028-6true, 133#L1019true, 465#(= |#race~next~0| 0), 71#L1023true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:08,142 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-29 02:24:08,142 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:08,142 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:08,142 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 02:24:08,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 81#L1022-1true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:08,187 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:08,187 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:08,187 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:08,187 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:08,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 81#L1022-1true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:08,200 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:08,200 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:08,200 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:08,200 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:08,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 429#L1028-6true, 307#L1019true]) [2023-11-29 02:24:08,584 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:08,584 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:08,584 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:08,584 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:08,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 125#L1013true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 429#L1028-6true, 469#true]) [2023-11-29 02:24:08,592 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:08,592 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:08,592 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:08,592 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:08,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 18#L1026-2true, 170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:08,596 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:08,596 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:08,596 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:08,596 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [72#L1026-2true, 170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:09,153 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:09,153 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,153 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,153 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:09,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [72#L1026-2true, 170#L1047-4true, 457#(= |#race~len~0| 0), 276#L1028true, 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:09,159 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:09,159 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:09,159 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:09,159 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:09,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true, 232#L1027-1true]) [2023-11-29 02:24:09,310 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:09,310 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:09,310 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,310 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][258], [201#L1024true, 170#L1047-4true, 405#L1028-6true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 471#(= |thrThread1of4ForFork0_~c~0#1| 0), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:09,738 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-29 02:24:09,738 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:09,738 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-29 02:24:09,738 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:09,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 71#L1023true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:09,786 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:09,786 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,786 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,786 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 71#L1023true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:09,799 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:09,799 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,799 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:09,799 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:10,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:10,262 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:10,262 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,262 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,262 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1738] L1026-->L1026-1: Formula: (= |v_#race~next~0_4| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_4|} AuxVars[] AssignedVars[#race~next~0][188], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 300#L1027-2true, 246#L1028-3true, 237#L1026-1true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:10,344 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:10,344 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:10,345 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:10,345 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:10,365 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:10,365 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:10,365 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,365 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,365 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,365 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,366 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:10,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 244#$Ultimate##0true, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:10,828 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:10,828 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,828 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,828 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:10,867 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [308#L1026-1true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:10,867 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:10,867 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:10,867 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:10,867 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:10,867 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:11,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [170#L1047-4true, 37#L1027-2true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:11,002 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,002 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,002 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,002 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][214], [170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 239#thrErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:11,005 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,005 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,005 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,005 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][214], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 253#thrErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:11,008 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,008 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,008 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,008 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 423#$Ultimate##0true, 469#true, 307#L1019true]) [2023-11-29 02:24:11,279 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,279 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,279 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,279 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [170#L1047-4true, 405#L1028-6true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 245#L1025true, 307#L1019true]) [2023-11-29 02:24:11,339 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-29 02:24:11,339 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 02:24:11,339 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 02:24:11,339 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 02:24:11,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][204], [201#L1024true, 395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 471#(= |thrThread1of4ForFork0_~c~0#1| 0), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:11,383 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,383 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,383 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,383 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][154], [201#L1024true, 395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 471#(= |thrThread1of4ForFork0_~c~0#1| 0), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:11,395 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,395 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,396 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,396 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1738] L1026-->L1026-1: Formula: (= |v_#race~next~0_4| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_4|} AuxVars[] AssignedVars[#race~next~0][188], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 246#L1028-3true, 237#L1026-1true, 158#L1028-1true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:11,988 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,988 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,988 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:11,988 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:11,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 131#L1026-1true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:11,989 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:11,989 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:11,989 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:11,989 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:12,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 276#L1028true, 133#L1019true, 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:12,128 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 02:24:12,129 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 02:24:12,129 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:12,129 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:12,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), 200#L1028-1true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:12,511 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 02:24:12,511 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:12,512 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 02:24:12,512 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 02:24:12,514 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [72#L1026-2true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:12,514 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:12,514 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:12,514 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:12,515 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:12,515 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][214], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 245#L1025true, 307#L1019true]) [2023-11-29 02:24:13,016 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 02:24:13,016 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:13,016 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:13,016 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:13,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 245#L1025true, 307#L1019true]) [2023-11-29 02:24:13,029 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 02:24:13,029 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:13,029 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 02:24:13,029 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:13,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 131#L1026-1true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:13,683 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is not cut-off event [2023-11-29 02:24:13,683 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is not cut-off event [2023-11-29 02:24:13,683 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is not cut-off event [2023-11-29 02:24:13,684 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is not cut-off event [2023-11-29 02:24:13,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 36#L1026-2true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:13,686 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,686 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,686 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,686 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 18#L1026-2true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:13,725 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,725 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,725 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,725 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:13,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, 200#L1028-1true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:13,770 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-29 02:24:13,770 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:24:13,770 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:24:13,770 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-29 02:24:14,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 125#L1013true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 429#L1028-6true, 469#true]) [2023-11-29 02:24:14,195 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-29 02:24:14,195 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:14,195 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:14,195 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:14,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 9#$Ultimate##0true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 257#L1028-2true, 469#true, 307#L1019true]) [2023-11-29 02:24:14,229 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:14,229 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:14,229 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:14,229 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:14,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 125#L1013true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 280#L1027-1true]) [2023-11-29 02:24:14,328 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-29 02:24:14,328 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:24:14,328 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:24:14,328 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:24:14,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:14,438 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:14,438 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:14,438 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:14,438 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:14,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 217#L1028-1true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), 76#L1019true, thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:14,448 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-29 02:24:14,448 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-29 02:24:14,448 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:24:14,448 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 02:24:14,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [170#L1047-4true, 240#L1013true, 457#(= |#race~len~0| 0), 405#L1028-6true, 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:14,657 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-29 02:24:14,657 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:14,657 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-29 02:24:14,657 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 02:24:15,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 76#L1019true, 469#true, 307#L1019true]) [2023-11-29 02:24:15,265 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:15,266 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:15,266 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:15,266 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:15,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, 208#L1027-1true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:15,388 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:15,388 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:15,388 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:15,389 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:15,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][174], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 36#L1026-2true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:15,469 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is not cut-off event [2023-11-29 02:24:15,469 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 02:24:15,469 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 02:24:15,469 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 02:24:15,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1738] L1026-->L1026-1: Formula: (= |v_#race~next~0_4| 0) InVars {} OutVars{#race~next~0=|v_#race~next~0_4|} AuxVars[] AssignedVars[#race~next~0][188], [395#L1019true, 170#L1047-4true, 132#L1028-2true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 246#L1028-3true, 237#L1026-1true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:15,471 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 02:24:15,471 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:15,471 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:15,471 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 02:24:15,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 257#L1028-2true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:15,516 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:15,516 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:15,516 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:15,516 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true, 232#L1027-1true]) [2023-11-29 02:24:16,009 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,009 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,009 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,009 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 276#L1028true, 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true, 232#L1027-1true]) [2023-11-29 02:24:16,020 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-29 02:24:16,020 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 02:24:16,020 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:16,020 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 02:24:16,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 229#L1027-2true, 457#(= |#race~len~0| 0), 133#L1019true, 125#L1013true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse]) [2023-11-29 02:24:16,037 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,037 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,037 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,037 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,169 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:16,169 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,169 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,169 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,170 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,170 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [170#L1047-4true, 378#L1028-2true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:16,175 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,175 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,175 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,175 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][214], [170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 214#thrErr5ASSERT_VIOLATIONDATA_RACEtrue, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:16,178 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,179 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,179 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,179 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][214], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true, 258#thrErr5ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 02:24:16,188 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,188 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,188 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,188 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1752] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][214], [395#L1019true, 170#L1047-4true, 240#L1013true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:16,351 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,351 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,351 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,351 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 240#L1013true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:16,365 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,365 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:16,366 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:16,366 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:17,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:17,116 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 02:24:17,116 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,116 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-29 02:24:17,116 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 224#L1027-2true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:17,118 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 02:24:17,118 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,118 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,118 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), 200#L1028-1true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:17,130 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 02:24:17,130 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:17,130 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 02:24:17,131 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:17,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 37#L1027-2true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:17,749 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 02:24:17,750 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,750 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,750 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-29 02:24:17,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 276#L1028true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:17,759 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 02:24:17,759 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-29 02:24:17,759 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,760 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 37#L1027-2true, 457#(= |#race~len~0| 0), 276#L1028true, 465#(= |#race~next~0| 0), 133#L1019true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:17,763 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 02:24:17,763 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 02:24:17,763 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 02:24:17,763 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 02:24:17,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 276#L1028true, 133#L1019true, 125#L1013true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:17,765 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 02:24:17,765 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,765 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,765 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:17,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 131#L1026-1true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:17,904 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 02:24:17,904 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:17,904 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:17,904 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:17,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [308#L1026-1true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:17,922 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 02:24:17,922 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:17,922 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:17,922 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:18,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 174#L1032true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:18,723 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 02:24:18,723 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 02:24:18,724 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:18,724 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 02:24:18,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 257#L1028-2true, 469#true, 307#L1019true]) [2023-11-29 02:24:18,982 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 02:24:18,982 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 02:24:18,982 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:18,982 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:18,983 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 431#L1013true, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:18,983 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-29 02:24:18,983 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:18,983 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:18,983 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:18,983 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:18,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [378#L1028-2true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:18,985 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-29 02:24:18,985 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:18,985 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:18,985 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-29 02:24:19,621 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true, 232#L1027-1true]) [2023-11-29 02:24:19,621 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:19,621 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:19,621 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:19,621 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:19,621 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:19,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 36#L1026-2true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:19,770 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 02:24:19,770 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:19,770 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:19,770 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:19,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][270], [72#L1026-2true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 76#L1019true, 307#L1019true]) [2023-11-29 02:24:19,785 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 02:24:19,785 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:19,785 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:19,785 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:19,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][163], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 320#L1026-1true, 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 472#(and (= |thrThread1of4ForFork0_~end~0#1| 0) (= |thrThread1of4ForFork0_~c~0#1| 0)), thrThread4of4ForFork0InUse, 307#L1019true]) [2023-11-29 02:24:19,891 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 02:24:19,891 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:19,891 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:19,891 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 02:24:20,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 199#L1028-1true, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:20,692 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 02:24:20,692 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:20,692 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:20,692 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:20,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 276#L1028true, 133#L1019true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:20,728 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2023-11-29 02:24:20,728 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 02:24:20,729 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 02:24:20,729 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 02:24:20,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][127], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 45#L1027-1true, 469#true, 307#L1019true]) [2023-11-29 02:24:20,768 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:20,768 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:20,768 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:20,768 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:20,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [395#L1019true, 170#L1047-4true, 463#true, 457#(= |#race~len~0| 0), 133#L1019true, 246#L1028-3true, 208#L1027-1true, thrThread1of4ForFork0InUse, Black: 465#(= |#race~next~0| 0), thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true]) [2023-11-29 02:24:20,806 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:20,806 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:20,806 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:20,806 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:21,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 133#L1019true, 465#(= |#race~next~0| 0), 246#L1028-3true, 217#L1028-1true, Black: 463#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:21,319 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 02:24:21,319 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:21,319 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 02:24:21,319 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 02:24:21,321 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 37#L1027-2true, 457#(= |#race~len~0| 0), 465#(= |#race~next~0| 0), 133#L1019true, 246#L1028-3true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:21,321 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 02:24:21,321 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-29 02:24:21,321 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:21,322 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 02:24:21,322 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-29 02:24:21,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][226], [170#L1047-4true, 457#(= |#race~len~0| 0), 276#L1028true, 465#(= |#race~next~0| 0), 133#L1019true, 217#L1028-1true, thrThread1of4ForFork0InUse, Black: 463#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, thrThread4of4ForFork0InUse, 469#true, 307#L1019true]) [2023-11-29 02:24:21,333 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-29 02:24:21,333 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-29 02:24:21,333 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-29 02:24:21,333 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event