./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.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_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:13:26,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:13:26,224 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:13:26,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:13:26,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:13:26,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:13:26,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:13:26,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:13:26,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:13:26,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:13:26,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:13:26,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:13:26,257 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:13:26,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:13:26,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:13:26,259 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:13:26,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:13:26,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:13:26,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:13:26,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:13:26,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:13:26,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:13:26,265 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:13:26,266 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:13:26,266 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:13:26,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:13:26,267 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:13:26,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:13:26,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:13:26,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:13:26,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:13:26,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:13:26,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:13:26,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:13:26,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:13:26,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:13:26,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:13:26,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:13:26,270 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:13:26,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:13:26,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:13:26,271 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_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 [2023-11-29 00:13:26,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:13:26,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:13:26,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:13:26,520 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:13:26,520 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:13:26,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2023-11-29 00:13:29,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:13:29,456 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:13:29,457 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2023-11-29 00:13:29,472 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/data/e4330664b/d989fbdc32774975b8104eada326ce1e/FLAGdcecde62c [2023-11-29 00:13:29,486 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/data/e4330664b/d989fbdc32774975b8104eada326ce1e [2023-11-29 00:13:29,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:13:29,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:13:29,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:13:29,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:13:29,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:13:29,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:29,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202d35da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29, skipping insertion in model container [2023-11-29 00:13:29,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:29,538 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:13:29,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:13:29,850 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:13:29,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:13:29,927 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:13:29,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29 WrapperNode [2023-11-29 00:13:29,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:13:29,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:13:29,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:13:29,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:13:29,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:29,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:29,978 INFO L138 Inliner]: procedures = 169, calls = 20, calls flagged for inlining = 6, calls inlined = 9, statements flattened = 186 [2023-11-29 00:13:29,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:13:29,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:13:29,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:13:29,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:13:29,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:29,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:29,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:29,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:30,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:30,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:30,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:30,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:30,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:13:30,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:13:30,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:13:30,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:13:30,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (1/1) ... [2023-11-29 00:13:30,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:13:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:13:30,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:13:30,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6db710ba-381a-4044-8bd5-60117e57b607/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:13:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:13:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-29 00:13:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-29 00:13:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:13:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:13:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:13:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:13:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 00:13:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:13:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:13:30,090 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:13:30,231 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:13:30,233 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:13:30,512 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:13:30,649 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:13:30,649 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 00:13:30,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:13:30 BoogieIcfgContainer [2023-11-29 00:13:30,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:13:30,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:13:30,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:13:30,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:13:30,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:13:29" (1/3) ... [2023-11-29 00:13:30,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ac2226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:13:30, skipping insertion in model container [2023-11-29 00:13:30,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:13:29" (2/3) ... [2023-11-29 00:13:30,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ac2226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:13:30, skipping insertion in model container [2023-11-29 00:13:30,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:13:30" (3/3) ... [2023-11-29 00:13:30,658 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-b.i [2023-11-29 00:13:30,665 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:13:30,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:13:30,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-29 00:13:30,673 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:13:30,724 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:13:30,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 162 transitions, 328 flow [2023-11-29 00:13:30,859 INFO L124 PetriNetUnfolderBase]: 14/246 cut-off events. [2023-11-29 00:13:30,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:13:30,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 246 events. 14/246 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 817 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 148. Up to 4 conditions per place. [2023-11-29 00:13:30,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 162 transitions, 328 flow [2023-11-29 00:13:30,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 162 transitions, 328 flow [2023-11-29 00:13:30,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:13:30,889 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;@2132b0fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:13:30,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-11-29 00:13:30,896 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:13:30,896 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-11-29 00:13:30,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:13:30,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:30,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:30,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2023-11-29 00:13:30,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1371706857, now seen corresponding path program 1 times [2023-11-29 00:13:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594201543] [2023-11-29 00:13:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:31,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:31,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594201543] [2023-11-29 00:13:31,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594201543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:31,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:31,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:13:31,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076573822] [2023-11-29 00:13:31,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:31,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:13:31,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:31,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:13:31,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:13:31,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 162 [2023-11-29 00:13:31,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 162 transitions, 328 flow. Second operand has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:31,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:31,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 162 [2023-11-29 00:13:31,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:31,167 INFO L124 PetriNetUnfolderBase]: 5/261 cut-off events. [2023-11-29 00:13:31,167 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 00:13:31,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 261 events. 5/261 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 785 event pairs, 1 based on Foata normal form. 16/238 useless extension candidates. Maximal degree in co-relation 179. Up to 7 conditions per place. [2023-11-29 00:13:31,172 INFO L140 encePairwiseOnDemand]: 145/162 looper letters, 3 selfloop transitions, 0 changer transitions 0/139 dead transitions. [2023-11-29 00:13:31,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 288 flow [2023-11-29 00:13:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:13:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 00:13:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 300 transitions. [2023-11-29 00:13:31,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2023-11-29 00:13:31,185 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 300 transitions. [2023-11-29 00:13:31,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 300 transitions. [2023-11-29 00:13:31,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:31,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 300 transitions. [2023-11-29 00:13:31,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 150.0) internal successors, (300), 2 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:31,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:31,198 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:31,200 INFO L175 Difference]: Start difference. First operand has 156 places, 162 transitions, 328 flow. Second operand 2 states and 300 transitions. [2023-11-29 00:13:31,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 288 flow [2023-11-29 00:13:31,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 139 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:13:31,207 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 282 flow [2023-11-29 00:13:31,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=282, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2023-11-29 00:13:31,212 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, -15 predicate places. [2023-11-29 00:13:31,212 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 282 flow [2023-11-29 00:13:31,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:31,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:31,213 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-29 00:13:31,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:13:31,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2023-11-29 00:13:31,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1292326996, now seen corresponding path program 1 times [2023-11-29 00:13:31,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:31,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406312379] [2023-11-29 00:13:31,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:31,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:31,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406312379] [2023-11-29 00:13:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406312379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:31,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:31,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:13:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332050502] [2023-11-29 00:13:31,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:31,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:13:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:31,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:13:31,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:13:31,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 162 [2023-11-29 00:13:31,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:31,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:31,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 162 [2023-11-29 00:13:31,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:32,030 INFO L124 PetriNetUnfolderBase]: 28/773 cut-off events. [2023-11-29 00:13:32,031 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 00:13:32,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 773 events. 28/773 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4329 event pairs, 5 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 839. Up to 36 conditions per place. [2023-11-29 00:13:32,039 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 16 selfloop transitions, 10 changer transitions 0/152 dead transitions. [2023-11-29 00:13:32,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 152 transitions, 360 flow [2023-11-29 00:13:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:13:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:13:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 807 transitions. [2023-11-29 00:13:32,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8302469135802469 [2023-11-29 00:13:32,045 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 807 transitions. [2023-11-29 00:13:32,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 807 transitions. [2023-11-29 00:13:32,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:32,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 807 transitions. [2023-11-29 00:13:32,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,054 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,055 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 282 flow. Second operand 6 states and 807 transitions. [2023-11-29 00:13:32,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 152 transitions, 360 flow [2023-11-29 00:13:32,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 152 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:13:32,060 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 358 flow [2023-11-29 00:13:32,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2023-11-29 00:13:32,061 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, -5 predicate places. [2023-11-29 00:13:32,062 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 358 flow [2023-11-29 00:13:32,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:32,063 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] [2023-11-29 00:13:32,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:13:32,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2023-11-29 00:13:32,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:32,064 INFO L85 PathProgramCache]: Analyzing trace with hash -367454083, now seen corresponding path program 1 times [2023-11-29 00:13:32,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:32,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063866767] [2023-11-29 00:13:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:32,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:32,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063866767] [2023-11-29 00:13:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063866767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:32,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:13:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048965203] [2023-11-29 00:13:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:32,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:13:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:13:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:13:32,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 162 [2023-11-29 00:13:32,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:32,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 162 [2023-11-29 00:13:32,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:32,674 INFO L124 PetriNetUnfolderBase]: 35/934 cut-off events. [2023-11-29 00:13:32,674 INFO L125 PetriNetUnfolderBase]: For 37/44 co-relation queries the response was YES. [2023-11-29 00:13:32,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 934 events. 35/934 cut-off events. For 37/44 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6446 event pairs, 4 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 1182. Up to 43 conditions per place. [2023-11-29 00:13:32,683 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 18 selfloop transitions, 10 changer transitions 0/162 dead transitions. [2023-11-29 00:13:32,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 162 transitions, 440 flow [2023-11-29 00:13:32,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:13:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:13:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-11-29 00:13:32,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8405349794238683 [2023-11-29 00:13:32,687 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-11-29 00:13:32,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-11-29 00:13:32,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:32,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-11-29 00:13:32,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,695 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,695 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 358 flow. Second operand 6 states and 817 transitions. [2023-11-29 00:13:32,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 162 transitions, 440 flow [2023-11-29 00:13:32,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:13:32,703 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 434 flow [2023-11-29 00:13:32,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2023-11-29 00:13:32,704 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, 5 predicate places. [2023-11-29 00:13:32,704 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 434 flow [2023-11-29 00:13:32,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:32,706 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:32,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:13:32,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2023-11-29 00:13:32,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash -434858555, now seen corresponding path program 1 times [2023-11-29 00:13:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343495275] [2023-11-29 00:13:32,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:32,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:13:32,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:13:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:13:32,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:13:32,753 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:13:32,754 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2023-11-29 00:13:32,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2023-11-29 00:13:32,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2023-11-29 00:13:32,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2023-11-29 00:13:32,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2023-11-29 00:13:32,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2023-11-29 00:13:32,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2023-11-29 00:13:32,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2023-11-29 00:13:32,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2023-11-29 00:13:32,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2023-11-29 00:13:32,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2023-11-29 00:13:32,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2023-11-29 00:13:32,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2023-11-29 00:13:32,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2023-11-29 00:13:32,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2023-11-29 00:13:32,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2023-11-29 00:13:32,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2023-11-29 00:13:32,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2023-11-29 00:13:32,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2023-11-29 00:13:32,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2023-11-29 00:13:32,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2023-11-29 00:13:32,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2023-11-29 00:13:32,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2023-11-29 00:13:32,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2023-11-29 00:13:32,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2023-11-29 00:13:32,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2023-11-29 00:13:32,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2023-11-29 00:13:32,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2023-11-29 00:13:32,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2023-11-29 00:13:32,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2023-11-29 00:13:32,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2023-11-29 00:13:32,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2023-11-29 00:13:32,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2023-11-29 00:13:32,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2023-11-29 00:13:32,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2023-11-29 00:13:32,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2023-11-29 00:13:32,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2023-11-29 00:13:32,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:13:32,764 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 00:13:32,766 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:13:32,766 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 00:13:32,809 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:13:32,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 225 transitions, 460 flow [2023-11-29 00:13:32,877 INFO L124 PetriNetUnfolderBase]: 23/395 cut-off events. [2023-11-29 00:13:32,877 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 00:13:32,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 395 events. 23/395 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1720 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 247. Up to 6 conditions per place. [2023-11-29 00:13:32,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 225 transitions, 460 flow [2023-11-29 00:13:32,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 225 transitions, 460 flow [2023-11-29 00:13:32,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:13:32,889 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;@2132b0fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:13:32,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-11-29 00:13:32,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:13:32,893 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-11-29 00:13:32,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:13:32,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:32,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:32,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:13:32,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash 453008810, now seen corresponding path program 1 times [2023-11-29 00:13:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143251934] [2023-11-29 00:13:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:32,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:32,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143251934] [2023-11-29 00:13:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143251934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:32,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:13:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924706238] [2023-11-29 00:13:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:32,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:13:32,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:32,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:13:32,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:13:32,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 225 [2023-11-29 00:13:32,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 225 transitions, 460 flow. Second operand has 2 states, 2 states have (on average 193.0) internal successors, (386), 2 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:32,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:32,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 225 [2023-11-29 00:13:32,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:33,039 INFO L124 PetriNetUnfolderBase]: 18/638 cut-off events. [2023-11-29 00:13:33,039 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 00:13:33,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 638 events. 18/638 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3560 event pairs, 7 based on Foata normal form. 46/577 useless extension candidates. Maximal degree in co-relation 389. Up to 21 conditions per place. [2023-11-29 00:13:33,047 INFO L140 encePairwiseOnDemand]: 200/225 looper letters, 5 selfloop transitions, 0 changer transitions 0/191 dead transitions. [2023-11-29 00:13:33,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 191 transitions, 402 flow [2023-11-29 00:13:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:13:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 00:13:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 414 transitions. [2023-11-29 00:13:33,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.92 [2023-11-29 00:13:33,050 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 414 transitions. [2023-11-29 00:13:33,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 414 transitions. [2023-11-29 00:13:33,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:33,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 414 transitions. [2023-11-29 00:13:33,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 207.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,054 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,054 INFO L175 Difference]: Start difference. First operand has 217 places, 225 transitions, 460 flow. Second operand 2 states and 414 transitions. [2023-11-29 00:13:33,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 191 transitions, 402 flow [2023-11-29 00:13:33,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 191 transitions, 402 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:13:33,060 INFO L231 Difference]: Finished difference. Result has 194 places, 191 transitions, 392 flow [2023-11-29 00:13:33,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=392, PETRI_PLACES=194, PETRI_TRANSITIONS=191} [2023-11-29 00:13:33,061 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -23 predicate places. [2023-11-29 00:13:33,061 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 191 transitions, 392 flow [2023-11-29 00:13:33,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 193.0) internal successors, (386), 2 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:33,062 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-29 00:13:33,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:13:33,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:13:33,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:33,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2099344876, now seen corresponding path program 1 times [2023-11-29 00:13:33,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:33,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577494610] [2023-11-29 00:13:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:33,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:33,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577494610] [2023-11-29 00:13:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577494610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:33,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:13:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634619315] [2023-11-29 00:13:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:33,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:13:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:33,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:13:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:13:33,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 225 [2023-11-29 00:13:33,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 191 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:33,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 225 [2023-11-29 00:13:33,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:33,932 INFO L124 PetriNetUnfolderBase]: 134/2690 cut-off events. [2023-11-29 00:13:33,932 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 00:13:33,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2914 conditions, 2690 events. 134/2690 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 24145 event pairs, 33 based on Foata normal form. 0/2223 useless extension candidates. Maximal degree in co-relation 2909. Up to 141 conditions per place. [2023-11-29 00:13:33,964 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 18 selfloop transitions, 14 changer transitions 0/208 dead transitions. [2023-11-29 00:13:33,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 208 transitions, 490 flow [2023-11-29 00:13:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:13:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:13:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1125 transitions. [2023-11-29 00:13:33,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-29 00:13:33,969 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1125 transitions. [2023-11-29 00:13:33,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1125 transitions. [2023-11-29 00:13:33,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:33,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1125 transitions. [2023-11-29 00:13:33,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.5) internal successors, (1125), 6 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,979 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,979 INFO L175 Difference]: Start difference. First operand has 194 places, 191 transitions, 392 flow. Second operand 6 states and 1125 transitions. [2023-11-29 00:13:33,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 208 transitions, 490 flow [2023-11-29 00:13:33,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 208 transitions, 490 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:13:33,984 INFO L231 Difference]: Finished difference. Result has 204 places, 205 transitions, 494 flow [2023-11-29 00:13:33,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=204, PETRI_TRANSITIONS=205} [2023-11-29 00:13:33,986 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -13 predicate places. [2023-11-29 00:13:33,986 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 205 transitions, 494 flow [2023-11-29 00:13:33,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:33,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:33,987 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] [2023-11-29 00:13:33,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:13:33,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:13:33,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash -417143202, now seen corresponding path program 1 times [2023-11-29 00:13:33,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:33,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563817106] [2023-11-29 00:13:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:33,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563817106] [2023-11-29 00:13:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563817106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:13:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887367798] [2023-11-29 00:13:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:34,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:13:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:34,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:13:34,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:13:34,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2023-11-29 00:13:34,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 205 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:34,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:34,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2023-11-29 00:13:34,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:35,318 INFO L124 PetriNetUnfolderBase]: 414/5300 cut-off events. [2023-11-29 00:13:35,318 INFO L125 PetriNetUnfolderBase]: For 562/604 co-relation queries the response was YES. [2023-11-29 00:13:35,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 5300 events. 414/5300 cut-off events. For 562/604 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 58677 event pairs, 54 based on Foata normal form. 0/4437 useless extension candidates. Maximal degree in co-relation 6727. Up to 366 conditions per place. [2023-11-29 00:13:35,384 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 28 selfloop transitions, 30 changer transitions 0/242 dead transitions. [2023-11-29 00:13:35,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 242 transitions, 776 flow [2023-11-29 00:13:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:13:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:13:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1139 transitions. [2023-11-29 00:13:35,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8437037037037037 [2023-11-29 00:13:35,388 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1139 transitions. [2023-11-29 00:13:35,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1139 transitions. [2023-11-29 00:13:35,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:35,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1139 transitions. [2023-11-29 00:13:35,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:35,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:35,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:35,397 INFO L175 Difference]: Start difference. First operand has 204 places, 205 transitions, 494 flow. Second operand 6 states and 1139 transitions. [2023-11-29 00:13:35,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 242 transitions, 776 flow [2023-11-29 00:13:35,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 242 transitions, 776 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:13:35,407 INFO L231 Difference]: Finished difference. Result has 214 places, 235 transitions, 772 flow [2023-11-29 00:13:35,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=214, PETRI_TRANSITIONS=235} [2023-11-29 00:13:35,408 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -3 predicate places. [2023-11-29 00:13:35,408 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 235 transitions, 772 flow [2023-11-29 00:13:35,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:35,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:35,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:35,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:13:35,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:13:35,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:35,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1164224104, now seen corresponding path program 1 times [2023-11-29 00:13:35,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:35,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117727191] [2023-11-29 00:13:35,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:35,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117727191] [2023-11-29 00:13:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117727191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:35,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:35,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:13:35,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644971884] [2023-11-29 00:13:35,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:35,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:13:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:35,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:13:35,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:13:35,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 225 [2023-11-29 00:13:35,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 235 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:35,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:35,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 225 [2023-11-29 00:13:35,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:39,343 INFO L124 PetriNetUnfolderBase]: 4608/30686 cut-off events. [2023-11-29 00:13:39,343 INFO L125 PetriNetUnfolderBase]: For 5513/5743 co-relation queries the response was YES. [2023-11-29 00:13:39,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43522 conditions, 30686 events. 4608/30686 cut-off events. For 5513/5743 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 439442 event pairs, 1493 based on Foata normal form. 10/26308 useless extension candidates. Maximal degree in co-relation 43507. Up to 5422 conditions per place. [2023-11-29 00:13:39,574 INFO L140 encePairwiseOnDemand]: 204/225 looper letters, 94 selfloop transitions, 15 changer transitions 0/286 dead transitions. [2023-11-29 00:13:39,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 286 transitions, 1313 flow [2023-11-29 00:13:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:13:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:13:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-11-29 00:13:39,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8355555555555556 [2023-11-29 00:13:39,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-11-29 00:13:39,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-11-29 00:13:39,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:39,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-11-29 00:13:39,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:39,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:39,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:39,582 INFO L175 Difference]: Start difference. First operand has 214 places, 235 transitions, 772 flow. Second operand 3 states and 564 transitions. [2023-11-29 00:13:39,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 286 transitions, 1313 flow [2023-11-29 00:13:39,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 286 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:13:39,599 INFO L231 Difference]: Finished difference. Result has 218 places, 250 transitions, 904 flow [2023-11-29 00:13:39,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=218, PETRI_TRANSITIONS=250} [2023-11-29 00:13:39,600 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 1 predicate places. [2023-11-29 00:13:39,600 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 250 transitions, 904 flow [2023-11-29 00:13:39,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:39,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:39,601 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] [2023-11-29 00:13:39,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:13:39,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:13:39,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1354795915, now seen corresponding path program 1 times [2023-11-29 00:13:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:39,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11843416] [2023-11-29 00:13:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:39,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:39,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11843416] [2023-11-29 00:13:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11843416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:39,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:13:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285589518] [2023-11-29 00:13:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:39,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:13:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:39,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:13:39,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:13:39,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 225 [2023-11-29 00:13:39,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 250 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:39,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:39,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 225 [2023-11-29 00:13:39,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:44,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([843] L701-8-->L701-9: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][48], [220#true, 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 213#L701-9true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 253#true, 208#L703-6true, Black: 235#true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), 156#L703-6true, Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, 249#(= |#race~s~0| 0), thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-29 00:13:44,553 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-29 00:13:44,553 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-29 00:13:44,553 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-29 00:13:44,553 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 00:13:45,439 INFO L124 PetriNetUnfolderBase]: 8962/52610 cut-off events. [2023-11-29 00:13:45,439 INFO L125 PetriNetUnfolderBase]: For 8239/8659 co-relation queries the response was YES. [2023-11-29 00:13:45,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79931 conditions, 52610 events. 8962/52610 cut-off events. For 8239/8659 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 807630 event pairs, 4155 based on Foata normal form. 0/45060 useless extension candidates. Maximal degree in co-relation 79914. Up to 7173 conditions per place. [2023-11-29 00:13:45,801 INFO L140 encePairwiseOnDemand]: 215/225 looper letters, 63 selfloop transitions, 9 changer transitions 0/270 dead transitions. [2023-11-29 00:13:45,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 270 transitions, 1160 flow [2023-11-29 00:13:45,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:13:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:13:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-11-29 00:13:45,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8325925925925926 [2023-11-29 00:13:45,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-11-29 00:13:45,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-11-29 00:13:45,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:45,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-11-29 00:13:45,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:45,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:45,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:45,808 INFO L175 Difference]: Start difference. First operand has 218 places, 250 transitions, 904 flow. Second operand 3 states and 562 transitions. [2023-11-29 00:13:45,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 270 transitions, 1160 flow [2023-11-29 00:13:45,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 270 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:13:45,924 INFO L231 Difference]: Finished difference. Result has 220 places, 258 transitions, 944 flow [2023-11-29 00:13:45,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=944, PETRI_PLACES=220, PETRI_TRANSITIONS=258} [2023-11-29 00:13:45,926 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 3 predicate places. [2023-11-29 00:13:45,926 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 258 transitions, 944 flow [2023-11-29 00:13:45,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:45,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:45,927 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] [2023-11-29 00:13:45,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:13:45,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:13:45,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash -489276758, now seen corresponding path program 1 times [2023-11-29 00:13:45,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:45,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699200049] [2023-11-29 00:13:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:45,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:45,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699200049] [2023-11-29 00:13:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699200049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:45,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:13:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665411271] [2023-11-29 00:13:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:45,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:13:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:13:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:13:46,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 225 [2023-11-29 00:13:46,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 258 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:46,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:46,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 225 [2023-11-29 00:13:46,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:47,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][267], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 190#L702-2true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, 259#true, 253#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 98#L702-3true, Black: 247#true, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 121#L702-3true]) [2023-11-29 00:13:47,412 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 00:13:47,412 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 00:13:47,412 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 00:13:47,412 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 00:13:48,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][249], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 190#L702-2true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, 259#true, 253#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 92#L702-4true, 121#L702-3true]) [2023-11-29 00:13:48,269 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 00:13:48,269 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 00:13:48,269 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 00:13:48,270 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 00:13:48,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][205], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 41#L702-4true, 190#L702-2true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, 259#true, 253#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, 98#L702-3true, thr1Thread2of2ForFork0InUse, Black: 247#true, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2023-11-29 00:13:48,394 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is not cut-off event [2023-11-29 00:13:48,394 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-29 00:13:48,394 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-29 00:13:48,394 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-29 00:13:51,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([843] L701-8-->L701-9: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][48], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 213#L701-9true, 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 253#true, 208#L703-6true, Black: 235#true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), 156#L703-6true, Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-29 00:13:51,454 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-29 00:13:51,454 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-29 00:13:51,454 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-29 00:13:51,454 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 00:13:51,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([843] L701-8-->L701-9: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][109], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 73#L703-2true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 213#L701-9true, 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 253#true, Black: 235#true, 156#L703-6true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-29 00:13:51,517 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-29 00:13:51,517 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-29 00:13:51,517 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 00:13:51,517 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 00:13:52,263 INFO L124 PetriNetUnfolderBase]: 9994/56513 cut-off events. [2023-11-29 00:13:52,263 INFO L125 PetriNetUnfolderBase]: For 11427/13238 co-relation queries the response was YES. [2023-11-29 00:13:52,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89938 conditions, 56513 events. 9994/56513 cut-off events. For 11427/13238 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 877216 event pairs, 3855 based on Foata normal form. 3/48104 useless extension candidates. Maximal degree in co-relation 89920. Up to 7490 conditions per place. [2023-11-29 00:13:52,614 INFO L140 encePairwiseOnDemand]: 215/225 looper letters, 67 selfloop transitions, 13 changer transitions 0/282 dead transitions. [2023-11-29 00:13:52,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 282 transitions, 1251 flow [2023-11-29 00:13:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:13:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:13:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-11-29 00:13:52,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.84 [2023-11-29 00:13:52,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-11-29 00:13:52,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-11-29 00:13:52,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:52,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-11-29 00:13:52,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:52,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:52,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:52,620 INFO L175 Difference]: Start difference. First operand has 220 places, 258 transitions, 944 flow. Second operand 3 states and 567 transitions. [2023-11-29 00:13:52,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 282 transitions, 1251 flow [2023-11-29 00:13:52,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 282 transitions, 1225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:13:52,739 INFO L231 Difference]: Finished difference. Result has 222 places, 269 transitions, 1038 flow [2023-11-29 00:13:52,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=222, PETRI_TRANSITIONS=269} [2023-11-29 00:13:52,740 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 5 predicate places. [2023-11-29 00:13:52,740 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 269 transitions, 1038 flow [2023-11-29 00:13:52,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:52,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:52,740 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:52,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:13:52,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:13:52,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash 157972193, now seen corresponding path program 1 times [2023-11-29 00:13:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:52,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935230480] [2023-11-29 00:13:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:13:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935230480] [2023-11-29 00:13:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935230480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:52,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:13:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738765173] [2023-11-29 00:13:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:52,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:13:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:13:52,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:13:53,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2023-11-29 00:13:53,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 269 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:53,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:53,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2023-11-29 00:13:53,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:54,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 124#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, 64#L701-4true, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-29 00:13:54,120 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 00:13:54,120 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 00:13:54,120 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 00:13:54,120 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 00:13:54,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), 124#L701-8true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-29 00:13:54,168 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-29 00:13:54,168 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 00:13:54,168 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 00:13:54,168 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 00:13:54,305 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), 124#L701-8true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-29 00:13:54,306 INFO L294 olderBase$Statistics]: this new event has 70 ancestors and is not cut-off event [2023-11-29 00:13:54,306 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is not cut-off event [2023-11-29 00:13:54,306 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is not cut-off event [2023-11-29 00:13:54,306 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-11-29 00:13:54,306 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is not cut-off event [2023-11-29 00:13:54,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 69#L701-4true, 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-29 00:13:54,465 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 00:13:54,466 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 00:13:54,466 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 00:13:54,466 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 00:13:54,466 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), 124#L701-8true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-29 00:13:54,466 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-29 00:13:54,466 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 00:13:54,466 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 00:13:54,466 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 00:13:54,467 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 00:13:54,467 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-29 00:13:57,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][118], [30#thr1_returnLabel#1true, 220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 249#(= |#race~s~0| 0), 223#true]) [2023-11-29 00:13:57,179 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 00:13:57,179 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 00:13:57,180 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 00:13:57,180 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 00:14:03,774 INFO L124 PetriNetUnfolderBase]: 16382/93733 cut-off events. [2023-11-29 00:14:03,774 INFO L125 PetriNetUnfolderBase]: For 14767/16887 co-relation queries the response was YES. [2023-11-29 00:14:04,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148814 conditions, 93733 events. 16382/93733 cut-off events. For 14767/16887 co-relation queries the response was YES. Maximal size of possible extension queue 2403. Compared 1575209 event pairs, 5727 based on Foata normal form. 12/80060 useless extension candidates. Maximal degree in co-relation 148795. Up to 12263 conditions per place. [2023-11-29 00:14:04,530 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 48 selfloop transitions, 46 changer transitions 0/318 dead transitions. [2023-11-29 00:14:04,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 318 transitions, 1468 flow [2023-11-29 00:14:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:14:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:14:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1135 transitions. [2023-11-29 00:14:04,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2023-11-29 00:14:04,534 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1135 transitions. [2023-11-29 00:14:04,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1135 transitions. [2023-11-29 00:14:04,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:04,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1135 transitions. [2023-11-29 00:14:04,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:04,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:04,540 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:04,540 INFO L175 Difference]: Start difference. First operand has 222 places, 269 transitions, 1038 flow. Second operand 6 states and 1135 transitions. [2023-11-29 00:14:04,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 318 transitions, 1468 flow [2023-11-29 00:14:04,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 318 transitions, 1442 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:04,911 INFO L231 Difference]: Finished difference. Result has 230 places, 315 transitions, 1466 flow [2023-11-29 00:14:04,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1466, PETRI_PLACES=230, PETRI_TRANSITIONS=315} [2023-11-29 00:14:04,912 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 13 predicate places. [2023-11-29 00:14:04,912 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 315 transitions, 1466 flow [2023-11-29 00:14:04,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:04,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:04,913 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] [2023-11-29 00:14:04,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:14:04,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:14:04,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash 918065909, now seen corresponding path program 1 times [2023-11-29 00:14:04,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:04,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730287888] [2023-11-29 00:14:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:04,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:04,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730287888] [2023-11-29 00:14:04,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730287888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:04,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:04,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208275900] [2023-11-29 00:14:04,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:04,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:04,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:04,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:04,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 225 [2023-11-29 00:14:04,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 315 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:04,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:04,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 225 [2023-11-29 00:14:04,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:08,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][366], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 190#L702-2true, Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 265#true, Black: 268#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0)), 177#L702-6true, Black: 269#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 2)) 0)), 277#true, Black: 267#(= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 121#L702-3true, 270#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 2)) 0)), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), Black: 247#true]) [2023-11-29 00:14:08,613 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 00:14:08,613 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:14:08,614 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:14:08,614 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:14:08,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][366], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), 190#L702-2true, 265#true, 177#L702-6true, Black: 268#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0)), 277#true, Black: 269#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 2)) 0)), Black: 267#(= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0), Black: 270#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 2)) 0)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 121#L702-3true, 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), Black: 247#true]) [2023-11-29 00:14:08,763 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 00:14:08,764 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:14:08,764 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:14:08,764 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 00:14:11,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][266], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 190#L702-2true, Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 265#true, Black: 268#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0)), 177#L702-6true, 277#true, Black: 269#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 2)) 0)), Black: 267#(= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 270#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 2)) 0)), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 41#L702-4true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), Black: 247#true]) [2023-11-29 00:14:11,115 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is not cut-off event [2023-11-29 00:14:11,115 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 00:14:11,115 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 00:14:11,115 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 00:14:11,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][266], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), 190#L702-2true, 265#true, 177#L702-6true, Black: 268#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0)), 277#true, Black: 269#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 2)) 0)), Black: 267#(= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0), Black: 270#(and (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) |thr1Thread2of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 3)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread2of2ForFork0_~#l~0#1.base|) (+ |thr1Thread2of2ForFork0_~#l~0#1.offset| 2)) 0)), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 41#L702-4true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), Black: 247#true]) [2023-11-29 00:14:11,415 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is not cut-off event [2023-11-29 00:14:11,415 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 00:14:11,415 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 00:14:11,415 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 00:14:21,923 INFO L124 PetriNetUnfolderBase]: 26065/138376 cut-off events. [2023-11-29 00:14:21,923 INFO L125 PetriNetUnfolderBase]: For 49676/57165 co-relation queries the response was YES. [2023-11-29 00:14:22,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242686 conditions, 138376 events. 26065/138376 cut-off events. For 49676/57165 co-relation queries the response was YES. Maximal size of possible extension queue 3732. Compared 2429997 event pairs, 6787 based on Foata normal form. 125/119126 useless extension candidates. Maximal degree in co-relation 242663. Up to 15450 conditions per place. [2023-11-29 00:14:23,219 INFO L140 encePairwiseOnDemand]: 210/225 looper letters, 155 selfloop transitions, 26 changer transitions 0/389 dead transitions. [2023-11-29 00:14:23,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 389 transitions, 2377 flow [2023-11-29 00:14:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2023-11-29 00:14:23,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2023-11-29 00:14:23,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 570 transitions. [2023-11-29 00:14:23,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions. [2023-11-29 00:14:23,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:23,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions. [2023-11-29 00:14:23,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,225 INFO L175 Difference]: Start difference. First operand has 230 places, 315 transitions, 1466 flow. Second operand 3 states and 570 transitions. [2023-11-29 00:14:23,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 389 transitions, 2377 flow [2023-11-29 00:14:23,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 389 transitions, 2377 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:14:23,328 INFO L231 Difference]: Finished difference. Result has 234 places, 340 transitions, 1748 flow [2023-11-29 00:14:23,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1748, PETRI_PLACES=234, PETRI_TRANSITIONS=340} [2023-11-29 00:14:23,329 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 17 predicate places. [2023-11-29 00:14:23,329 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 340 transitions, 1748 flow [2023-11-29 00:14:23,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:23,330 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:23,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:14:23,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-29 00:14:23,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1326512896, now seen corresponding path program 1 times [2023-11-29 00:14:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620863668] [2023-11-29 00:14:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:14:23,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:14:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:14:23,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:14:23,356 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:14:23,356 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 49 remaining) [2023-11-29 00:14:23,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2023-11-29 00:14:23,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2023-11-29 00:14:23,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2023-11-29 00:14:23,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2023-11-29 00:14:23,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2023-11-29 00:14:23,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2023-11-29 00:14:23,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2023-11-29 00:14:23,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2023-11-29 00:14:23,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2023-11-29 00:14:23,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2023-11-29 00:14:23,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2023-11-29 00:14:23,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2023-11-29 00:14:23,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2023-11-29 00:14:23,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2023-11-29 00:14:23,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2023-11-29 00:14:23,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2023-11-29 00:14:23,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2023-11-29 00:14:23,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2023-11-29 00:14:23,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2023-11-29 00:14:23,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2023-11-29 00:14:23,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2023-11-29 00:14:23,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 49 remaining) [2023-11-29 00:14:23,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (17 of 49 remaining) [2023-11-29 00:14:23,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2023-11-29 00:14:23,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2023-11-29 00:14:23,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2023-11-29 00:14:23,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2023-11-29 00:14:23,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2023-11-29 00:14:23,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2023-11-29 00:14:23,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2023-11-29 00:14:23,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2023-11-29 00:14:23,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2023-11-29 00:14:23,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2023-11-29 00:14:23,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2023-11-29 00:14:23,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2023-11-29 00:14:23,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2023-11-29 00:14:23,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2023-11-29 00:14:23,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2023-11-29 00:14:23,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2023-11-29 00:14:23,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2023-11-29 00:14:23,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:14:23,363 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:23,363 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:14:23,363 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 00:14:23,412 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:14:23,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 288 transitions, 594 flow [2023-11-29 00:14:23,483 INFO L124 PetriNetUnfolderBase]: 32/544 cut-off events. [2023-11-29 00:14:23,483 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 00:14:23,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 544 events. 32/544 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2657 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 399. Up to 8 conditions per place. [2023-11-29 00:14:23,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 288 transitions, 594 flow [2023-11-29 00:14:23,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 288 transitions, 594 flow [2023-11-29 00:14:23,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:14:23,493 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;@2132b0fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:14:23,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-29 00:14:23,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:14:23,495 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-11-29 00:14:23,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:14:23,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:23,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:23,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-29 00:14:23,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash -894723382, now seen corresponding path program 1 times [2023-11-29 00:14:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765727295] [2023-11-29 00:14:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:23,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765727295] [2023-11-29 00:14:23,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765727295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:23,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:23,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662218513] [2023-11-29 00:14:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:23,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:14:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:23,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:14:23,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:14:23,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 288 [2023-11-29 00:14:23,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 288 transitions, 594 flow. Second operand has 2 states, 2 states have (on average 245.0) internal successors, (490), 2 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:23,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 288 [2023-11-29 00:14:23,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:23,711 INFO L124 PetriNetUnfolderBase]: 53/1421 cut-off events. [2023-11-29 00:14:23,712 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 00:14:23,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1421 events. 53/1421 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 10988 event pairs, 27 based on Foata normal form. 116/1284 useless extension candidates. Maximal degree in co-relation 815. Up to 57 conditions per place. [2023-11-29 00:14:23,724 INFO L140 encePairwiseOnDemand]: 255/288 looper letters, 7 selfloop transitions, 0 changer transitions 0/243 dead transitions. [2023-11-29 00:14:23,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 243 transitions, 518 flow [2023-11-29 00:14:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:14:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 00:14:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 528 transitions. [2023-11-29 00:14:23,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2023-11-29 00:14:23,726 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 528 transitions. [2023-11-29 00:14:23,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 528 transitions. [2023-11-29 00:14:23,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:23,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 528 transitions. [2023-11-29 00:14:23,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 264.0) internal successors, (528), 2 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,729 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,729 INFO L175 Difference]: Start difference. First operand has 278 places, 288 transitions, 594 flow. Second operand 2 states and 528 transitions. [2023-11-29 00:14:23,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 243 transitions, 518 flow [2023-11-29 00:14:23,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 243 transitions, 516 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 00:14:23,733 INFO L231 Difference]: Finished difference. Result has 247 places, 243 transitions, 502 flow [2023-11-29 00:14:23,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=502, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2023-11-29 00:14:23,734 INFO L281 CegarLoopForPetriNet]: 278 programPoint places, -31 predicate places. [2023-11-29 00:14:23,734 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 502 flow [2023-11-29 00:14:23,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 245.0) internal successors, (490), 2 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:23,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:23,735 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-29 00:14:23,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:14:23,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-29 00:14:23,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1977451028, now seen corresponding path program 1 times [2023-11-29 00:14:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361473672] [2023-11-29 00:14:23,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:23,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:23,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361473672] [2023-11-29 00:14:23,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361473672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:23,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:23,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:14:23,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505079886] [2023-11-29 00:14:23,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:23,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:14:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:23,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:14:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:14:24,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 288 [2023-11-29 00:14:24,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 235.33333333333334) internal successors, (1412), 6 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:24,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:24,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 288 [2023-11-29 00:14:24,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:25,081 INFO L124 PetriNetUnfolderBase]: 444/7119 cut-off events. [2023-11-29 00:14:25,081 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-29 00:14:25,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7743 conditions, 7119 events. 444/7119 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 81219 event pairs, 131 based on Foata normal form. 0/5870 useless extension candidates. Maximal degree in co-relation 7737. Up to 442 conditions per place. [2023-11-29 00:14:25,147 INFO L140 encePairwiseOnDemand]: 278/288 looper letters, 20 selfloop transitions, 18 changer transitions 0/264 dead transitions. [2023-11-29 00:14:25,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 264 transitions, 620 flow [2023-11-29 00:14:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:14:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:14:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1443 transitions. [2023-11-29 00:14:25,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8350694444444444 [2023-11-29 00:14:25,151 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1443 transitions. [2023-11-29 00:14:25,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1443 transitions. [2023-11-29 00:14:25,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:25,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1443 transitions. [2023-11-29 00:14:25,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 240.5) internal successors, (1443), 6 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:25,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:25,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:25,160 INFO L175 Difference]: Start difference. First operand has 247 places, 243 transitions, 502 flow. Second operand 6 states and 1443 transitions. [2023-11-29 00:14:25,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 264 transitions, 620 flow [2023-11-29 00:14:25,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 264 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:14:25,166 INFO L231 Difference]: Finished difference. Result has 257 places, 261 transitions, 630 flow [2023-11-29 00:14:25,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=257, PETRI_TRANSITIONS=261} [2023-11-29 00:14:25,167 INFO L281 CegarLoopForPetriNet]: 278 programPoint places, -21 predicate places. [2023-11-29 00:14:25,167 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 261 transitions, 630 flow [2023-11-29 00:14:25,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.33333333333334) internal successors, (1412), 6 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:25,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:25,168 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] [2023-11-29 00:14:25,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:14:25,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-29 00:14:25,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2110543104, now seen corresponding path program 1 times [2023-11-29 00:14:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804440857] [2023-11-29 00:14:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804440857] [2023-11-29 00:14:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804440857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:14:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214867670] [2023-11-29 00:14:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:25,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:14:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:14:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:14:25,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 288 [2023-11-29 00:14:25,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 261 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 237.33333333333334) internal successors, (1424), 6 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:25,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:25,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 288 [2023-11-29 00:14:25,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:27,896 INFO L124 PetriNetUnfolderBase]: 1839/18718 cut-off events. [2023-11-29 00:14:27,896 INFO L125 PetriNetUnfolderBase]: For 2447/2580 co-relation queries the response was YES. [2023-11-29 00:14:28,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23986 conditions, 18718 events. 1839/18718 cut-off events. For 2447/2580 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 253311 event pairs, 167 based on Foata normal form. 0/15567 useless extension candidates. Maximal degree in co-relation 23975. Up to 1587 conditions per place. [2023-11-29 00:14:28,084 INFO L140 encePairwiseOnDemand]: 278/288 looper letters, 38 selfloop transitions, 50 changer transitions 0/322 dead transitions. [2023-11-29 00:14:28,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 322 transitions, 1112 flow [2023-11-29 00:14:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:14:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:14:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1461 transitions. [2023-11-29 00:14:28,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8454861111111112 [2023-11-29 00:14:28,087 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1461 transitions. [2023-11-29 00:14:28,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1461 transitions. [2023-11-29 00:14:28,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:28,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1461 transitions. [2023-11-29 00:14:28,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:28,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:28,093 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 288.0) internal successors, (2016), 7 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:28,094 INFO L175 Difference]: Start difference. First operand has 257 places, 261 transitions, 630 flow. Second operand 6 states and 1461 transitions. [2023-11-29 00:14:28,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 322 transitions, 1112 flow [2023-11-29 00:14:28,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 322 transitions, 1112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:14:28,104 INFO L231 Difference]: Finished difference. Result has 267 places, 311 transitions, 1110 flow [2023-11-29 00:14:28,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1110, PETRI_PLACES=267, PETRI_TRANSITIONS=311} [2023-11-29 00:14:28,105 INFO L281 CegarLoopForPetriNet]: 278 programPoint places, -11 predicate places. [2023-11-29 00:14:28,105 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 311 transitions, 1110 flow [2023-11-29 00:14:28,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.33333333333334) internal successors, (1424), 6 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:28,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:28,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:28,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:14:28,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-29 00:14:28,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1954923112, now seen corresponding path program 1 times [2023-11-29 00:14:28,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:28,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391061542] [2023-11-29 00:14:28,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391061542] [2023-11-29 00:14:28,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391061542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:28,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:28,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136914746] [2023-11-29 00:14:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:28,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:28,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:28,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 288 [2023-11-29 00:14:28,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 311 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:28,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:28,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 288 [2023-11-29 00:14:28,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:15:13,394 INFO L124 PetriNetUnfolderBase]: 74640/330489 cut-off events. [2023-11-29 00:15:13,394 INFO L125 PetriNetUnfolderBase]: For 96275/99384 co-relation queries the response was YES. [2023-11-29 00:15:15,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501531 conditions, 330489 events. 74640/330489 cut-off events. For 96275/99384 co-relation queries the response was YES. Maximal size of possible extension queue 6865. Compared 6040715 event pairs, 25978 based on Foata normal form. 27/279440 useless extension candidates. Maximal degree in co-relation 501515. Up to 75472 conditions per place. [2023-11-29 00:15:16,906 INFO L140 encePairwiseOnDemand]: 260/288 looper letters, 153 selfloop transitions, 20 changer transitions 0/393 dead transitions. [2023-11-29 00:15:16,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 393 transitions, 2026 flow [2023-11-29 00:15:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:15:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:15:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2023-11-29 00:15:16,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8298611111111112 [2023-11-29 00:15:16,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 717 transitions. [2023-11-29 00:15:16,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions. [2023-11-29 00:15:16,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:15:16,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions. [2023-11-29 00:15:16,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:15:16,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:15:16,911 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:15:16,911 INFO L175 Difference]: Start difference. First operand has 267 places, 311 transitions, 1110 flow. Second operand 3 states and 717 transitions. [2023-11-29 00:15:16,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 393 transitions, 2026 flow [2023-11-29 00:15:17,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 393 transitions, 2026 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:15:17,007 INFO L231 Difference]: Finished difference. Result has 271 places, 331 transitions, 1286 flow [2023-11-29 00:15:17,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1286, PETRI_PLACES=271, PETRI_TRANSITIONS=331} [2023-11-29 00:15:17,008 INFO L281 CegarLoopForPetriNet]: 278 programPoint places, -7 predicate places. [2023-11-29 00:15:17,008 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 331 transitions, 1286 flow [2023-11-29 00:15:17,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:15:17,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:15:17,008 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] [2023-11-29 00:15:17,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:15:17,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-29 00:15:17,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash 225579915, now seen corresponding path program 1 times [2023-11-29 00:15:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30631685] [2023-11-29 00:15:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:17,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:15:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30631685] [2023-11-29 00:15:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30631685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:15:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:15:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:15:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851070515] [2023-11-29 00:15:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:15:17,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:15:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:17,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:15:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:15:17,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 288 [2023-11-29 00:15:17,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 331 transitions, 1286 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:15:17,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:15:17,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 288 [2023-11-29 00:15:17,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand