./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/25_stack_longer-2-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/25_stack_longer-2-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme --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 dadbc714432dbabd9f10b5aceb2a2ff8af11608da70d21414f772d02695c7806 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:01:07,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:01:07,410 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 12:01:07,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:01:07,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:01:07,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:01:07,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:01:07,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:01:07,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:01:07,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:01:07,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:01:07,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:01:07,456 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:01:07,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:01:07,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:01:07,458 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:01:07,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:01:07,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:01:07,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:01:07,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:01:07,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:01:07,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:01:07,466 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 12:01:07,466 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:01:07,467 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:01:07,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:01:07,468 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:01:07,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:01:07,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:01:07,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:01:07,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:01:07,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:01:07,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:01:07,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:01:07,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:01:07,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:01:07,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:01:07,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:01:07,475 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:01:07,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:01:07,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:01:07,476 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_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/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_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme 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 -> dadbc714432dbabd9f10b5aceb2a2ff8af11608da70d21414f772d02695c7806 [2023-11-26 12:01:07,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:01:07,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:01:07,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:01:07,842 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:01:07,842 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:01:07,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-ext/25_stack_longer-2-race.i [2023-11-26 12:01:11,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:01:11,774 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:01:11,775 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/sv-benchmarks/c/pthread-ext/25_stack_longer-2-race.i [2023-11-26 12:01:11,797 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/data/6e9c3af3b/783644d72b9741018c3762c83e8583a4/FLAG626448362 [2023-11-26 12:01:11,816 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/data/6e9c3af3b/783644d72b9741018c3762c83e8583a4 [2023-11-26 12:01:11,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:01:11,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:01:11,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:01:11,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:01:11,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:01:11,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:11" (1/1) ... [2023-11-26 12:01:11,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cae35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:11, skipping insertion in model container [2023-11-26 12:01:11,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:01:11" (1/1) ... [2023-11-26 12:01:11,892 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:01:12,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:01:12,572 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:01:12,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:01:12,760 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:01:12,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12 WrapperNode [2023-11-26 12:01:12,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:01:12,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:01:12,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:01:12,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:01:12,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:12,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:12,876 INFO L138 Inliner]: procedures = 177, calls = 35, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 295 [2023-11-26 12:01:12,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:01:12,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:01:12,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:01:12,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:01:12,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:12,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:12,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:12,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:12,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:12,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:13,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:13,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:13,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:01:13,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:01:13,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:01:13,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:01:13,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (1/1) ... [2023-11-26 12:01:13,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:01:13,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:01:13,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:01:13,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b4361c-f1ee-4aa6-b4f9-354cf832a127/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:01:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 12:01:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-26 12:01:13,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-26 12:01:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 12:01:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:01:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:01:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:01:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 12:01:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:01:13,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:01:13,143 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:01:13,358 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:01:13,361 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:01:14,173 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:01:14,629 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:01:14,630 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 12:01:14,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:14 BoogieIcfgContainer [2023-11-26 12:01:14,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:01:14,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:01:14,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:01:14,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:01:14,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:01:11" (1/3) ... [2023-11-26 12:01:14,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4585fc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:14, skipping insertion in model container [2023-11-26 12:01:14,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:01:12" (2/3) ... [2023-11-26 12:01:14,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4585fc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:01:14, skipping insertion in model container [2023-11-26 12:01:14,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:01:14" (3/3) ... [2023-11-26 12:01:14,647 INFO L112 eAbstractionObserver]: Analyzing ICFG 25_stack_longer-2-race.i [2023-11-26 12:01:14,659 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 12:01:14,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:01:14,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-11-26 12:01:14,673 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:01:14,791 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:01:14,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 160 transitions, 324 flow [2023-11-26 12:01:14,948 INFO L124 PetriNetUnfolderBase]: 8/171 cut-off events. [2023-11-26 12:01:14,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:01:14,959 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-26 12:01:14,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 160 transitions, 324 flow [2023-11-26 12:01:14,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 160 transitions, 324 flow [2023-11-26 12:01:14,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:01:14,997 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;@3665372c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:01:14,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-26 12:01:15,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:01:15,011 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-11-26 12:01:15,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:01:15,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:15,013 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-26 12:01:15,013 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-26 12:01:15,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1150451208, now seen corresponding path program 1 times [2023-11-26 12:01:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188338988] [2023-11-26 12:01:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:15,681 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-26 12:01:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:15,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188338988] [2023-11-26 12:01:15,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188338988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:15,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:15,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:01:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835109118] [2023-11-26 12:01:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:15,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:01:15,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:15,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:01:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:01:15,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 160 [2023-11-26 12:01:15,744 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-26 12:01:15,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:15,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 160 [2023-11-26 12:01:15,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:15,849 INFO L124 PetriNetUnfolderBase]: 4/139 cut-off events. [2023-11-26 12:01:15,849 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 12:01:15,850 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-26 12:01:15,852 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 9 selfloop transitions, 0 changer transitions 0/135 dead transitions. [2023-11-26 12:01:15,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 292 flow [2023-11-26 12:01:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:01:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 12:01:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2023-11-26 12:01:15,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9125 [2023-11-26 12:01:15,870 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 292 transitions. [2023-11-26 12:01:15,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions. [2023-11-26 12:01:15,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:15,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions. [2023-11-26 12:01:15,879 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-26 12:01:15,885 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-26 12:01:15,886 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-26 12:01:15,888 INFO L175 Difference]: Start difference. First operand has 156 places, 160 transitions, 324 flow. Second operand 2 states and 292 transitions. [2023-11-26 12:01:15,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 292 flow [2023-11-26 12:01:15,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:15,897 INFO L231 Difference]: Finished difference. Result has 135 places, 135 transitions, 274 flow [2023-11-26 12:01:15,899 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-26 12:01:15,904 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, -21 predicate places. [2023-11-26 12:01:15,904 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 135 transitions, 274 flow [2023-11-26 12:01:15,905 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-26 12:01:15,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:15,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:15,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:01:15,906 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-26 12:01:15,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1777045675, now seen corresponding path program 1 times [2023-11-26 12:01:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:15,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095708010] [2023-11-26 12:01:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:15,988 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-26 12:01:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095708010] [2023-11-26 12:01:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095708010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:15,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:15,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943908123] [2023-11-26 12:01:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:15,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:15,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:15,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:16,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2023-11-26 12:01:16,007 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-26 12:01:16,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:16,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2023-11-26 12:01:16,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:16,104 INFO L124 PetriNetUnfolderBase]: 6/224 cut-off events. [2023-11-26 12:01:16,104 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 12:01:16,105 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-26 12:01:16,148 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 17 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2023-11-26 12:01:16,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 141 transitions, 324 flow [2023-11-26 12:01:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-11-26 12:01:16,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2023-11-26 12:01:16,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-11-26 12:01:16,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-11-26 12:01:16,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:16,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-11-26 12:01:16,155 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-26 12:01:16,158 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-26 12:01:16,159 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-26 12:01:16,159 INFO L175 Difference]: Start difference. First operand has 135 places, 135 transitions, 274 flow. Second operand 3 states and 404 transitions. [2023-11-26 12:01:16,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 141 transitions, 324 flow [2023-11-26 12:01:16,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:16,164 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 276 flow [2023-11-26 12:01:16,165 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-26 12:01:16,166 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, -20 predicate places. [2023-11-26 12:01:16,166 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 276 flow [2023-11-26 12:01:16,167 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-26 12:01:16,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:16,167 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-26 12:01:16,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:01:16,168 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-26 12:01:16,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1278672196, now seen corresponding path program 1 times [2023-11-26 12:01:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:16,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142727316] [2023-11-26 12:01:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:16,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:16,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:16,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:16,224 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:01:16,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2023-11-26 12:01:16,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2023-11-26 12:01:16,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2023-11-26 12:01:16,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2023-11-26 12:01:16,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2023-11-26 12:01:16,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2023-11-26 12:01:16,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2023-11-26 12:01:16,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2023-11-26 12:01:16,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2023-11-26 12:01:16,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2023-11-26 12:01:16,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2023-11-26 12:01:16,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2023-11-26 12:01:16,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2023-11-26 12:01:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2023-11-26 12:01:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2023-11-26 12:01:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2023-11-26 12:01:16,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2023-11-26 12:01:16,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2023-11-26 12:01:16,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2023-11-26 12:01:16,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2023-11-26 12:01:16,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2023-11-26 12:01:16,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2023-11-26 12:01:16,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2023-11-26 12:01:16,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2023-11-26 12:01:16,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2023-11-26 12:01:16,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2023-11-26 12:01:16,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2023-11-26 12:01:16,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2023-11-26 12:01:16,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2023-11-26 12:01:16,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2023-11-26 12:01:16,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2023-11-26 12:01:16,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2023-11-26 12:01:16,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2023-11-26 12:01:16,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2023-11-26 12:01:16,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2023-11-26 12:01:16,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2023-11-26 12:01:16,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2023-11-26 12:01:16,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2023-11-26 12:01:16,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2023-11-26 12:01:16,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2023-11-26 12:01:16,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2023-11-26 12:01:16,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2023-11-26 12:01:16,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2023-11-26 12:01:16,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2023-11-26 12:01:16,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2023-11-26 12:01:16,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2023-11-26 12:01:16,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2023-11-26 12:01:16,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2023-11-26 12:01:16,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2023-11-26 12:01:16,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2023-11-26 12:01:16,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2023-11-26 12:01:16,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2023-11-26 12:01:16,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2023-11-26 12:01:16,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:01:16,245 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-26 12:01:16,248 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 12:01:16,248 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 12:01:16,393 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:01:16,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 287 transitions, 584 flow [2023-11-26 12:01:16,527 INFO L124 PetriNetUnfolderBase]: 15/311 cut-off events. [2023-11-26 12:01:16,527 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 12:01:16,538 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-26 12:01:16,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 287 transitions, 584 flow [2023-11-26 12:01:16,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 287 transitions, 584 flow [2023-11-26 12:01:16,552 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:01:16,553 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;@3665372c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:01:16,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2023-11-26 12:01:16,560 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:01:16,560 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2023-11-26 12:01:16,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:01:16,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:16,561 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-26 12:01:16,561 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-26 12:01:16,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash -673732314, now seen corresponding path program 1 times [2023-11-26 12:01:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422701271] [2023-11-26 12:01:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:16,837 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-26 12:01:16,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:16,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422701271] [2023-11-26 12:01:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422701271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:16,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:16,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:01:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896033969] [2023-11-26 12:01:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:16,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:01:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:01:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:01:16,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 287 [2023-11-26 12:01:16,849 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-26 12:01:16,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:16,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 287 [2023-11-26 12:01:16,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:17,367 INFO L124 PetriNetUnfolderBase]: 112/1266 cut-off events. [2023-11-26 12:01:17,368 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-26 12:01:17,376 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-26 12:01:17,387 INFO L140 encePairwiseOnDemand]: 251/287 looper letters, 18 selfloop transitions, 0 changer transitions 0/244 dead transitions. [2023-11-26 12:01:17,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 244 transitions, 534 flow [2023-11-26 12:01:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:01:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 12:01:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 520 transitions. [2023-11-26 12:01:17,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9059233449477352 [2023-11-26 12:01:17,396 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 520 transitions. [2023-11-26 12:01:17,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 520 transitions. [2023-11-26 12:01:17,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:17,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 520 transitions. [2023-11-26 12:01:17,401 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-26 12:01:17,406 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-26 12:01:17,407 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-26 12:01:17,407 INFO L175 Difference]: Start difference. First operand has 279 places, 287 transitions, 584 flow. Second operand 2 states and 520 transitions. [2023-11-26 12:01:17,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 244 transitions, 534 flow [2023-11-26 12:01:17,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 244 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:17,426 INFO L231 Difference]: Finished difference. Result has 242 places, 244 transitions, 498 flow [2023-11-26 12:01:17,428 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-26 12:01:17,432 INFO L281 CegarLoopForPetriNet]: 279 programPoint places, -37 predicate places. [2023-11-26 12:01:17,436 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 244 transitions, 498 flow [2023-11-26 12:01:17,437 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-26 12:01:17,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:17,438 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-26 12:01:17,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:01:17,440 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-26 12:01:17,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:17,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1083351017, now seen corresponding path program 1 times [2023-11-26 12:01:17,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:17,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809723696] [2023-11-26 12:01:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:17,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:17,512 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-26 12:01:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809723696] [2023-11-26 12:01:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809723696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:17,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:17,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:17,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607616708] [2023-11-26 12:01:17,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:17,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:17,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:17,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:17,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 287 [2023-11-26 12:01:17,552 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-26 12:01:17,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:17,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 287 [2023-11-26 12:01:17,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:18,558 INFO L124 PetriNetUnfolderBase]: 366/3572 cut-off events. [2023-11-26 12:01:18,559 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-26 12:01:18,578 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-26 12:01:18,605 INFO L140 encePairwiseOnDemand]: 279/287 looper letters, 43 selfloop transitions, 6 changer transitions 0/267 dead transitions. [2023-11-26 12:01:18,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 267 transitions, 647 flow [2023-11-26 12:01:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2023-11-26 12:01:18,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8432055749128919 [2023-11-26 12:01:18,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 726 transitions. [2023-11-26 12:01:18,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 726 transitions. [2023-11-26 12:01:18,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:18,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 726 transitions. [2023-11-26 12:01:18,614 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-26 12:01:18,618 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-26 12:01:18,619 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-26 12:01:18,620 INFO L175 Difference]: Start difference. First operand has 242 places, 244 transitions, 498 flow. Second operand 3 states and 726 transitions. [2023-11-26 12:01:18,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 267 transitions, 647 flow [2023-11-26 12:01:18,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 267 transitions, 647 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:18,628 INFO L231 Difference]: Finished difference. Result has 246 places, 250 transitions, 550 flow [2023-11-26 12:01:18,629 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-26 12:01:18,632 INFO L281 CegarLoopForPetriNet]: 279 programPoint places, -33 predicate places. [2023-11-26 12:01:18,632 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 250 transitions, 550 flow [2023-11-26 12:01:18,633 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-26 12:01:18,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:18,633 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-26 12:01:18,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:01:18,634 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-26 12:01:18,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1676275495, now seen corresponding path program 1 times [2023-11-26 12:01:18,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:18,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977161300] [2023-11-26 12:01:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:18,689 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-26 12:01:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977161300] [2023-11-26 12:01:18,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977161300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:18,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:18,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338560512] [2023-11-26 12:01:18,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:18,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:18,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:18,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 287 [2023-11-26 12:01:18,753 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-26 12:01:18,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:18,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 287 [2023-11-26 12:01:18,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:20,160 INFO L124 PetriNetUnfolderBase]: 674/4772 cut-off events. [2023-11-26 12:01:20,161 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-26 12:01:20,195 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-26 12:01:20,236 INFO L140 encePairwiseOnDemand]: 279/287 looper letters, 37 selfloop transitions, 7 changer transitions 0/264 dead transitions. [2023-11-26 12:01:20,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 264 transitions, 671 flow [2023-11-26 12:01:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2023-11-26 12:01:20,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8222996515679443 [2023-11-26 12:01:20,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 708 transitions. [2023-11-26 12:01:20,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 708 transitions. [2023-11-26 12:01:20,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:20,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 708 transitions. [2023-11-26 12:01:20,245 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-26 12:01:20,248 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-26 12:01:20,249 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-26 12:01:20,250 INFO L175 Difference]: Start difference. First operand has 246 places, 250 transitions, 550 flow. Second operand 3 states and 708 transitions. [2023-11-26 12:01:20,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 264 transitions, 671 flow [2023-11-26 12:01:20,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 264 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:20,259 INFO L231 Difference]: Finished difference. Result has 248 places, 256 transitions, 592 flow [2023-11-26 12:01:20,260 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-26 12:01:20,261 INFO L281 CegarLoopForPetriNet]: 279 programPoint places, -31 predicate places. [2023-11-26 12:01:20,262 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 256 transitions, 592 flow [2023-11-26 12:01:20,262 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-26 12:01:20,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:20,263 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-26 12:01:20,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:01:20,264 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-26 12:01:20,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash -98223325, now seen corresponding path program 1 times [2023-11-26 12:01:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:20,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813287054] [2023-11-26 12:01:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:20,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:01:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:01:20,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:01:20,302 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:01:20,302 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2023-11-26 12:01:20,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2023-11-26 12:01:20,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2023-11-26 12:01:20,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2023-11-26 12:01:20,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2023-11-26 12:01:20,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2023-11-26 12:01:20,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2023-11-26 12:01:20,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2023-11-26 12:01:20,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2023-11-26 12:01:20,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2023-11-26 12:01:20,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2023-11-26 12:01:20,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2023-11-26 12:01:20,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2023-11-26 12:01:20,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2023-11-26 12:01:20,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2023-11-26 12:01:20,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2023-11-26 12:01:20,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2023-11-26 12:01:20,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2023-11-26 12:01:20,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2023-11-26 12:01:20,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2023-11-26 12:01:20,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2023-11-26 12:01:20,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2023-11-26 12:01:20,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2023-11-26 12:01:20,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2023-11-26 12:01:20,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2023-11-26 12:01:20,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2023-11-26 12:01:20,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2023-11-26 12:01:20,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2023-11-26 12:01:20,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2023-11-26 12:01:20,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2023-11-26 12:01:20,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2023-11-26 12:01:20,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2023-11-26 12:01:20,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2023-11-26 12:01:20,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2023-11-26 12:01:20,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2023-11-26 12:01:20,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2023-11-26 12:01:20,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2023-11-26 12:01:20,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2023-11-26 12:01:20,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2023-11-26 12:01:20,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2023-11-26 12:01:20,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2023-11-26 12:01:20,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2023-11-26 12:01:20,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2023-11-26 12:01:20,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2023-11-26 12:01:20,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2023-11-26 12:01:20,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2023-11-26 12:01:20,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2023-11-26 12:01:20,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2023-11-26 12:01:20,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2023-11-26 12:01:20,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2023-11-26 12:01:20,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2023-11-26 12:01:20,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2023-11-26 12:01:20,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2023-11-26 12:01:20,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2023-11-26 12:01:20,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2023-11-26 12:01:20,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2023-11-26 12:01:20,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2023-11-26 12:01:20,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2023-11-26 12:01:20,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2023-11-26 12:01:20,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2023-11-26 12:01:20,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2023-11-26 12:01:20,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2023-11-26 12:01:20,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2023-11-26 12:01:20,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2023-11-26 12:01:20,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2023-11-26 12:01:20,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2023-11-26 12:01:20,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2023-11-26 12:01:20,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2023-11-26 12:01:20,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2023-11-26 12:01:20,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2023-11-26 12:01:20,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2023-11-26 12:01:20,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2023-11-26 12:01:20,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2023-11-26 12:01:20,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2023-11-26 12:01:20,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2023-11-26 12:01:20,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2023-11-26 12:01:20,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2023-11-26 12:01:20,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2023-11-26 12:01:20,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2023-11-26 12:01:20,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:01:20,325 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 12:01:20,326 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 12:01:20,326 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 12:01:20,534 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:01:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 414 transitions, 846 flow [2023-11-26 12:01:20,690 INFO L124 PetriNetUnfolderBase]: 22/451 cut-off events. [2023-11-26 12:01:20,690 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 12:01:20,703 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-26 12:01:20,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 402 places, 414 transitions, 846 flow [2023-11-26 12:01:20,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 402 places, 414 transitions, 846 flow [2023-11-26 12:01:20,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:01:20,718 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;@3665372c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:01:20,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-11-26 12:01:20,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:01:20,722 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2023-11-26 12:01:20,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:01:20,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:20,723 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-26 12:01:20,723 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-26 12:01:20,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash 570753764, now seen corresponding path program 1 times [2023-11-26 12:01:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:20,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052789695] [2023-11-26 12:01:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:20,903 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-26 12:01:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052789695] [2023-11-26 12:01:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052789695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:01:20,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244781162] [2023-11-26 12:01:20,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:20,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:01:20,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:20,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:01:20,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:01:20,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 414 [2023-11-26 12:01:20,910 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-26 12:01:20,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:20,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 414 [2023-11-26 12:01:20,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:24,465 INFO L124 PetriNetUnfolderBase]: 1750/12058 cut-off events. [2023-11-26 12:01:24,466 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2023-11-26 12:01:24,608 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-26 12:01:24,708 INFO L140 encePairwiseOnDemand]: 361/414 looper letters, 27 selfloop transitions, 0 changer transitions 0/353 dead transitions. [2023-11-26 12:01:24,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 353 transitions, 778 flow [2023-11-26 12:01:24,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:01:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 12:01:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 748 transitions. [2023-11-26 12:01:24,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2023-11-26 12:01:24,713 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 748 transitions. [2023-11-26 12:01:24,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 748 transitions. [2023-11-26 12:01:24,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:24,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 748 transitions. [2023-11-26 12:01:24,718 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-26 12:01:24,721 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-26 12:01:24,723 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-26 12:01:24,723 INFO L175 Difference]: Start difference. First operand has 402 places, 414 transitions, 846 flow. Second operand 2 states and 748 transitions. [2023-11-26 12:01:24,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 353 transitions, 778 flow [2023-11-26 12:01:24,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 353 transitions, 776 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:24,735 INFO L231 Difference]: Finished difference. Result has 349 places, 353 transitions, 722 flow [2023-11-26 12:01:24,736 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-26 12:01:24,737 INFO L281 CegarLoopForPetriNet]: 402 programPoint places, -53 predicate places. [2023-11-26 12:01:24,737 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 353 transitions, 722 flow [2023-11-26 12:01:24,738 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-26 12:01:24,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:24,738 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-26 12:01:24,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:01:24,739 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-26 12:01:24,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1261390361, now seen corresponding path program 1 times [2023-11-26 12:01:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:24,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127220665] [2023-11-26 12:01:24,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:24,791 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-26 12:01:24,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:24,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127220665] [2023-11-26 12:01:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127220665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765657422] [2023-11-26 12:01:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:24,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:24,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:24,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:24,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 414 [2023-11-26 12:01:24,831 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-26 12:01:24,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:24,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 414 [2023-11-26 12:01:24,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:35,835 INFO L124 PetriNetUnfolderBase]: 9390/54554 cut-off events. [2023-11-26 12:01:35,835 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2023-11-26 12:01:36,325 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-26 12:01:36,730 INFO L140 encePairwiseOnDemand]: 402/414 looper letters, 65 selfloop transitions, 9 changer transitions 0/388 dead transitions. [2023-11-26 12:01:36,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 388 transitions, 950 flow [2023-11-26 12:01:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1043 transitions. [2023-11-26 12:01:36,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8397745571658615 [2023-11-26 12:01:36,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1043 transitions. [2023-11-26 12:01:36,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1043 transitions. [2023-11-26 12:01:36,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:36,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1043 transitions. [2023-11-26 12:01:36,741 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-26 12:01:36,746 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-26 12:01:36,749 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-26 12:01:36,749 INFO L175 Difference]: Start difference. First operand has 349 places, 353 transitions, 722 flow. Second operand 3 states and 1043 transitions. [2023-11-26 12:01:36,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 388 transitions, 950 flow [2023-11-26 12:01:36,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 388 transitions, 950 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:36,767 INFO L231 Difference]: Finished difference. Result has 353 places, 362 transitions, 800 flow [2023-11-26 12:01:36,768 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-26 12:01:36,770 INFO L281 CegarLoopForPetriNet]: 402 programPoint places, -49 predicate places. [2023-11-26 12:01:36,770 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 362 transitions, 800 flow [2023-11-26 12:01:36,771 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-26 12:01:36,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:36,771 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-26 12:01:36,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:01:36,772 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-26 12:01:36,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1046175175, now seen corresponding path program 1 times [2023-11-26 12:01:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12235071] [2023-11-26 12:01:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:36,845 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-26 12:01:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12235071] [2023-11-26 12:01:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12235071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:36,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:36,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:36,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517997883] [2023-11-26 12:01:36,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:36,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:36,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:36,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 414 [2023-11-26 12:01:36,919 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-26 12:01:36,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:36,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 414 [2023-11-26 12:01:36,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:39,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:39,412 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 12:01:39,412 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-26 12:01:39,412 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 12:01:39,413 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-26 12:01:39,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:39,540 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 12:01:39,540 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 12:01:39,540 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-26 12:01:39,540 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-26 12:01:41,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:41,983 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-26 12:01:41,984 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-26 12:01:41,984 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-26 12:01:41,984 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-26 12:01:42,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:42,317 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-26 12:01:42,317 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-26 12:01:42,318 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-26 12:01:42,318 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-26 12:01:42,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:42,961 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-26 12:01:42,961 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-26 12:01:42,961 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-26 12:01:42,961 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-26 12:01:43,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:43,192 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-26 12:01:43,192 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-26 12:01:43,192 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-26 12:01:43,193 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-26 12:01:45,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:45,749 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-26 12:01:45,749 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-26 12:01:45,750 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-26 12:01:45,750 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-26 12:01:45,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:45,888 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-26 12:01:45,888 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 12:01:45,888 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 12:01:45,888 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 12:01:45,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:45,889 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-26 12:01:45,890 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 12:01:45,890 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 12:01:45,890 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 12:01:46,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:46,028 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-26 12:01:46,028 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 12:01:46,028 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-26 12:01:46,028 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 12:01:47,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:47,938 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-11-26 12:01:47,938 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-26 12:01:47,938 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 12:01:47,938 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 12:01:48,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:48,079 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-26 12:01:48,079 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:01:48,079 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-26 12:01:48,079 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-26 12:01:48,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:48,357 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-26 12:01:48,357 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-26 12:01:48,357 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-26 12:01:48,357 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-26 12:01:48,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1588] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:48,505 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-26 12:01:48,505 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 12:01:48,505 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 12:01:48,505 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-26 12:01:53,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1840] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:53,415 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-26 12:01:53,415 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-26 12:01:53,415 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:01:53,415 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:01:53,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1840] L766-->L766-3: Formula: (let ((.cse5 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse4 (select |v_#memory_int_427| |v_~#m2~0.base_21|)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse0 (select .cse5 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (store |v_#memory_int_427| |v_~#m2~0.base_21| (store .cse4 |v_~#m2~0.offset_21| 0)) |v_#memory_int_426|) (= .cse0 (select .cse5 .cse2)) (not (= (ite (= 1 (select .cse4 |v_~#m2~0.offset_21|)) 1 0) 0)) (= (select .cse5 .cse1) .cse0) (= .cse0 (select .cse5 .cse3))))) InVars {#race=|v_#race_733|, #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_731|, 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-26 12:01:53,650 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-26 12:01:53,650 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 12:01:53,651 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 12:01:53,651 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-26 12:01:55,395 INFO L124 PetriNetUnfolderBase]: 21187/99402 cut-off events. [2023-11-26 12:01:55,395 INFO L125 PetriNetUnfolderBase]: For 1890/1890 co-relation queries the response was YES. [2023-11-26 12:01:56,289 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-26 12:01:57,250 INFO L140 encePairwiseOnDemand]: 402/414 looper letters, 57 selfloop transitions, 11 changer transitions 0/388 dead transitions. [2023-11-26 12:01:57,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 388 transitions, 998 flow [2023-11-26 12:01:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1026 transitions. [2023-11-26 12:01:57,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8260869565217391 [2023-11-26 12:01:57,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1026 transitions. [2023-11-26 12:01:57,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1026 transitions. [2023-11-26 12:01:57,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:57,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1026 transitions. [2023-11-26 12:01:57,261 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-26 12:01:57,264 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-26 12:01:57,265 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-26 12:01:57,265 INFO L175 Difference]: Start difference. First operand has 353 places, 362 transitions, 800 flow. Second operand 3 states and 1026 transitions. [2023-11-26 12:01:57,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 388 transitions, 998 flow [2023-11-26 12:01:57,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 388 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:57,288 INFO L231 Difference]: Finished difference. Result has 355 places, 372 transitions, 868 flow [2023-11-26 12:01:57,289 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-26 12:01:57,290 INFO L281 CegarLoopForPetriNet]: 402 programPoint places, -47 predicate places. [2023-11-26 12:01:57,290 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 372 transitions, 868 flow [2023-11-26 12:01:57,290 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-26 12:01:57,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:57,291 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-26 12:01:57,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:01:57,291 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-26 12:01:57,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1546813968, now seen corresponding path program 1 times [2023-11-26 12:01:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736695524] [2023-11-26 12:01:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:57,328 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-26 12:01:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736695524] [2023-11-26 12:01:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736695524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620185554] [2023-11-26 12:01:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:57,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:57,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:57,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 414 [2023-11-26 12:01:57,364 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-26 12:01:57,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:57,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 414 [2023-11-26 12:01:57,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:01,677 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-26 12:02:01,678 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-26 12:02:01,678 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-26 12:02:01,678 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-26 12:02:01,678 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event