./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/25_stack_longest-1-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/25_stack_longest-1-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ --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 0cc9afdbf7eeaac0d52aedc8a0325c076240e2f45d0a3fe91081372b30b32137 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:30:23,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:30:23,453 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-23 22:30:23,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:30:23,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:30:23,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:30:23,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:30:23,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:30:23,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:30:23,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:30:23,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:30:23,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:30:23,506 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:30:23,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:30:23,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:30:23,508 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:30:23,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:30:23,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:30:23,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:30:23,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:30:23,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:30:23,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:30:23,512 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-23 22:30:23,512 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:30:23,513 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:30:23,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:30:23,514 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:30:23,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:30:23,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:30:23,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:30:23,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:30:23,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:30:23,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:30:23,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:30:23,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:30:23,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:30:23,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:30:23,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:30:23,519 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:30:23,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:30:23,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:30:23,520 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_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/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_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ 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 -> 0cc9afdbf7eeaac0d52aedc8a0325c076240e2f45d0a3fe91081372b30b32137 [2023-11-23 22:30:23,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:30:23,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:30:23,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:30:23,883 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:30:23,883 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:30:23,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-ext/25_stack_longest-1-race.i [2023-11-23 22:30:27,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:30:27,466 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:30:27,467 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/sv-benchmarks/c/pthread-ext/25_stack_longest-1-race.i [2023-11-23 22:30:27,494 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/data/fafb802d4/a2200986cb27439cb26484d54e0532b0/FLAGb948057cb [2023-11-23 22:30:27,509 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/data/fafb802d4/a2200986cb27439cb26484d54e0532b0 [2023-11-23 22:30:27,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:30:27,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:30:27,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:30:27,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:30:27,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:30:27,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:30:27" (1/1) ... [2023-11-23 22:30:27,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bb650f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:27, skipping insertion in model container [2023-11-23 22:30:27,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:30:27" (1/1) ... [2023-11-23 22:30:27,586 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:30:28,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:30:28,080 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:30:28,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:30:28,220 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:30:28,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28 WrapperNode [2023-11-23 22:30:28,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:30:28,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:30:28,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:30:28,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:30:28,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,339 INFO L138 Inliner]: procedures = 177, calls = 35, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 295 [2023-11-23 22:30:28,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:30:28,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:30:28,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:30:28,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:30:28,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:30:28,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:30:28,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:30:28,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:30:28,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (1/1) ... [2023-11-23 22:30:28,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:30:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:30:28,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:30:28,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90390ea2-6008-493f-a613-ebe2c381ab86/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:30:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 22:30:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-23 22:30:28,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-23 22:30:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 22:30:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:30:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:30:28,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:30:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 22:30:28,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:30:28,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:30:28,481 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 22:30:28,623 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:30:28,625 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:30:29,217 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:30:29,610 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:30:29,611 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 22:30:29,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:30:29 BoogieIcfgContainer [2023-11-23 22:30:29,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:30:29,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:30:29,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:30:29,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:30:29,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:30:27" (1/3) ... [2023-11-23 22:30:29,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2224b4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:30:29, skipping insertion in model container [2023-11-23 22:30:29,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:30:28" (2/3) ... [2023-11-23 22:30:29,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2224b4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:30:29, skipping insertion in model container [2023-11-23 22:30:29,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:30:29" (3/3) ... [2023-11-23 22:30:29,627 INFO L112 eAbstractionObserver]: Analyzing ICFG 25_stack_longest-1-race.i [2023-11-23 22:30:29,638 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 22:30:29,652 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:30:29,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-11-23 22:30:29,653 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 22:30:29,814 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 22:30:29,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 160 transitions, 324 flow [2023-11-23 22:30:29,999 INFO L124 PetriNetUnfolderBase]: 8/171 cut-off events. [2023-11-23 22:30:30,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:30:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 171 events. 8/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 139. Up to 4 conditions per place. [2023-11-23 22:30:30,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 160 transitions, 324 flow [2023-11-23 22:30:30,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 160 transitions, 324 flow [2023-11-23 22:30:30,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:30:30,072 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@323ee2af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:30:30,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-23 22:30:30,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:30:30,094 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-11-23 22:30:30,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:30:30,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:30,095 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] [2023-11-23 22:30:30,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-23 22:30:30,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1150451208, now seen corresponding path program 1 times [2023-11-23 22:30:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:30,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32154924] [2023-11-23 22:30:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:30,785 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-23 22:30:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:30:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32154924] [2023-11-23 22:30:30,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32154924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:30,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:30:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528697673] [2023-11-23 22:30:30,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:30,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:30:30,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:30:30,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:30:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:30:30,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 160 [2023-11-23 22:30:30,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 160 transitions, 324 flow. Second operand has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:30,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:30,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 160 [2023-11-23 22:30:30,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:30,947 INFO L124 PetriNetUnfolderBase]: 4/139 cut-off events. [2023-11-23 22:30:30,948 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-23 22:30:30,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 139 events. 4/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 130 event pairs, 0 based on Foata normal form. 8/132 useless extension candidates. Maximal degree in co-relation 122. Up to 10 conditions per place. [2023-11-23 22:30:30,950 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 9 selfloop transitions, 0 changer transitions 0/135 dead transitions. [2023-11-23 22:30:30,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 292 flow [2023-11-23 22:30:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:30:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-23 22:30:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2023-11-23 22:30:30,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9125 [2023-11-23 22:30:30,986 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 292 transitions. [2023-11-23 22:30:30,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions. [2023-11-23 22:30:30,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:30,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions. [2023-11-23 22:30:30,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,002 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,004 INFO L175 Difference]: Start difference. First operand has 156 places, 160 transitions, 324 flow. Second operand 2 states and 292 transitions. [2023-11-23 22:30:31,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 292 flow [2023-11-23 22:30:31,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 22:30:31,013 INFO L231 Difference]: Finished difference. Result has 135 places, 135 transitions, 274 flow [2023-11-23 22:30:31,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=274, PETRI_PLACES=135, PETRI_TRANSITIONS=135} [2023-11-23 22:30:31,019 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, -21 predicate places. [2023-11-23 22:30:31,019 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 135 transitions, 274 flow [2023-11-23 22:30:31,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:31,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:30:31,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:30:31,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-23 22:30:31,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1777045675, now seen corresponding path program 1 times [2023-11-23 22:30:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845088030] [2023-11-23 22:30:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:31,071 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-23 22:30:31,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:30:31,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845088030] [2023-11-23 22:30:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845088030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:31,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:30:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516907277] [2023-11-23 22:30:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:31,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:30:31,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:30:31,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:30:31,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:30:31,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2023-11-23 22:30:31,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 135 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:31,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2023-11-23 22:30:31,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:31,238 INFO L124 PetriNetUnfolderBase]: 6/224 cut-off events. [2023-11-23 22:30:31,239 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-23 22:30:31,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 224 events. 6/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 411 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 245. Up to 11 conditions per place. [2023-11-23 22:30:31,243 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 17 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2023-11-23 22:30:31,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 141 transitions, 324 flow [2023-11-23 22:30:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:30:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:30:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-11-23 22:30:31,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2023-11-23 22:30:31,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-11-23 22:30:31,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-11-23 22:30:31,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:31,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-11-23 22:30:31,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,263 INFO L175 Difference]: Start difference. First operand has 135 places, 135 transitions, 274 flow. Second operand 3 states and 404 transitions. [2023-11-23 22:30:31,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 141 transitions, 324 flow [2023-11-23 22:30:31,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 22:30:31,271 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 276 flow [2023-11-23 22:30:31,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2023-11-23 22:30:31,273 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, -20 predicate places. [2023-11-23 22:30:31,273 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 276 flow [2023-11-23 22:30:31,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:31,274 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] [2023-11-23 22:30:31,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:30:31,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-23 22:30:31,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1278672196, now seen corresponding path program 1 times [2023-11-23 22:30:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278602207] [2023-11-23 22:30:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:30:31,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:30:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:30:31,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:30:31,357 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:30:31,364 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2023-11-23 22:30:31,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2023-11-23 22:30:31,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2023-11-23 22:30:31,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2023-11-23 22:30:31,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2023-11-23 22:30:31,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2023-11-23 22:30:31,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2023-11-23 22:30:31,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2023-11-23 22:30:31,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2023-11-23 22:30:31,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2023-11-23 22:30:31,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2023-11-23 22:30:31,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2023-11-23 22:30:31,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2023-11-23 22:30:31,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2023-11-23 22:30:31,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2023-11-23 22:30:31,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2023-11-23 22:30:31,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2023-11-23 22:30:31,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2023-11-23 22:30:31,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2023-11-23 22:30:31,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2023-11-23 22:30:31,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2023-11-23 22:30:31,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2023-11-23 22:30:31,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2023-11-23 22:30:31,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2023-11-23 22:30:31,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2023-11-23 22:30:31,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2023-11-23 22:30:31,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2023-11-23 22:30:31,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2023-11-23 22:30:31,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2023-11-23 22:30:31,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2023-11-23 22:30:31,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2023-11-23 22:30:31,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2023-11-23 22:30:31,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2023-11-23 22:30:31,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2023-11-23 22:30:31,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2023-11-23 22:30:31,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2023-11-23 22:30:31,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2023-11-23 22:30:31,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2023-11-23 22:30:31,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2023-11-23 22:30:31,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2023-11-23 22:30:31,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2023-11-23 22:30:31,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2023-11-23 22:30:31,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2023-11-23 22:30:31,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2023-11-23 22:30:31,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2023-11-23 22:30:31,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2023-11-23 22:30:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2023-11-23 22:30:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2023-11-23 22:30:31,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2023-11-23 22:30:31,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2023-11-23 22:30:31,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2023-11-23 22:30:31,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2023-11-23 22:30:31,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2023-11-23 22:30:31,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:30:31,393 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-23 22:30:31,398 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-23 22:30:31,398 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-23 22:30:31,515 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 22:30:31,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 287 transitions, 584 flow [2023-11-23 22:30:31,612 INFO L124 PetriNetUnfolderBase]: 15/311 cut-off events. [2023-11-23 22:30:31,612 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-23 22:30:31,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 311 events. 15/311 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 885 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 265. Up to 6 conditions per place. [2023-11-23 22:30:31,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 287 transitions, 584 flow [2023-11-23 22:30:31,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 287 transitions, 584 flow [2023-11-23 22:30:31,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:30:31,636 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;@323ee2af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:30:31,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2023-11-23 22:30:31,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:30:31,642 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2023-11-23 22:30:31,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:30:31,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:31,642 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] [2023-11-23 22:30:31,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-23 22:30:31,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash -673732314, now seen corresponding path program 1 times [2023-11-23 22:30:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586724762] [2023-11-23 22:30:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:31,831 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-23 22:30:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:30:31,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586724762] [2023-11-23 22:30:31,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586724762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:31,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:31,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:30:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104970369] [2023-11-23 22:30:31,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:31,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:30:31,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:30:31,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:30:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:30:31,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 287 [2023-11-23 22:30:31,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 287 transitions, 584 flow. Second operand has 2 states, 2 states have (on average 234.0) internal successors, (468), 2 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:31,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:31,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 287 [2023-11-23 22:30:31,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:32,294 INFO L124 PetriNetUnfolderBase]: 112/1266 cut-off events. [2023-11-23 22:30:32,295 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-23 22:30:32,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1266 events. 112/1266 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8004 event pairs, 52 based on Foata normal form. 91/1184 useless extension candidates. Maximal degree in co-relation 1265. Up to 161 conditions per place. [2023-11-23 22:30:32,311 INFO L140 encePairwiseOnDemand]: 251/287 looper letters, 18 selfloop transitions, 0 changer transitions 0/244 dead transitions. [2023-11-23 22:30:32,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 244 transitions, 534 flow [2023-11-23 22:30:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:30:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-23 22:30:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 520 transitions. [2023-11-23 22:30:32,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9059233449477352 [2023-11-23 22:30:32,314 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 520 transitions. [2023-11-23 22:30:32,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 520 transitions. [2023-11-23 22:30:32,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:32,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 520 transitions. [2023-11-23 22:30:32,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 260.0) internal successors, (520), 2 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:32,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:32,320 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:32,320 INFO L175 Difference]: Start difference. First operand has 279 places, 287 transitions, 584 flow. Second operand 2 states and 520 transitions. [2023-11-23 22:30:32,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 244 transitions, 534 flow [2023-11-23 22:30:32,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 244 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 22:30:32,331 INFO L231 Difference]: Finished difference. Result has 242 places, 244 transitions, 498 flow [2023-11-23 22:30:32,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=498, PETRI_PLACES=242, PETRI_TRANSITIONS=244} [2023-11-23 22:30:32,338 INFO L281 CegarLoopForPetriNet]: 279 programPoint places, -37 predicate places. [2023-11-23 22:30:32,339 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 244 transitions, 498 flow [2023-11-23 22:30:32,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 234.0) internal successors, (468), 2 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:32,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:32,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:30:32,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:30:32,340 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-23 22:30:32,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1083351017, now seen corresponding path program 1 times [2023-11-23 22:30:32,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:32,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843381093] [2023-11-23 22:30:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:32,388 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-23 22:30:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:30:32,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843381093] [2023-11-23 22:30:32,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843381093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:32,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:32,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:30:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477595709] [2023-11-23 22:30:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:32,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:30:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:30:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:30:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:30:32,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 287 [2023-11-23 22:30:32,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 244 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:32,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:32,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 287 [2023-11-23 22:30:32,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:33,231 INFO L124 PetriNetUnfolderBase]: 366/3572 cut-off events. [2023-11-23 22:30:33,232 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-23 22:30:33,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4196 conditions, 3572 events. 366/3572 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 31869 event pairs, 95 based on Foata normal form. 0/3091 useless extension candidates. Maximal degree in co-relation 4191. Up to 290 conditions per place. [2023-11-23 22:30:33,276 INFO L140 encePairwiseOnDemand]: 279/287 looper letters, 43 selfloop transitions, 6 changer transitions 0/267 dead transitions. [2023-11-23 22:30:33,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 267 transitions, 647 flow [2023-11-23 22:30:33,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:30:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:30:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2023-11-23 22:30:33,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8432055749128919 [2023-11-23 22:30:33,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 726 transitions. [2023-11-23 22:30:33,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 726 transitions. [2023-11-23 22:30:33,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:33,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 726 transitions. [2023-11-23 22:30:33,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:33,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:33,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:33,289 INFO L175 Difference]: Start difference. First operand has 242 places, 244 transitions, 498 flow. Second operand 3 states and 726 transitions. [2023-11-23 22:30:33,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 267 transitions, 647 flow [2023-11-23 22:30:33,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 267 transitions, 647 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 22:30:33,296 INFO L231 Difference]: Finished difference. Result has 246 places, 250 transitions, 550 flow [2023-11-23 22:30:33,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=246, PETRI_TRANSITIONS=250} [2023-11-23 22:30:33,299 INFO L281 CegarLoopForPetriNet]: 279 programPoint places, -33 predicate places. [2023-11-23 22:30:33,300 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 250 transitions, 550 flow [2023-11-23 22:30:33,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:33,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:33,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-23 22:30:33,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:30:33,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-23 22:30:33,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:33,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1676275495, now seen corresponding path program 1 times [2023-11-23 22:30:33,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:33,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67021357] [2023-11-23 22:30:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:33,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:33,351 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-23 22:30:33,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:30:33,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67021357] [2023-11-23 22:30:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67021357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:33,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:33,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:30:33,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582666318] [2023-11-23 22:30:33,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:33,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:30:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:30:33,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:30:33,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:30:33,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 287 [2023-11-23 22:30:33,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 250 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:33,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:33,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 287 [2023-11-23 22:30:33,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:34,445 INFO L124 PetriNetUnfolderBase]: 674/4772 cut-off events. [2023-11-23 22:30:34,446 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-23 22:30:34,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6028 conditions, 4772 events. 674/4772 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 45091 event pairs, 283 based on Foata normal form. 0/4110 useless extension candidates. Maximal degree in co-relation 6021. Up to 992 conditions per place. [2023-11-23 22:30:34,506 INFO L140 encePairwiseOnDemand]: 279/287 looper letters, 37 selfloop transitions, 7 changer transitions 0/264 dead transitions. [2023-11-23 22:30:34,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 264 transitions, 671 flow [2023-11-23 22:30:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:30:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:30:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2023-11-23 22:30:34,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8222996515679443 [2023-11-23 22:30:34,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 708 transitions. [2023-11-23 22:30:34,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 708 transitions. [2023-11-23 22:30:34,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:34,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 708 transitions. [2023-11-23 22:30:34,514 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-23 22:30:34,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:34,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:34,518 INFO L175 Difference]: Start difference. First operand has 246 places, 250 transitions, 550 flow. Second operand 3 states and 708 transitions. [2023-11-23 22:30:34,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 264 transitions, 671 flow [2023-11-23 22:30:34,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 264 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:30:34,530 INFO L231 Difference]: Finished difference. Result has 248 places, 256 transitions, 592 flow [2023-11-23 22:30:34,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=248, PETRI_TRANSITIONS=256} [2023-11-23 22:30:34,533 INFO L281 CegarLoopForPetriNet]: 279 programPoint places, -31 predicate places. [2023-11-23 22:30:34,533 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 256 transitions, 592 flow [2023-11-23 22:30:34,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:34,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:34,535 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] [2023-11-23 22:30:34,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:30:34,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-23 22:30:34,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash -98223325, now seen corresponding path program 1 times [2023-11-23 22:30:34,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:34,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109148287] [2023-11-23 22:30:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:30:34,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:30:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:30:34,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:30:34,588 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:30:34,589 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2023-11-23 22:30:34,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2023-11-23 22:30:34,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2023-11-23 22:30:34,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2023-11-23 22:30:34,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2023-11-23 22:30:34,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2023-11-23 22:30:34,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2023-11-23 22:30:34,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2023-11-23 22:30:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2023-11-23 22:30:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2023-11-23 22:30:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2023-11-23 22:30:34,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2023-11-23 22:30:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2023-11-23 22:30:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2023-11-23 22:30:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2023-11-23 22:30:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2023-11-23 22:30:34,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2023-11-23 22:30:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2023-11-23 22:30:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2023-11-23 22:30:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2023-11-23 22:30:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2023-11-23 22:30:34,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2023-11-23 22:30:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2023-11-23 22:30:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2023-11-23 22:30:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2023-11-23 22:30:34,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2023-11-23 22:30:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2023-11-23 22:30:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2023-11-23 22:30:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2023-11-23 22:30:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2023-11-23 22:30:34,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2023-11-23 22:30:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2023-11-23 22:30:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2023-11-23 22:30:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2023-11-23 22:30:34,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2023-11-23 22:30:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2023-11-23 22:30:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2023-11-23 22:30:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2023-11-23 22:30:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2023-11-23 22:30:34,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2023-11-23 22:30:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2023-11-23 22:30:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2023-11-23 22:30:34,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2023-11-23 22:30:34,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2023-11-23 22:30:34,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2023-11-23 22:30:34,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2023-11-23 22:30:34,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2023-11-23 22:30:34,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2023-11-23 22:30:34,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2023-11-23 22:30:34,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2023-11-23 22:30:34,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2023-11-23 22:30:34,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2023-11-23 22:30:34,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2023-11-23 22:30:34,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2023-11-23 22:30:34,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2023-11-23 22:30:34,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2023-11-23 22:30:34,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2023-11-23 22:30:34,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2023-11-23 22:30:34,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2023-11-23 22:30:34,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2023-11-23 22:30:34,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2023-11-23 22:30:34,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2023-11-23 22:30:34,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2023-11-23 22:30:34,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2023-11-23 22:30:34,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2023-11-23 22:30:34,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2023-11-23 22:30:34,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2023-11-23 22:30:34,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2023-11-23 22:30:34,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2023-11-23 22:30:34,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2023-11-23 22:30:34,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2023-11-23 22:30:34,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2023-11-23 22:30:34,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2023-11-23 22:30:34,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2023-11-23 22:30:34,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2023-11-23 22:30:34,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2023-11-23 22:30:34,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2023-11-23 22:30:34,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2023-11-23 22:30:34,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2023-11-23 22:30:34,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:30:34,613 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-23 22:30:34,613 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-23 22:30:34,614 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-23 22:30:34,813 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 22:30:34,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 414 transitions, 846 flow [2023-11-23 22:30:35,023 INFO L124 PetriNetUnfolderBase]: 22/451 cut-off events. [2023-11-23 22:30:35,023 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-23 22:30:35,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 451 events. 22/451 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1705 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 391. Up to 8 conditions per place. [2023-11-23 22:30:35,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 402 places, 414 transitions, 846 flow [2023-11-23 22:30:35,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 402 places, 414 transitions, 846 flow [2023-11-23 22:30:35,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:30:35,053 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;@323ee2af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:30:35,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-11-23 22:30:35,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:30:35,059 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2023-11-23 22:30:35,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:30:35,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:35,059 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] [2023-11-23 22:30:35,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-23 22:30:35,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash 570753764, now seen corresponding path program 1 times [2023-11-23 22:30:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311885263] [2023-11-23 22:30:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:35,248 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-23 22:30:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:30:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311885263] [2023-11-23 22:30:35,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311885263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:35,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:35,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:30:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635676358] [2023-11-23 22:30:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:35,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:30:35,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:30:35,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:30:35,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:30:35,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 414 [2023-11-23 22:30:35,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 414 transitions, 846 flow. Second operand has 2 states, 2 states have (on average 335.0) internal successors, (670), 2 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:35,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:35,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 414 [2023-11-23 22:30:35,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:38,494 INFO L124 PetriNetUnfolderBase]: 1750/12058 cut-off events. [2023-11-23 22:30:38,494 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2023-11-23 22:30:38,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14531 conditions, 12058 events. 1750/12058 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 135695 event pairs, 962 based on Foata normal form. 956/11431 useless extension candidates. Maximal degree in co-relation 12713. Up to 2202 conditions per place. [2023-11-23 22:30:38,702 INFO L140 encePairwiseOnDemand]: 361/414 looper letters, 27 selfloop transitions, 0 changer transitions 0/353 dead transitions. [2023-11-23 22:30:38,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 353 transitions, 778 flow [2023-11-23 22:30:38,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:30:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-23 22:30:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 748 transitions. [2023-11-23 22:30:38,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2023-11-23 22:30:38,706 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 748 transitions. [2023-11-23 22:30:38,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 748 transitions. [2023-11-23 22:30:38,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:38,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 748 transitions. [2023-11-23 22:30:38,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 374.0) internal successors, (748), 2 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:38,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:38,714 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:38,715 INFO L175 Difference]: Start difference. First operand has 402 places, 414 transitions, 846 flow. Second operand 2 states and 748 transitions. [2023-11-23 22:30:38,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 353 transitions, 778 flow [2023-11-23 22:30:38,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 353 transitions, 776 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-23 22:30:38,724 INFO L231 Difference]: Finished difference. Result has 349 places, 353 transitions, 722 flow [2023-11-23 22:30:38,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=722, PETRI_PLACES=349, PETRI_TRANSITIONS=353} [2023-11-23 22:30:38,727 INFO L281 CegarLoopForPetriNet]: 402 programPoint places, -53 predicate places. [2023-11-23 22:30:38,727 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 353 transitions, 722 flow [2023-11-23 22:30:38,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 335.0) internal successors, (670), 2 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:38,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:38,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:30:38,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:30:38,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-23 22:30:38,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:38,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1261390361, now seen corresponding path program 1 times [2023-11-23 22:30:38,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:38,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839153628] [2023-11-23 22:30:38,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:38,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:38,765 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-23 22:30:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:30:38,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839153628] [2023-11-23 22:30:38,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839153628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:38,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:38,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:30:38,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280790459] [2023-11-23 22:30:38,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:38,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:30:38,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:30:38,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:30:38,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:30:38,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 414 [2023-11-23 22:30:38,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 353 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:38,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:38,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 414 [2023-11-23 22:30:38,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:48,847 INFO L124 PetriNetUnfolderBase]: 9390/54554 cut-off events. [2023-11-23 22:30:48,848 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2023-11-23 22:30:49,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67756 conditions, 54554 events. 9390/54554 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 801369 event pairs, 2765 based on Foata normal form. 0/47047 useless extension candidates. Maximal degree in co-relation 67750. Up to 6320 conditions per place. [2023-11-23 22:30:49,613 INFO L140 encePairwiseOnDemand]: 402/414 looper letters, 65 selfloop transitions, 9 changer transitions 0/388 dead transitions. [2023-11-23 22:30:49,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 388 transitions, 950 flow [2023-11-23 22:30:49,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:30:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:30:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1043 transitions. [2023-11-23 22:30:49,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8397745571658615 [2023-11-23 22:30:49,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1043 transitions. [2023-11-23 22:30:49,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1043 transitions. [2023-11-23 22:30:49,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:30:49,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1043 transitions. [2023-11-23 22:30:49,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 347.6666666666667) internal successors, (1043), 3 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:49,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:49,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:49,630 INFO L175 Difference]: Start difference. First operand has 349 places, 353 transitions, 722 flow. Second operand 3 states and 1043 transitions. [2023-11-23 22:30:49,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 388 transitions, 950 flow [2023-11-23 22:30:49,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 388 transitions, 950 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 22:30:49,639 INFO L231 Difference]: Finished difference. Result has 353 places, 362 transitions, 800 flow [2023-11-23 22:30:49,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=353, PETRI_TRANSITIONS=362} [2023-11-23 22:30:49,642 INFO L281 CegarLoopForPetriNet]: 402 programPoint places, -49 predicate places. [2023-11-23 22:30:49,642 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 362 transitions, 800 flow [2023-11-23 22:30:49,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:49,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:30:49,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:30:49,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:30:49,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-23 22:30:49,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:30:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1046175175, now seen corresponding path program 1 times [2023-11-23 22:30:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:30:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910811158] [2023-11-23 22:30:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:30:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:30:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:30:49,690 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-23 22:30:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:30:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910811158] [2023-11-23 22:30:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910811158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:30:49,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:30:49,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:30:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167153976] [2023-11-23 22:30:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:30:49,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:30:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:30:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:30:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:30:49,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 414 [2023-11-23 22:30:49,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 362 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:30:49,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:30:49,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 414 [2023-11-23 22:30:49,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:30:51,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 114#L766-3true, 90#L766-3true, 414#true, 405#true, 71#L775-5true, 367#L716true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:51,894 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-23 22:30:51,894 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-23 22:30:51,894 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-23 22:30:51,894 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-23 22:30:51,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 114#L766-3true, 90#L766-3true, 414#true, 405#true, 71#L775-5true, 290#L764true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:51,982 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-23 22:30:51,982 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-23 22:30:51,982 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-23 22:30:51,982 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-23 22:30:54,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 90#L766-3true, 414#true, 405#true, 71#L775-5true, 367#L716true, 152#L705-3true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:54,637 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-23 22:30:54,638 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-23 22:30:54,638 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-23 22:30:54,638 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-23 22:30:54,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 90#L766-3true, 414#true, 405#true, 290#L764true, 71#L775-5true, 152#L705-3true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:54,774 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-23 22:30:54,774 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-23 22:30:54,774 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-23 22:30:54,774 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-23 22:30:55,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 90#L766-3true, 414#true, 405#true, 318#L707-3true, 71#L775-5true, 367#L716true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:55,405 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-23 22:30:55,405 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-23 22:30:55,406 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-23 22:30:55,406 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-23 22:30:55,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 90#L766-3true, 414#true, 405#true, 318#L707-3true, 71#L775-5true, 290#L764true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:55,560 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-23 22:30:55,560 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:30:55,560 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-23 22:30:55,560 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-23 22:30:58,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 414#true, 314#L732-3true, 90#L766-3true, 405#true, 71#L775-5true, 367#L716true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:58,175 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-23 22:30:58,176 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-23 22:30:58,176 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-23 22:30:58,176 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-23 22:30:58,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 314#L732-3true, 90#L766-3true, 414#true, 405#true, 71#L775-5true, 290#L764true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:58,519 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-23 22:30:58,519 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-23 22:30:58,519 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-23 22:30:58,519 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-23 22:30:58,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 414#true, 90#L766-3true, 236#L733true, 405#true, 71#L775-5true, 367#L716true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:58,521 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-23 22:30:58,521 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-23 22:30:58,521 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-23 22:30:58,522 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-23 22:30:58,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 414#true, 90#L766-3true, 236#L733true, 405#true, 71#L775-5true, 290#L764true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:30:58,654 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-23 22:30:58,654 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-23 22:30:58,654 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-23 22:30:58,654 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-23 22:31:00,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 414#true, 90#L766-3true, 405#true, 344#L735-3true, 71#L775-5true, 367#L716true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:00,031 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-11-23 22:31:00,031 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-23 22:31:00,031 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-23 22:31:00,031 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-23 22:31:00,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 414#true, 90#L766-3true, 405#true, 344#L735-3true, 71#L775-5true, 290#L764true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:00,174 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-23 22:31:00,174 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-23 22:31:00,174 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-23 22:31:00,174 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-23 22:31:00,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 90#L766-3true, 414#true, 405#true, 71#L775-5true, 367#L716true, 159#L736-3true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:00,704 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-23 22:31:00,704 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-23 22:31:00,704 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-23 22:31:00,704 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-23 22:31:00,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_426|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][120], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 414#true, 90#L766-3true, 405#true, 71#L775-5true, 290#L764true, 159#L736-3true, Black: 410#(= |#race~state~0| 0), thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:00,884 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-23 22:31:00,884 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-23 22:31:00,884 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-23 22:31:00,884 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-23 22:31:05,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1840] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, #memory_int=|v_#memory_int_426|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][75], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 114#L766-3true, 414#true, 405#true, 71#L775-5true, 82#L735-3true, Black: 410#(= |#race~state~0| 0), 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:05,415 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-23 22:31:05,415 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-23 22:31:05,415 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-23 22:31:05,415 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-23 22:31:05,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1840] L766-->L766-3: Formula: (let ((.cse1 (select |v_#race_727| |v_~#m2~0.base_21|)) (.cse5 (+ |v_~#m2~0.offset_21| 1))) (let ((.cse0 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (+ |v_~#m2~0.offset_21| 3)) (.cse2 (select .cse1 .cse5))) (and (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse0 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= (select .cse1 |v_~#m2~0.offset_21|) .cse2) (= (select .cse1 .cse3) .cse2) (= .cse2 (select .cse1 .cse4)) (not (= (ite (= 1 (select .cse0 |v_~#m2~0.offset_21|)) 1 0) 0)) (= |v_#race_727| (store |v_#race_729| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_729| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse2) .cse5 .cse2) .cse3 .cse2) .cse4 .cse2)))))) InVars {#race=|v_#race_729|, #memory_int=|v_#memory_int_427|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_727|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, #memory_int=|v_#memory_int_426|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][75], [408#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 114#L766-3true, 414#true, 405#true, 47#L736-3true, 71#L775-5true, Black: 410#(= |#race~state~0| 0), 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:05,641 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-23 22:31:05,641 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-23 22:31:05,641 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-23 22:31:05,641 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-23 22:31:07,359 INFO L124 PetriNetUnfolderBase]: 21187/99402 cut-off events. [2023-11-23 22:31:07,359 INFO L125 PetriNetUnfolderBase]: For 1890/1890 co-relation queries the response was YES. [2023-11-23 22:31:08,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130981 conditions, 99402 events. 21187/99402 cut-off events. For 1890/1890 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 1535661 event pairs, 10174 based on Foata normal form. 0/86058 useless extension candidates. Maximal degree in co-relation 130973. Up to 26138 conditions per place. [2023-11-23 22:31:08,790 INFO L140 encePairwiseOnDemand]: 402/414 looper letters, 57 selfloop transitions, 11 changer transitions 0/388 dead transitions. [2023-11-23 22:31:08,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 388 transitions, 998 flow [2023-11-23 22:31:08,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:31:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:31:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1026 transitions. [2023-11-23 22:31:08,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8260869565217391 [2023-11-23 22:31:08,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1026 transitions. [2023-11-23 22:31:08,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1026 transitions. [2023-11-23 22:31:08,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:31:08,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1026 transitions. [2023-11-23 22:31:08,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:08,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:08,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:08,809 INFO L175 Difference]: Start difference. First operand has 353 places, 362 transitions, 800 flow. Second operand 3 states and 1026 transitions. [2023-11-23 22:31:08,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 388 transitions, 998 flow [2023-11-23 22:31:08,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 388 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:31:08,833 INFO L231 Difference]: Finished difference. Result has 355 places, 372 transitions, 868 flow [2023-11-23 22:31:08,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=355, PETRI_TRANSITIONS=372} [2023-11-23 22:31:08,836 INFO L281 CegarLoopForPetriNet]: 402 programPoint places, -47 predicate places. [2023-11-23 22:31:08,837 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 372 transitions, 868 flow [2023-11-23 22:31:08,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:08,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:31:08,839 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] [2023-11-23 22:31:08,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 22:31:08,840 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-23 22:31:08,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:31:08,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1546813968, now seen corresponding path program 1 times [2023-11-23 22:31:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:31:08,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673351191] [2023-11-23 22:31:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:31:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:31:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:31:08,885 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-23 22:31:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:31:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673351191] [2023-11-23 22:31:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673351191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:31:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:31:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:31:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950848681] [2023-11-23 22:31:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:31:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:31:08,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:31:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:31:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:31:08,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 414 [2023-11-23 22:31:08,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 372 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:31:08,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:31:08,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 414 [2023-11-23 22:31:08,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:31:12,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 185#L717-3true, 414#true, 420#true, 405#true, 6#L717-3true, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:12,823 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-23 22:31:12,824 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-23 22:31:12,824 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-23 22:31:12,824 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-23 22:31:12,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 362#L717-4true, 6#L717-3true, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:12,997 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-23 22:31:12,997 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:12,997 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:12,997 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:12,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 6#L717-3true, 46#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:12,998 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-23 22:31:12,998 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:12,999 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:12,999 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:14,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][349], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 185#L717-3true, 414#true, 420#true, 405#true, 6#L717-3true, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:14,018 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is not cut-off event [2023-11-23 22:31:14,018 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2023-11-23 22:31:14,018 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2023-11-23 22:31:14,018 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2023-11-23 22:31:14,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 6#L717-3true, 71#L775-5true, 367#L716true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:14,154 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-23 22:31:14,155 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-23 22:31:14,155 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-23 22:31:14,155 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-23 22:31:14,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][349], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 362#L717-4true, 6#L717-3true, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:14,155 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2023-11-23 22:31:14,156 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-23 22:31:14,156 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2023-11-23 22:31:14,156 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2023-11-23 22:31:15,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][362], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 114#L766-3true, thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 71#L775-5true, 367#L716true, Black: 408#true, 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:15,108 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-23 22:31:15,108 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:15,108 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:15,108 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:15,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][387], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 405#true, 6#L717-3true, 198#L764-4true, 71#L775-5true, 422#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:15,422 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-23 22:31:15,422 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-23 22:31:15,422 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-23 22:31:15,422 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-23 22:31:16,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 90#L766-3true, 414#true, 420#true, 405#true, 71#L775-5true, 367#L716true, Black: 408#true, thr1Thread1of3ForFork0InUse, 10#L752-3true]) [2023-11-23 22:31:16,515 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-23 22:31:16,515 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:16,516 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,516 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,569 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 185#L717-3true, 414#true, 420#true, 405#true, 6#L717-3true, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,569 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2023-11-23 22:31:16,569 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-23 22:31:16,570 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-23 22:31:16,570 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-23 22:31:16,570 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-23 22:31:16,571 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 6#L717-3true, 46#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,571 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-23 22:31:16,571 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:16,571 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:16,571 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,571 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 175#L760true, 6#L717-3true, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,599 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-23 22:31:16,599 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-23 22:31:16,599 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-23 22:31:16,599 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-23 22:31:16,711 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 362#L717-4true, 6#L717-3true, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,711 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-23 22:31:16,711 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:16,712 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,712 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:16,712 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][362], [thr1Thread2of3ForFork0InUse, 4#L717-3true, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 46#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 71#L775-5true, Black: 408#true, 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,722 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-23 22:31:16,722 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,722 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-23 22:31:16,722 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-23 22:31:16,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][362], [thr1Thread2of3ForFork0InUse, 4#L717-3true, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 185#L717-3true, 414#true, 420#true, 405#true, 71#L775-5true, Black: 408#true, 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,723 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2023-11-23 22:31:16,723 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-23 22:31:16,723 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-23 22:31:16,723 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-23 22:31:16,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][397], [thr1Thread2of3ForFork0InUse, 4#L717-3true, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 405#true, 198#L764-4true, 71#L775-5true, 422#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), Black: 410#(= |#race~state~0| 0), 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,829 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-23 22:31:16,829 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-23 22:31:16,829 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-23 22:31:16,829 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-23 22:31:16,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][397], [thr1Thread2of3ForFork0InUse, 4#L717-3true, thr1Thread3of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 414#true, 241#L764-3true, 405#true, 71#L775-5true, 422#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), Black: 410#(= |#race~state~0| 0), 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,830 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-23 22:31:16,830 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-23 22:31:16,830 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-23 22:31:16,831 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-23 22:31:16,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][362], [thr1Thread2of3ForFork0InUse, 4#L717-3true, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 362#L717-4true, 71#L775-5true, Black: 408#true, 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,858 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-23 22:31:16,858 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-23 22:31:16,858 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-23 22:31:16,858 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,962 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][362], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 114#L766-3true, 414#true, 420#true, 405#true, 71#L775-5true, 367#L716true, Black: 408#true, 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,962 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-11-23 22:31:16,962 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-23 22:31:16,962 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:16,963 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,963 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][362], [thr1Thread2of3ForFork0InUse, 4#L717-3true, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 71#L775-5true, 367#L716true, Black: 408#true, 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,963 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-23 22:31:16,963 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-23 22:31:16,963 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-23 22:31:16,963 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-23 22:31:16,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1676] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse1 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse2 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse2)) (and .cse2 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100| (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse3) .cse1) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse3))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][397], [thr1Thread2of3ForFork0InUse, 4#L717-3true, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 405#true, 198#L764-4true, 71#L775-5true, Black: 408#true, 422#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), 92#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,977 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-23 22:31:16,977 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-23 22:31:16,977 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-23 22:31:16,977 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-23 22:31:16,997 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 90#L766-3true, 420#true, 405#true, 71#L775-5true, 367#L716true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,997 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-23 22:31:16,997 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-23 22:31:16,998 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,998 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-23 22:31:16,998 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-23 22:31:16,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 71#L775-5true, 367#L716true, Black: 408#true, 333#L762true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:16,998 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-23 22:31:16,998 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-23 22:31:16,998 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-23 22:31:16,998 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-23 22:31:17,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1928] L752-->L752-3: Formula: (let ((.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse1 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (not .cse1)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse1))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse2 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse3 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse3) (and (not .cse3) .cse2))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][326], [thr1Thread2of3ForFork0InUse, Black: 416#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), thr1Thread3of3ForFork0InUse, 414#true, 420#true, 405#true, 160#L766-3true, 6#L717-3true, 71#L775-5true, Black: 408#true, 10#L752-3true, thr1Thread1of3ForFork0InUse]) [2023-11-23 22:31:17,684 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-23 22:31:17,684 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-23 22:31:17,685 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-23 22:31:17,685 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event