./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8ffb6ed4cf93a465c15dff37fbdc82f2f1bfe68c16d8d908373acd9cd0f46e43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:06:18,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:06:18,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:06:18,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:06:18,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:06:18,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:06:18,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:06:18,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:06:18,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:06:18,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:06:18,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:06:18,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:06:18,397 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:06:18,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:06:18,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:06:18,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:06:18,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:06:18,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:06:18,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:06:18,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:06:18,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:06:18,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:06:18,401 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8ffb6ed4cf93a465c15dff37fbdc82f2f1bfe68c16d8d908373acd9cd0f46e43 [2025-03-17 11:06:18,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:06:18,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:06:18,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:06:18,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:06:18,631 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:06:18,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i [2025-03-17 11:06:19,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fe92236/6cef559c43ce422d9d047129923dfcdc/FLAG0605471c8 [2025-03-17 11:06:20,123 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:06:20,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i [2025-03-17 11:06:20,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fe92236/6cef559c43ce422d9d047129923dfcdc/FLAG0605471c8 [2025-03-17 11:06:20,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36fe92236/6cef559c43ce422d9d047129923dfcdc [2025-03-17 11:06:20,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:06:20,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:06:20,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:06:20,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:06:20,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:06:20,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4a4b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20, skipping insertion in model container [2025-03-17 11:06:20,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:06:20,645 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:20,646 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:20,646 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:20,647 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:20,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:06:20,685 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:06:20,730 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:20,735 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:20,738 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:20,739 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-17 11:06:20,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:06:20,791 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:06:20,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20 WrapperNode [2025-03-17 11:06:20,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:06:20,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:06:20,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:06:20,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:06:20,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,834 INFO L138 Inliner]: procedures = 274, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 319 [2025-03-17 11:06:20,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:06:20,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:06:20,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:06:20,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:06:20,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:06:20,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:06:20,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:06:20,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:06:20,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (1/1) ... [2025-03-17 11:06:20,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:06:20,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:20,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:06:20,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:06:20,937 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-17 11:06:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-17 11:06:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-03-17 11:06:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-03-17 11:06:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:06:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:06:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:06:20,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:06:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:06:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:06:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:06:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:06:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:06:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:06:20,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:06:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:06:20,941 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:06:21,071 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:06:21,072 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:06:21,592 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:06:21,592 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:06:21,618 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:06:21,618 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:06:21,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:06:21 BoogieIcfgContainer [2025-03-17 11:06:21,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:06:21,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:06:21,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:06:21,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:06:21,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:06:20" (1/3) ... [2025-03-17 11:06:21,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46667db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:06:21, skipping insertion in model container [2025-03-17 11:06:21,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:06:20" (2/3) ... [2025-03-17 11:06:21,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46667db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:06:21, skipping insertion in model container [2025-03-17 11:06:21,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:06:21" (3/3) ... [2025-03-17 11:06:21,626 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_20-arrayloop2_rc.i [2025-03-17 11:06:21,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:06:21,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_20-arrayloop2_rc.i that has 3 procedures, 357 locations, 1 initial locations, 6 loop locations, and 18 error locations. [2025-03-17 11:06:21,638 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:06:21,765 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:06:21,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 364 transitions, 736 flow [2025-03-17 11:06:21,909 INFO L124 PetriNetUnfolderBase]: 8/362 cut-off events. [2025-03-17 11:06:21,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:21,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 362 events. 8/362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 601 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 289. Up to 2 conditions per place. [2025-03-17 11:06:21,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 363 places, 364 transitions, 736 flow [2025-03-17 11:06:21,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 362 transitions, 730 flow [2025-03-17 11:06:21,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:06:21,943 INFO L333 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, 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;@70182748, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:06:21,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-17 11:06:21,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:06:21,963 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-17 11:06:21,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:21,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:21,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:21,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:21,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash -82536238, now seen corresponding path program 1 times [2025-03-17 11:06:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:21,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345968775] [2025-03-17 11:06:21,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:22,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 11:06:22,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 11:06:22,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:22,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345968775] [2025-03-17 11:06:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345968775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:22,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:22,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448950636] [2025-03-17 11:06:22,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:22,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:22,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:22,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:23,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 364 [2025-03-17 11:06:23,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 362 transitions, 730 flow. Second operand has 6 states, 6 states have (on average 279.3333333333333) internal successors, (1676), 6 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:23,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:23,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 364 [2025-03-17 11:06:23,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:23,659 INFO L124 PetriNetUnfolderBase]: 449/1836 cut-off events. [2025-03-17 11:06:23,659 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 11:06:23,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1836 events. 449/1836 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11625 event pairs, 342 based on Foata normal form. 34/1663 useless extension candidates. Maximal degree in co-relation 2472. Up to 846 conditions per place. [2025-03-17 11:06:23,677 INFO L140 encePairwiseOnDemand]: 350/364 looper letters, 72 selfloop transitions, 10 changer transitions 0/358 dead transitions. [2025-03-17 11:06:23,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 358 transitions, 886 flow [2025-03-17 11:06:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2025-03-17 11:06:23,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8031135531135531 [2025-03-17 11:06:23,697 INFO L175 Difference]: Start difference. First operand has 361 places, 362 transitions, 730 flow. Second operand 6 states and 1754 transitions. [2025-03-17 11:06:23,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 358 transitions, 886 flow [2025-03-17 11:06:23,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 358 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:06:23,709 INFO L231 Difference]: Finished difference. Result has 362 places, 358 transitions, 740 flow [2025-03-17 11:06:23,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=740, PETRI_PLACES=362, PETRI_TRANSITIONS=358} [2025-03-17 11:06:23,715 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 1 predicate places. [2025-03-17 11:06:23,716 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 358 transitions, 740 flow [2025-03-17 11:06:23,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.3333333333333) internal successors, (1676), 6 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:23,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:23,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:23,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:06:23,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:23,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1634926894, now seen corresponding path program 1 times [2025-03-17 11:06:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:23,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910601892] [2025-03-17 11:06:23,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:23,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:23,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:06:23,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:06:23,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:23,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910601892] [2025-03-17 11:06:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910601892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:24,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:24,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706624124] [2025-03-17 11:06:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:24,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:24,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:24,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:24,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 364 [2025-03-17 11:06:24,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 358 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 279.3333333333333) internal successors, (1676), 6 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:24,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:24,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 364 [2025-03-17 11:06:24,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:24,817 INFO L124 PetriNetUnfolderBase]: 449/1834 cut-off events. [2025-03-17 11:06:24,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:24,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1834 events. 449/1834 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11535 event pairs, 342 based on Foata normal form. 0/1629 useless extension candidates. Maximal degree in co-relation 2568. Up to 846 conditions per place. [2025-03-17 11:06:24,826 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 72 selfloop transitions, 10 changer transitions 0/356 dead transitions. [2025-03-17 11:06:24,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 356 transitions, 900 flow [2025-03-17 11:06:24,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1752 transitions. [2025-03-17 11:06:24,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2025-03-17 11:06:24,830 INFO L175 Difference]: Start difference. First operand has 362 places, 358 transitions, 740 flow. Second operand 6 states and 1752 transitions. [2025-03-17 11:06:24,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 356 transitions, 900 flow [2025-03-17 11:06:24,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 356 transitions, 880 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:24,835 INFO L231 Difference]: Finished difference. Result has 360 places, 356 transitions, 736 flow [2025-03-17 11:06:24,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=356} [2025-03-17 11:06:24,836 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -1 predicate places. [2025-03-17 11:06:24,836 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 356 transitions, 736 flow [2025-03-17 11:06:24,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.3333333333333) internal successors, (1676), 6 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:24,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:24,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:24,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:06:24,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:24,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:24,838 INFO L85 PathProgramCache]: Analyzing trace with hash 869543781, now seen corresponding path program 1 times [2025-03-17 11:06:24,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:24,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022214922] [2025-03-17 11:06:24,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:24,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 11:06:24,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 11:06:24,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:24,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022214922] [2025-03-17 11:06:24,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022214922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:24,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:24,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:06:24,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691033505] [2025-03-17 11:06:24,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:24,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:06:24,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:24,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:06:24,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:06:24,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 364 [2025-03-17 11:06:24,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 356 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:24,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:24,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 364 [2025-03-17 11:06:24,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:25,054 INFO L124 PetriNetUnfolderBase]: 29/658 cut-off events. [2025-03-17 11:06:25,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:25,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 658 events. 29/658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2424 event pairs, 18 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 433. Up to 45 conditions per place. [2025-03-17 11:06:25,058 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-17 11:06:25,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 357 transitions, 764 flow [2025-03-17 11:06:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:06:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:06:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-17 11:06:25,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-03-17 11:06:25,060 INFO L175 Difference]: Start difference. First operand has 360 places, 356 transitions, 736 flow. Second operand 3 states and 1064 transitions. [2025-03-17 11:06:25,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 357 transitions, 764 flow [2025-03-17 11:06:25,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 357 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:25,067 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 728 flow [2025-03-17 11:06:25,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2025-03-17 11:06:25,068 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -3 predicate places. [2025-03-17 11:06:25,068 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 728 flow [2025-03-17 11:06:25,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:25,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:25,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:25,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:06:25,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:25,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1693907337, now seen corresponding path program 1 times [2025-03-17 11:06:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169438051] [2025-03-17 11:06:25,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:25,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 11:06:25,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 11:06:25,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:25,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169438051] [2025-03-17 11:06:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169438051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:25,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621424525] [2025-03-17 11:06:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:25,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:25,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:25,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:25,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 364 [2025-03-17 11:06:25,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:25,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:25,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 364 [2025-03-17 11:06:25,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:26,035 INFO L124 PetriNetUnfolderBase]: 450/1956 cut-off events. [2025-03-17 11:06:26,035 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:06:26,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 1956 events. 450/1956 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12289 event pairs, 342 based on Foata normal form. 0/1747 useless extension candidates. Maximal degree in co-relation 2653. Up to 894 conditions per place. [2025-03-17 11:06:26,048 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-17 11:06:26,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 356 transitions, 894 flow [2025-03-17 11:06:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1747 transitions. [2025-03-17 11:06:26,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.799908424908425 [2025-03-17 11:06:26,055 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 728 flow. Second operand 6 states and 1747 transitions. [2025-03-17 11:06:26,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 356 transitions, 894 flow [2025-03-17 11:06:26,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 356 transitions, 892 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:26,062 INFO L231 Difference]: Finished difference. Result has 361 places, 356 transitions, 734 flow [2025-03-17 11:06:26,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=361, PETRI_TRANSITIONS=356} [2025-03-17 11:06:26,064 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 0 predicate places. [2025-03-17 11:06:26,064 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 356 transitions, 734 flow [2025-03-17 11:06:26,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:26,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:26,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:06:26,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:26,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1692599989, now seen corresponding path program 1 times [2025-03-17 11:06:26,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:26,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949086558] [2025-03-17 11:06:26,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 11:06:26,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 11:06:26,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:26,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949086558] [2025-03-17 11:06:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949086558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:26,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:26,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:06:26,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257703518] [2025-03-17 11:06:26,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:26,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:06:26,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:26,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:06:26,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:06:26,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 364 [2025-03-17 11:06:26,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 356 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:26,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:26,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 364 [2025-03-17 11:06:26,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:26,247 INFO L124 PetriNetUnfolderBase]: 29/844 cut-off events. [2025-03-17 11:06:26,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:26,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 844 events. 29/844 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2388 event pairs, 18 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 511. Up to 49 conditions per place. [2025-03-17 11:06:26,249 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-17 11:06:26,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 762 flow [2025-03-17 11:06:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:06:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:06:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-17 11:06:26,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-03-17 11:06:26,252 INFO L175 Difference]: Start difference. First operand has 361 places, 356 transitions, 734 flow. Second operand 3 states and 1064 transitions. [2025-03-17 11:06:26,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 762 flow [2025-03-17 11:06:26,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 752 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:26,256 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 736 flow [2025-03-17 11:06:26,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2025-03-17 11:06:26,256 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -2 predicate places. [2025-03-17 11:06:26,257 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 736 flow [2025-03-17 11:06:26,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:26,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:26,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:26,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:06:26,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:26,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:26,258 INFO L85 PathProgramCache]: Analyzing trace with hash -286205639, now seen corresponding path program 1 times [2025-03-17 11:06:26,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:26,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171233624] [2025-03-17 11:06:26,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:26,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:26,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 11:06:26,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 11:06:26,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:26,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171233624] [2025-03-17 11:06:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171233624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867485945] [2025-03-17 11:06:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:26,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:26,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:27,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-17 11:06:27,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 736 flow. Second operand has 6 states, 6 states have (on average 306.5) internal successors, (1839), 6 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:27,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:27,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-17 11:06:27,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:27,258 INFO L124 PetriNetUnfolderBase]: 75/1156 cut-off events. [2025-03-17 11:06:27,259 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:06:27,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 1156 events. 75/1156 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4570 event pairs, 42 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 951. Up to 263 conditions per place. [2025-03-17 11:06:27,265 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 54 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-17 11:06:27,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 356 transitions, 852 flow [2025-03-17 11:06:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1872 transitions. [2025-03-17 11:06:27,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-17 11:06:27,273 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 736 flow. Second operand 6 states and 1872 transitions. [2025-03-17 11:06:27,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 356 transitions, 852 flow [2025-03-17 11:06:27,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 356 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:27,277 INFO L231 Difference]: Finished difference. Result has 362 places, 356 transitions, 742 flow [2025-03-17 11:06:27,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=362, PETRI_TRANSITIONS=356} [2025-03-17 11:06:27,284 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 1 predicate places. [2025-03-17 11:06:27,284 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 356 transitions, 742 flow [2025-03-17 11:06:27,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 306.5) internal successors, (1839), 6 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:27,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:27,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:27,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:06:27,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 654251572, now seen corresponding path program 1 times [2025-03-17 11:06:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688352194] [2025-03-17 11:06:27,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:27,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 11:06:27,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 11:06:27,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:27,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:27,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:27,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688352194] [2025-03-17 11:06:27,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688352194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:27,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:27,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027153735] [2025-03-17 11:06:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:27,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:27,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:27,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:28,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 364 [2025-03-17 11:06:28,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 356 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:28,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:28,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 364 [2025-03-17 11:06:28,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:28,377 INFO L124 PetriNetUnfolderBase]: 450/2136 cut-off events. [2025-03-17 11:06:28,377 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:06:28,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 2136 events. 450/2136 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12245 event pairs, 342 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 2696. Up to 960 conditions per place. [2025-03-17 11:06:28,386 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 79 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-03-17 11:06:28,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 355 transitions, 908 flow [2025-03-17 11:06:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1747 transitions. [2025-03-17 11:06:28,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.799908424908425 [2025-03-17 11:06:28,390 INFO L175 Difference]: Start difference. First operand has 362 places, 356 transitions, 742 flow. Second operand 6 states and 1747 transitions. [2025-03-17 11:06:28,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 355 transitions, 908 flow [2025-03-17 11:06:28,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 355 transitions, 898 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:28,396 INFO L231 Difference]: Finished difference. Result has 361 places, 355 transitions, 740 flow [2025-03-17 11:06:28,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=740, PETRI_PLACES=361, PETRI_TRANSITIONS=355} [2025-03-17 11:06:28,397 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 0 predicate places. [2025-03-17 11:06:28,397 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 355 transitions, 740 flow [2025-03-17 11:06:28,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:28,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:28,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:28,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:06:28,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:28,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:28,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1836102349, now seen corresponding path program 1 times [2025-03-17 11:06:28,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:28,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574580317] [2025-03-17 11:06:28,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:28,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 11:06:28,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 11:06:28,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:28,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574580317] [2025-03-17 11:06:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574580317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:28,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:28,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364506106] [2025-03-17 11:06:28,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:28,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:28,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:28,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:29,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 364 [2025-03-17 11:06:29,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 355 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:29,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:29,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 364 [2025-03-17 11:06:29,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:29,432 INFO L124 PetriNetUnfolderBase]: 450/2132 cut-off events. [2025-03-17 11:06:29,432 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:06:29,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 2132 events. 450/2132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12258 event pairs, 342 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 2712. Up to 944 conditions per place. [2025-03-17 11:06:29,444 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2025-03-17 11:06:29,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 354 transitions, 898 flow [2025-03-17 11:06:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1767 transitions. [2025-03-17 11:06:29,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090659340659341 [2025-03-17 11:06:29,447 INFO L175 Difference]: Start difference. First operand has 361 places, 355 transitions, 740 flow. Second operand 6 states and 1767 transitions. [2025-03-17 11:06:29,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 354 transitions, 898 flow [2025-03-17 11:06:29,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 354 transitions, 888 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:29,454 INFO L231 Difference]: Finished difference. Result has 360 places, 354 transitions, 738 flow [2025-03-17 11:06:29,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=360, PETRI_TRANSITIONS=354} [2025-03-17 11:06:29,455 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -1 predicate places. [2025-03-17 11:06:29,455 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 354 transitions, 738 flow [2025-03-17 11:06:29,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:29,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:29,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:29,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:06:29,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1796701653, now seen corresponding path program 1 times [2025-03-17 11:06:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594742206] [2025-03-17 11:06:29,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:29,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 11:06:29,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 11:06:29,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:29,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:06:29,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:29,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594742206] [2025-03-17 11:06:29,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594742206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:29,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:29,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831626701] [2025-03-17 11:06:29,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:29,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:29,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:29,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:30,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 364 [2025-03-17 11:06:30,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 354 transitions, 738 flow. Second operand has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:30,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:30,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 364 [2025-03-17 11:06:30,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:30,505 INFO L124 PetriNetUnfolderBase]: 450/2128 cut-off events. [2025-03-17 11:06:30,505 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:06:30,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 2128 events. 450/2128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12156 event pairs, 342 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 2727. Up to 944 conditions per place. [2025-03-17 11:06:30,516 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2025-03-17 11:06:30,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 353 transitions, 896 flow [2025-03-17 11:06:30,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1767 transitions. [2025-03-17 11:06:30,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090659340659341 [2025-03-17 11:06:30,519 INFO L175 Difference]: Start difference. First operand has 360 places, 354 transitions, 738 flow. Second operand 6 states and 1767 transitions. [2025-03-17 11:06:30,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 353 transitions, 896 flow [2025-03-17 11:06:30,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 353 transitions, 886 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:30,524 INFO L231 Difference]: Finished difference. Result has 359 places, 353 transitions, 736 flow [2025-03-17 11:06:30,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=736, PETRI_PLACES=359, PETRI_TRANSITIONS=353} [2025-03-17 11:06:30,525 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -2 predicate places. [2025-03-17 11:06:30,525 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 353 transitions, 736 flow [2025-03-17 11:06:30,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:30,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:30,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:30,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:06:30,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2093770638, now seen corresponding path program 1 times [2025-03-17 11:06:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009950200] [2025-03-17 11:06:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:30,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 11:06:30,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 11:06:30,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:30,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:06:30,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:30,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009950200] [2025-03-17 11:06:30,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009950200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:30,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:30,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038947170] [2025-03-17 11:06:30,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:30,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:30,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:30,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:30,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:31,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 364 [2025-03-17 11:06:31,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 353 transitions, 736 flow. Second operand has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:31,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:31,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 364 [2025-03-17 11:06:31,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:31,358 INFO L124 PetriNetUnfolderBase]: 450/2124 cut-off events. [2025-03-17 11:06:31,358 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:06:31,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 2124 events. 450/2124 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12183 event pairs, 342 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 2740. Up to 964 conditions per place. [2025-03-17 11:06:31,369 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 80 selfloop transitions, 5 changer transitions 0/352 dead transitions. [2025-03-17 11:06:31,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 352 transitions, 904 flow [2025-03-17 11:06:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1742 transitions. [2025-03-17 11:06:31,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7976190476190477 [2025-03-17 11:06:31,373 INFO L175 Difference]: Start difference. First operand has 359 places, 353 transitions, 736 flow. Second operand 6 states and 1742 transitions. [2025-03-17 11:06:31,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 352 transitions, 904 flow [2025-03-17 11:06:31,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 352 transitions, 894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:31,377 INFO L231 Difference]: Finished difference. Result has 358 places, 352 transitions, 734 flow [2025-03-17 11:06:31,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=358, PETRI_TRANSITIONS=352} [2025-03-17 11:06:31,379 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -3 predicate places. [2025-03-17 11:06:31,379 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 352 transitions, 734 flow [2025-03-17 11:06:31,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:31,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:31,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:31,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:06:31,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:31,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1706789272, now seen corresponding path program 1 times [2025-03-17 11:06:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:31,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784064427] [2025-03-17 11:06:31,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:31,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 11:06:31,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 11:06:31,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:31,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:06:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784064427] [2025-03-17 11:06:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784064427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677379344] [2025-03-17 11:06:31,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:31,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:31,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:31,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:06:31,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:06:31,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 11:06:31,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 11:06:31,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:31,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:31,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:06:31,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:06:31,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:06:31,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677379344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:31,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:31,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:06:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717729774] [2025-03-17 11:06:31,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:31,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:06:31,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:31,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:06:31,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:06:31,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-17 11:06:32,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 352 transitions, 734 flow. Second operand has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:32,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:32,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-17 11:06:32,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:32,193 INFO L124 PetriNetUnfolderBase]: 29/1008 cut-off events. [2025-03-17 11:06:32,193 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:06:32,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 1008 events. 29/1008 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1823 event pairs, 18 based on Foata normal form. 4/974 useless extension candidates. Maximal degree in co-relation 504. Up to 49 conditions per place. [2025-03-17 11:06:32,197 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 15 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2025-03-17 11:06:32,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 800 flow [2025-03-17 11:06:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:06:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:06:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3149 transitions. [2025-03-17 11:06:32,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9612332112332113 [2025-03-17 11:06:32,203 INFO L175 Difference]: Start difference. First operand has 358 places, 352 transitions, 734 flow. Second operand 9 states and 3149 transitions. [2025-03-17 11:06:32,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 800 flow [2025-03-17 11:06:32,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 360 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:32,209 INFO L231 Difference]: Finished difference. Result has 364 places, 358 transitions, 774 flow [2025-03-17 11:06:32,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=364, PETRI_TRANSITIONS=358} [2025-03-17 11:06:32,210 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 3 predicate places. [2025-03-17 11:06:32,210 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 358 transitions, 774 flow [2025-03-17 11:06:32,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:32,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:32,212 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:32,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:06:32,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 11:06:32,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:32,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1113939826, now seen corresponding path program 2 times [2025-03-17 11:06:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:32,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214640783] [2025-03-17 11:06:32,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:32,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:32,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-03-17 11:06:32,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 407 statements. [2025-03-17 11:06:32,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:32,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-17 11:06:32,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214640783] [2025-03-17 11:06:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214640783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:32,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720098756] [2025-03-17 11:06:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:32,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:32,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:32,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:33,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 364 [2025-03-17 11:06:33,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 358 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:33,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:33,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 364 [2025-03-17 11:06:33,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:33,775 INFO L124 PetriNetUnfolderBase]: 199/1909 cut-off events. [2025-03-17 11:06:33,775 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 11:06:33,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 1909 events. 199/1909 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8815 event pairs, 54 based on Foata normal form. 0/1767 useless extension candidates. Maximal degree in co-relation 1889. Up to 448 conditions per place. [2025-03-17 11:06:33,786 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 71 selfloop transitions, 23 changer transitions 0/393 dead transitions. [2025-03-17 11:06:33,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 393 transitions, 1040 flow [2025-03-17 11:06:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1913 transitions. [2025-03-17 11:06:33,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8759157509157509 [2025-03-17 11:06:33,789 INFO L175 Difference]: Start difference. First operand has 364 places, 358 transitions, 774 flow. Second operand 6 states and 1913 transitions. [2025-03-17 11:06:33,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 393 transitions, 1040 flow [2025-03-17 11:06:33,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 393 transitions, 1034 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:06:33,796 INFO L231 Difference]: Finished difference. Result has 373 places, 380 transitions, 926 flow [2025-03-17 11:06:33,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=373, PETRI_TRANSITIONS=380} [2025-03-17 11:06:33,798 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 12 predicate places. [2025-03-17 11:06:33,798 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 380 transitions, 926 flow [2025-03-17 11:06:33,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:33,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:33,799 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:33,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:06:33,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:33,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash -828623560, now seen corresponding path program 1 times [2025-03-17 11:06:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:33,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374100737] [2025-03-17 11:06:33,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:33,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-17 11:06:33,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-17 11:06:33,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:33,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-03-17 11:06:34,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374100737] [2025-03-17 11:06:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374100737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:34,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257261942] [2025-03-17 11:06:34,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:34,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:34,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:34,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:06:34,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:06:34,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-17 11:06:34,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-17 11:06:34,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:34,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:34,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:06:34,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 11:06:34,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 11:06:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257261942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:35,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:35,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-17 11:06:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696759060] [2025-03-17 11:06:35,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:35,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:06:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:35,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:06:35,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:06:35,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 364 [2025-03-17 11:06:35,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 380 transitions, 926 flow. Second operand has 19 states, 19 states have (on average 343.6842105263158) internal successors, (6530), 19 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:35,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:35,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 364 [2025-03-17 11:06:35,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:36,516 INFO L124 PetriNetUnfolderBase]: 186/3447 cut-off events. [2025-03-17 11:06:36,516 INFO L125 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2025-03-17 11:06:36,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4171 conditions, 3447 events. 186/3447 cut-off events. For 134/138 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9513 event pairs, 55 based on Foata normal form. 13/3291 useless extension candidates. Maximal degree in co-relation 2855. Up to 146 conditions per place. [2025-03-17 11:06:36,524 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 47 selfloop transitions, 68 changer transitions 0/466 dead transitions. [2025-03-17 11:06:36,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 466 transitions, 1566 flow [2025-03-17 11:06:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-17 11:06:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-17 11:06:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 21611 transitions. [2025-03-17 11:06:36,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.942394906680621 [2025-03-17 11:06:36,540 INFO L175 Difference]: Start difference. First operand has 373 places, 380 transitions, 926 flow. Second operand 63 states and 21611 transitions. [2025-03-17 11:06:36,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 466 transitions, 1566 flow [2025-03-17 11:06:36,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 466 transitions, 1566 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:06:36,547 INFO L231 Difference]: Finished difference. Result has 451 places, 442 transitions, 1446 flow [2025-03-17 11:06:36,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1446, PETRI_PLACES=451, PETRI_TRANSITIONS=442} [2025-03-17 11:06:36,548 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 90 predicate places. [2025-03-17 11:06:36,548 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 442 transitions, 1446 flow [2025-03-17 11:06:36,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 343.6842105263158) internal successors, (6530), 19 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:36,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:36,551 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:36,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:06:36,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 11:06:36,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:36,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1938249553, now seen corresponding path program 2 times [2025-03-17 11:06:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:36,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377950203] [2025-03-17 11:06:36,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:36,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:36,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1432 statements into 2 equivalence classes. [2025-03-17 11:06:36,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1432 statements. [2025-03-17 11:06:36,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:36,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2025-03-17 11:06:37,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:37,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377950203] [2025-03-17 11:06:37,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377950203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:37,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:37,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:37,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995668438] [2025-03-17 11:06:37,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:37,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:37,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:37,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 364 [2025-03-17 11:06:37,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 442 transitions, 1446 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:37,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:37,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 364 [2025-03-17 11:06:37,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:39,029 INFO L124 PetriNetUnfolderBase]: 311/4003 cut-off events. [2025-03-17 11:06:39,029 INFO L125 PetriNetUnfolderBase]: For 702/738 co-relation queries the response was YES. [2025-03-17 11:06:39,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5861 conditions, 4003 events. 311/4003 cut-off events. For 702/738 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15605 event pairs, 61 based on Foata normal form. 8/3797 useless extension candidates. Maximal degree in co-relation 3813. Up to 1009 conditions per place. [2025-03-17 11:06:39,042 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 84 selfloop transitions, 31 changer transitions 0/481 dead transitions. [2025-03-17 11:06:39,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 481 transitions, 1796 flow [2025-03-17 11:06:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1909 transitions. [2025-03-17 11:06:39,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8740842490842491 [2025-03-17 11:06:39,046 INFO L175 Difference]: Start difference. First operand has 451 places, 442 transitions, 1446 flow. Second operand 6 states and 1909 transitions. [2025-03-17 11:06:39,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 481 transitions, 1796 flow [2025-03-17 11:06:39,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 481 transitions, 1720 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-17 11:06:39,055 INFO L231 Difference]: Finished difference. Result has 454 places, 472 transitions, 1628 flow [2025-03-17 11:06:39,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1628, PETRI_PLACES=454, PETRI_TRANSITIONS=472} [2025-03-17 11:06:39,055 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 93 predicate places. [2025-03-17 11:06:39,055 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 472 transitions, 1628 flow [2025-03-17 11:06:39,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:39,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:39,057 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:39,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:06:39,057 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:39,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1049895245, now seen corresponding path program 1 times [2025-03-17 11:06:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:39,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209259645] [2025-03-17 11:06:39,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:39,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1436 statements into 1 equivalence classes. [2025-03-17 11:06:39,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1436 of 1436 statements. [2025-03-17 11:06:39,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:39,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-03-17 11:06:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209259645] [2025-03-17 11:06:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209259645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487213451] [2025-03-17 11:06:41,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:41,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:41,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:41,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:06:41,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:06:41,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1436 statements into 1 equivalence classes. [2025-03-17 11:06:42,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1436 of 1436 statements. [2025-03-17 11:06:42,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:42,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:42,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 5657 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:06:42,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-03-17 11:06:43,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-03-17 11:06:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487213451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:43,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:43,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-17 11:06:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733308365] [2025-03-17 11:06:43,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:06:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:43,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:06:43,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:06:43,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-17 11:06:43,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 472 transitions, 1628 flow. Second operand has 34 states, 34 states have (on average 349.1764705882353) internal successors, (11872), 34 states have internal predecessors, (11872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:43,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:43,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-17 11:06:43,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:45,724 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([843] L1057-3-->L1057: Formula: (and (= (store |v_#pthreadsMutex_32| |v_~#c~0.base_107| (store (select |v_#pthreadsMutex_32| |v_~#c~0.base_107|) (+ |v_~#c~0.offset_107| 104 (* |v_gThread1of1ForFork0_~j~1#1_29| 24)) 0)) |v_#pthreadsMutex_31|) (= |v_gThread1of1ForFork0_#t~ret27#1_1| 0)) InVars {~#c~0.base=|v_~#c~0.base_107|, gThread1of1ForFork0_~j~1#1=|v_gThread1of1ForFork0_~j~1#1_29|, #pthreadsMutex=|v_#pthreadsMutex_32|, ~#c~0.offset=|v_~#c~0.offset_107|} OutVars{~#c~0.base=|v_~#c~0.base_107|, gThread1of1ForFork0_~j~1#1=|v_gThread1of1ForFork0_~j~1#1_29|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#c~0.offset=|v_~#c~0.offset_107|, gThread1of1ForFork0_#t~ret27#1=|v_gThread1of1ForFork0_#t~ret27#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, gThread1of1ForFork0_#t~ret27#1][409], [Black: 4362#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~j~2#1| 3)), Black: 4380#(and (<= |ULTIMATE.start_main_~j~2#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), 1810#true, Black: 4342#(and (= 0 |ULTIMATE.start_main_#t~post31#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 18#L1037true, Black: 1812#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1209#(< |ULTIMATE.start_main_~j~2#1| 30), Black: 4338#(and (<= |ULTIMATE.start_main_~j~2#1| 29) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 426#(<= |ULTIMATE.start_main_~j~2#1| 1), Black: 390#(= |ULTIMATE.start_main_~j~2#1| 0), Black: 4424#(and (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), Black: 4423#(= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0), Black: 1801#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 4425#(and (= (select (select |#race| |~#c~0.base|) (+ 2 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), Black: 1804#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 4426#(and (= (select (select |#race| |~#c~0.base|) (+ 3 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), Black: 1802#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), Black: 1803#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 1799#true, 26#L1057true, 362#true, 254#ULTIMATE.startFINALtrue, 422#true, 364#true, Black: 1814#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 4374#(and (<= |ULTIMATE.start_main_~j~2#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), 4432#true, Black: 3189#(< |ULTIMATE.start_main_~j~2#1| 29), Black: 4320#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~2#1| 3)), Black: 4326#(and (<= |ULTIMATE.start_main_~j~2#1| 27) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 3461#(< |ULTIMATE.start_main_~j~2#1| 28), Black: 3178#(< |ULTIMATE.start_main_~j~2#1| 30), Black: 4368#(and (<= |ULTIMATE.start_main_~j~2#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 380#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 4332#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~2#1| 28)), Black: 2937#(<= |ULTIMATE.start_main_~j~2#1| 3), 4421#true]) [2025-03-17 11:06:45,725 INFO L294 olderBase$Statistics]: this new event has 2964 ancestors and is cut-off event [2025-03-17 11:06:45,725 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-17 11:06:45,725 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-17 11:06:45,725 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-17 11:06:46,580 INFO L124 PetriNetUnfolderBase]: 340/6473 cut-off events. [2025-03-17 11:06:46,580 INFO L125 PetriNetUnfolderBase]: For 3586/3604 co-relation queries the response was YES. [2025-03-17 11:06:46,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8371 conditions, 6473 events. 340/6473 cut-off events. For 3586/3604 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17987 event pairs, 100 based on Foata normal form. 30/6235 useless extension candidates. Maximal degree in co-relation 5721. Up to 259 conditions per place. [2025-03-17 11:06:46,599 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 47 selfloop transitions, 135 changer transitions 0/573 dead transitions. [2025-03-17 11:06:46,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 573 transitions, 2756 flow [2025-03-17 11:06:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-17 11:06:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-17 11:06:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 15695 transitions. [2025-03-17 11:06:46,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581807081807082 [2025-03-17 11:06:46,612 INFO L175 Difference]: Start difference. First operand has 454 places, 472 transitions, 1628 flow. Second operand 45 states and 15695 transitions. [2025-03-17 11:06:46,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 573 transitions, 2756 flow [2025-03-17 11:06:46,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 573 transitions, 2756 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:06:46,627 INFO L231 Difference]: Finished difference. Result has 507 places, 547 transitions, 2502 flow [2025-03-17 11:06:46,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2502, PETRI_PLACES=507, PETRI_TRANSITIONS=547} [2025-03-17 11:06:46,629 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 146 predicate places. [2025-03-17 11:06:46,629 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 547 transitions, 2502 flow [2025-03-17 11:06:46,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 349.1764705882353) internal successors, (11872), 34 states have internal predecessors, (11872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:46,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:46,637 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:46,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:06:46,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:46,838 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:46,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1503929267, now seen corresponding path program 2 times [2025-03-17 11:06:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180958062] [2025-03-17 11:06:46,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:06:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:47,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2876 statements into 2 equivalence classes. [2025-03-17 11:06:47,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 2876 statements. [2025-03-17 11:06:47,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:06:47,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52741 trivial. 0 not checked. [2025-03-17 11:06:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180958062] [2025-03-17 11:06:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180958062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008617009] [2025-03-17 11:06:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:47,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:47,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:47,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:47,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-17 11:06:47,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 547 transitions, 2502 flow. Second operand has 6 states, 6 states have (on average 309.5) internal successors, (1857), 6 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:47,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:47,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-17 11:06:47,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:50,947 INFO L124 PetriNetUnfolderBase]: 451/6727 cut-off events. [2025-03-17 11:06:50,947 INFO L125 PetriNetUnfolderBase]: For 2444/2550 co-relation queries the response was YES. [2025-03-17 11:06:50,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10667 conditions, 6727 events. 451/6727 cut-off events. For 2444/2550 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21301 event pairs, 87 based on Foata normal form. 34/6530 useless extension candidates. Maximal degree in co-relation 7262. Up to 1847 conditions per place. [2025-03-17 11:06:50,970 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 108 selfloop transitions, 55 changer transitions 0/608 dead transitions. [2025-03-17 11:06:50,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 608 transitions, 3154 flow [2025-03-17 11:06:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1906 transitions. [2025-03-17 11:06:50,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8727106227106227 [2025-03-17 11:06:50,972 INFO L175 Difference]: Start difference. First operand has 507 places, 547 transitions, 2502 flow. Second operand 6 states and 1906 transitions. [2025-03-17 11:06:50,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 608 transitions, 3154 flow [2025-03-17 11:06:50,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 608 transitions, 3046 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-17 11:06:50,990 INFO L231 Difference]: Finished difference. Result has 499 places, 596 transitions, 2948 flow [2025-03-17 11:06:50,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=2394, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2948, PETRI_PLACES=499, PETRI_TRANSITIONS=596} [2025-03-17 11:06:50,991 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 138 predicate places. [2025-03-17 11:06:50,991 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 596 transitions, 2948 flow [2025-03-17 11:06:50,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.5) internal successors, (1857), 6 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:50,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:50,993 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:50,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:06:50,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting gErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:06:51,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash -496387657, now seen corresponding path program 1 times [2025-03-17 11:06:51,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:51,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125595219] [2025-03-17 11:06:51,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:51,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2882 statements into 1 equivalence classes. [2025-03-17 11:06:51,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2882 of 2882 statements. [2025-03-17 11:06:51,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:51,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-03-17 11:07:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125595219] [2025-03-17 11:07:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125595219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:07:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313236730] [2025-03-17 11:07:01,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:01,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:07:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:07:01,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:07:01,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:07:02,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2882 statements into 1 equivalence classes. [2025-03-17 11:07:03,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2882 of 2882 statements. [2025-03-17 11:07:03,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:03,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:03,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 11563 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:07:03,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:07:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-03-17 11:07:04,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:07:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-03-17 11:07:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313236730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:07:05,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:07:05,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-17 11:07:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065096660] [2025-03-17 11:07:05,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:07:05,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-17 11:07:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:05,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-17 11:07:05,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 11:07:05,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-17 11:07:05,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 596 transitions, 2948 flow. Second operand has 63 states, 63 states have (on average 349.14285714285717) internal successors, (21996), 63 states have internal predecessors, (21996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:07:05,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:05,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-17 11:07:05,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:11,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([843] L1057-3-->L1057: Formula: (and (= (store |v_#pthreadsMutex_32| |v_~#c~0.base_107| (store (select |v_#pthreadsMutex_32| |v_~#c~0.base_107|) (+ |v_~#c~0.offset_107| 104 (* |v_gThread1of1ForFork0_~j~1#1_29| 24)) 0)) |v_#pthreadsMutex_31|) (= |v_gThread1of1ForFork0_#t~ret27#1_1| 0)) InVars {~#c~0.base=|v_~#c~0.base_107|, gThread1of1ForFork0_~j~1#1=|v_gThread1of1ForFork0_~j~1#1_29|, #pthreadsMutex=|v_#pthreadsMutex_32|, ~#c~0.offset=|v_~#c~0.offset_107|} OutVars{~#c~0.base=|v_~#c~0.base_107|, gThread1of1ForFork0_~j~1#1=|v_gThread1of1ForFork0_~j~1#1_29|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#c~0.offset=|v_~#c~0.offset_107|, gThread1of1ForFork0_#t~ret27#1=|v_gThread1of1ForFork0_#t~ret27#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, gThread1of1ForFork0_#t~ret27#1][528], [1810#true, 18#L1037true, Black: 1209#(< |ULTIMATE.start_main_~j~2#1| 30), Black: 426#(<= |ULTIMATE.start_main_~j~2#1| 1), Black: 390#(= |ULTIMATE.start_main_~j~2#1| 0), Black: 1801#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 1804#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 1802#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), Black: 1803#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 1799#true, 26#L1057true, 362#true, 364#true, Black: 1814#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 4374#(and (<= |ULTIMATE.start_main_~j~2#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), 4432#true, Black: 3189#(< |ULTIMATE.start_main_~j~2#1| 29), Black: 4320#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~2#1| 3)), Black: 4326#(and (<= |ULTIMATE.start_main_~j~2#1| 27) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 3461#(< |ULTIMATE.start_main_~j~2#1| 28), Black: 3178#(< |ULTIMATE.start_main_~j~2#1| 30), Black: 4368#(and (<= |ULTIMATE.start_main_~j~2#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4332#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~2#1| 28)), Black: 2937#(<= |ULTIMATE.start_main_~j~2#1| 3), 4421#true, Black: 4362#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~j~2#1| 3)), Black: 4380#(and (<= |ULTIMATE.start_main_~j~2#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4342#(and (= 0 |ULTIMATE.start_main_#t~post31#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 1812#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 4338#(and (<= |ULTIMATE.start_main_~j~2#1| 29) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 4424#(and (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), Black: 10876#(< |ULTIMATE.start_main_~j~2#1| 29), Black: 4423#(= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0), Black: 12236#(< |ULTIMATE.start_main_~j~2#1| 24), Black: 4425#(and (= (select (select |#race| |~#c~0.base|) (+ 2 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), Black: 11148#(< |ULTIMATE.start_main_~j~2#1| 28), Black: 4426#(and (= (select (select |#race| |~#c~0.base|) (+ 3 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), Black: 4448#(<= |ULTIMATE.start_main_~j~2#1| 7), Black: 11420#(< |ULTIMATE.start_main_~j~2#1| 27), Black: 11964#(< |ULTIMATE.start_main_~j~2#1| 25), Black: 10865#(< |ULTIMATE.start_main_~j~2#1| 30), Black: 11692#(< |ULTIMATE.start_main_~j~2#1| 26), Black: 13144#(and (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) |fThread1of1ForFork1_~pos~0#1.offset|) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 1)) 0)), Black: 13143#(= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) |fThread1of1ForFork1_~pos~0#1.offset|) 0), 13152#true, Black: 13145#(and (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) |fThread1of1ForFork1_~pos~0#1.offset|) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 2)) 0)), Black: 13146#(and (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) |fThread1of1ForFork1_~pos~0#1.offset|) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 2)) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 3)) 0)), 254#ULTIMATE.startFINALtrue, 422#true, 13141#true, Black: 380#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-03-17 11:07:11,351 INFO L294 olderBase$Statistics]: this new event has 5664 ancestors and is cut-off event [2025-03-17 11:07:11,351 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-17 11:07:11,351 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-17 11:07:11,351 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-17 11:07:14,425 INFO L124 PetriNetUnfolderBase]: 526/11255 cut-off events. [2025-03-17 11:07:14,425 INFO L125 PetriNetUnfolderBase]: For 15318/15436 co-relation queries the response was YES. [2025-03-17 11:07:14,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15502 conditions, 11255 events. 526/11255 cut-off events. For 15318/15436 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 24679 event pairs, 115 based on Foata normal form. 81/11005 useless extension candidates. Maximal degree in co-relation 12189. Up to 318 conditions per place. [2025-03-17 11:07:14,467 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 92 selfloop transitions, 270 changer transitions 0/802 dead transitions. [2025-03-17 11:07:14,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 802 transitions, 5858 flow [2025-03-17 11:07:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-17 11:07:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-17 11:07:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 31377 transitions. [2025-03-17 11:07:14,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9577838827838828 [2025-03-17 11:07:14,478 INFO L175 Difference]: Start difference. First operand has 499 places, 596 transitions, 2948 flow. Second operand 90 states and 31377 transitions. [2025-03-17 11:07:14,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 802 transitions, 5858 flow [2025-03-17 11:07:14,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 802 transitions, 5858 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:07:14,507 INFO L231 Difference]: Finished difference. Result has 604 places, 734 transitions, 4940 flow [2025-03-17 11:07:14,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=2948, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4940, PETRI_PLACES=604, PETRI_TRANSITIONS=734} [2025-03-17 11:07:14,508 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 243 predicate places. [2025-03-17 11:07:14,508 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 734 transitions, 4940 flow [2025-03-17 11:07:14,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 349.14285714285717) internal successors, (21996), 63 states have internal predecessors, (21996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:07:14,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:14,514 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:14,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:07:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 11:07:14,715 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting gErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:07:14,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1645361129, now seen corresponding path program 2 times [2025-03-17 11:07:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:14,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332594098] [2025-03-17 11:07:14,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:07:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:15,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5582 statements into 2 equivalence classes. [2025-03-17 11:07:15,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 124 of 5582 statements. [2025-03-17 11:07:15,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:07:15,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 213451 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213451 trivial. 0 not checked. [2025-03-17 11:07:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332594098] [2025-03-17 11:07:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332594098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:07:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:07:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:07:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15869614] [2025-03-17 11:07:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:07:15,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:07:15,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:07:15,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:07:15,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:07:16,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-17 11:07:16,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 734 transitions, 4940 flow. Second operand has 6 states, 6 states have (on average 309.6666666666667) internal successors, (1858), 6 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:07:16,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:07:16,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-17 11:07:16,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:07:26,562 INFO L124 PetriNetUnfolderBase]: 567/11118 cut-off events. [2025-03-17 11:07:26,562 INFO L125 PetriNetUnfolderBase]: For 7903/8210 co-relation queries the response was YES. [2025-03-17 11:07:26,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18741 conditions, 11118 events. 567/11118 cut-off events. For 7903/8210 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 24259 event pairs, 84 based on Foata normal form. 112/11013 useless extension candidates. Maximal degree in co-relation 14837. Up to 3244 conditions per place. [2025-03-17 11:07:26,606 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 141 selfloop transitions, 79 changer transitions 0/807 dead transitions. [2025-03-17 11:07:26,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 807 transitions, 5918 flow [2025-03-17 11:07:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:07:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:07:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1902 transitions. [2025-03-17 11:07:26,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8708791208791209 [2025-03-17 11:07:26,610 INFO L175 Difference]: Start difference. First operand has 604 places, 734 transitions, 4940 flow. Second operand 6 states and 1902 transitions. [2025-03-17 11:07:26,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 807 transitions, 5918 flow [2025-03-17 11:07:26,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 807 transitions, 5564 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-17 11:07:26,650 INFO L231 Difference]: Finished difference. Result has 572 places, 799 transitions, 5484 flow [2025-03-17 11:07:26,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=4586, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5484, PETRI_PLACES=572, PETRI_TRANSITIONS=799} [2025-03-17 11:07:26,652 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 211 predicate places. [2025-03-17 11:07:26,652 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 799 transitions, 5484 flow [2025-03-17 11:07:26,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.6666666666667) internal successors, (1858), 6 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:07:26,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:07:26,654 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:07:26,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:07:26,654 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-17 11:07:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:07:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash -663025743, now seen corresponding path program 1 times [2025-03-17 11:07:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:07:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560045280] [2025-03-17 11:07:26,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:07:27,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5584 statements into 1 equivalence classes. [2025-03-17 11:07:28,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5584 of 5584 statements. [2025-03-17 11:07:28,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:07:28,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:07:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 213451 backedges. 0 proven. 108091 refuted. 0 times theorem prover too weak. 105360 trivial. 0 not checked. [2025-03-17 11:07:40,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:07:40,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560045280] [2025-03-17 11:07:40,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560045280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:07:40,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690137545] [2025-03-17 11:07:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:07:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:07:40,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:07:40,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:07:40,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process