./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 798a7b37 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-?-798a7b3-m [2025-03-04 06:47:17,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:47:17,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:47:17,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:47:17,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:47:17,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:47:17,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:47:17,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:47:17,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:47:17,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:47:17,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:47:17,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:47:17,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:47:17,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:47:17,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:47:17,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:47:17,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:47:17,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:47:17,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:47:17,806 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:47:17,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:47:17,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:47:17,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:47:17,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:47:17,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:47:17,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:47:17,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:47:17,806 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-04 06:47:18,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:47:18,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:47:18,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:47:18,052 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:47:18,052 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:47:18,054 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-04 06:47:19,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83912f62/63dddc97c50b420a84567fa8d995c5a5/FLAGa08f210b8 [2025-03-04 06:47:19,491 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:47:19,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i [2025-03-04 06:47:19,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83912f62/63dddc97c50b420a84567fa8d995c5a5/FLAGa08f210b8 [2025-03-04 06:47:19,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83912f62/63dddc97c50b420a84567fa8d995c5a5 [2025-03-04 06:47:19,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:47:19,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:47:19,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:47:19,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:47:19,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:47:19,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:47:19" (1/1) ... [2025-03-04 06:47:19,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a37d937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:19, skipping insertion in model container [2025-03-04 06:47:19,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:47:19" (1/1) ... [2025-03-04 06:47:19,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:47:19,845 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:19,846 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:19,847 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:19,847 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:19,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:47:19,912 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:47:19,950 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:19,951 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:19,951 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:19,952 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:19,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:47:20,010 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:47:20,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20 WrapperNode [2025-03-04 06:47:20,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:47:20,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:47:20,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:47:20,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:47:20,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,069 INFO L138 Inliner]: procedures = 274, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 319 [2025-03-04 06:47:20,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:47:20,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:47:20,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:47:20,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:47:20,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:47:20,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:47:20,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:47:20,113 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:47:20,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (1/1) ... [2025-03-04 06:47:20,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:47:20,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:20,148 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-04 06:47:20,155 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-04 06:47:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-04 06:47:20,176 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-04 06:47:20,177 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-03-04 06:47:20,177 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-03-04 06:47:20,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:47:20,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:47:20,177 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:47:20,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:47:20,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:47:20,177 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:47:20,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:47:20,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:47:20,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:47:20,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:47:20,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:47:20,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:47:20,180 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:47:20,292 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:47:20,294 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:47:20,795 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:47:20,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:47:20,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:47:20,825 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:47:20,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:20 BoogieIcfgContainer [2025-03-04 06:47:20,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:47:20,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:47:20,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:47:20,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:47:20,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:47:19" (1/3) ... [2025-03-04 06:47:20,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9de411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:20, skipping insertion in model container [2025-03-04 06:47:20,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:20" (2/3) ... [2025-03-04 06:47:20,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9de411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:20, skipping insertion in model container [2025-03-04 06:47:20,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:20" (3/3) ... [2025-03-04 06:47:20,834 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_20-arrayloop2_rc.i [2025-03-04 06:47:20,845 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:47:20,847 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-04 06:47:20,847 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:47:20,945 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:47:20,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 364 transitions, 736 flow [2025-03-04 06:47:21,059 INFO L124 PetriNetUnfolderBase]: 8/362 cut-off events. [2025-03-04 06:47:21,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:21,075 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 600 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-04 06:47:21,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 363 places, 364 transitions, 736 flow [2025-03-04 06:47:21,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 362 transitions, 730 flow [2025-03-04 06:47:21,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:47:21,102 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;@404ec823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:47:21,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 06:47:21,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:47:21,127 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-04 06:47:21,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:21,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:21,128 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-04 06:47:21,128 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-04 06:47:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2068048128, now seen corresponding path program 1 times [2025-03-04 06:47:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:21,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122628502] [2025-03-04 06:47:21,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:21,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 06:47:21,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 06:47:21,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:21,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:21,866 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-04 06:47:21,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:21,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122628502] [2025-03-04 06:47:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122628502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:21,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:21,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534994666] [2025-03-04 06:47:21,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:21,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:21,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:21,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:22,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 364 [2025-03-04 06:47:22,238 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-04 06:47:22,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:22,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 364 [2025-03-04 06:47:22,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:22,616 INFO L124 PetriNetUnfolderBase]: 449/1836 cut-off events. [2025-03-04 06:47:22,616 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 06:47:22,625 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 11587 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-04 06:47:22,633 INFO L140 encePairwiseOnDemand]: 350/364 looper letters, 72 selfloop transitions, 10 changer transitions 0/358 dead transitions. [2025-03-04 06:47:22,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 358 transitions, 886 flow [2025-03-04 06:47:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2025-03-04 06:47:22,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8031135531135531 [2025-03-04 06:47:22,651 INFO L175 Difference]: Start difference. First operand has 361 places, 362 transitions, 730 flow. Second operand 6 states and 1754 transitions. [2025-03-04 06:47:22,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 358 transitions, 886 flow [2025-03-04 06:47:22,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 358 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:47:22,660 INFO L231 Difference]: Finished difference. Result has 362 places, 358 transitions, 740 flow [2025-03-04 06:47:22,662 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-04 06:47:22,666 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 1 predicate places. [2025-03-04 06:47:22,666 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 358 transitions, 740 flow [2025-03-04 06:47:22,667 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-04 06:47:22,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:22,667 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-04 06:47:22,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:47:22,668 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-04 06:47:22,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1894170758, now seen corresponding path program 1 times [2025-03-04 06:47:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:22,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892453367] [2025-03-04 06:47:22,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:22,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:47:22,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:47:22,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:22,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:23,058 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-04 06:47:23,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892453367] [2025-03-04 06:47:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892453367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:23,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:23,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:23,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261970455] [2025-03-04 06:47:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:23,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:23,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:23,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:23,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 364 [2025-03-04 06:47:23,466 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-04 06:47:23,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:23,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 364 [2025-03-04 06:47:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:23,748 INFO L124 PetriNetUnfolderBase]: 449/1834 cut-off events. [2025-03-04 06:47:23,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:23,751 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 11501 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-04 06:47:23,757 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 72 selfloop transitions, 10 changer transitions 0/356 dead transitions. [2025-03-04 06:47:23,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 356 transitions, 900 flow [2025-03-04 06:47:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1752 transitions. [2025-03-04 06:47:23,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2025-03-04 06:47:23,760 INFO L175 Difference]: Start difference. First operand has 362 places, 358 transitions, 740 flow. Second operand 6 states and 1752 transitions. [2025-03-04 06:47:23,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 356 transitions, 900 flow [2025-03-04 06:47:23,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 356 transitions, 880 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:23,765 INFO L231 Difference]: Finished difference. Result has 360 places, 356 transitions, 736 flow [2025-03-04 06:47:23,765 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-04 06:47:23,766 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -1 predicate places. [2025-03-04 06:47:23,766 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 356 transitions, 736 flow [2025-03-04 06:47:23,767 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-04 06:47:23,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:23,767 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-04 06:47:23,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:47:23,767 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-04 06:47:23,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:23,768 INFO L85 PathProgramCache]: Analyzing trace with hash -141291894, now seen corresponding path program 1 times [2025-03-04 06:47:23,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:23,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719563768] [2025-03-04 06:47:23,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:23,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:23,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:47:23,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:47:23,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:23,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:23,865 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-04 06:47:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719563768] [2025-03-04 06:47:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719563768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:23,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:23,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429039966] [2025-03-04 06:47:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:23,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:23,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:23,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:23,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 364 [2025-03-04 06:47:23,883 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-04 06:47:23,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:23,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 364 [2025-03-04 06:47:23,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:23,955 INFO L124 PetriNetUnfolderBase]: 29/658 cut-off events. [2025-03-04 06:47:23,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:23,956 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 2408 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-04 06:47:23,958 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-04 06:47:23,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 357 transitions, 764 flow [2025-03-04 06:47:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:47:23,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-03-04 06:47:23,960 INFO L175 Difference]: Start difference. First operand has 360 places, 356 transitions, 736 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:47:23,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 357 transitions, 764 flow [2025-03-04 06:47:23,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 357 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:23,966 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 728 flow [2025-03-04 06:47:23,967 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-04 06:47:23,967 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -3 predicate places. [2025-03-04 06:47:23,967 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 728 flow [2025-03-04 06:47:23,968 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-04 06:47:23,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:23,968 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-04 06:47:23,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:47:23,968 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-04 06:47:23,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1975673617, now seen corresponding path program 1 times [2025-03-04 06:47:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:23,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099667054] [2025-03-04 06:47:23,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:23,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 06:47:23,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 06:47:23,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:23,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:24,415 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-04 06:47:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:24,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099667054] [2025-03-04 06:47:24,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099667054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:24,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:24,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010305166] [2025-03-04 06:47:24,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:24,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:24,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:24,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:24,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:24,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 364 [2025-03-04 06:47:24,767 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-04 06:47:24,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:24,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 364 [2025-03-04 06:47:24,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:24,944 INFO L124 PetriNetUnfolderBase]: 450/1956 cut-off events. [2025-03-04 06:47:24,944 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:47:24,948 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 12265 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-04 06:47:24,953 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-04 06:47:24,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 356 transitions, 894 flow [2025-03-04 06:47:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1747 transitions. [2025-03-04 06:47:24,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.799908424908425 [2025-03-04 06:47:24,956 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 728 flow. Second operand 6 states and 1747 transitions. [2025-03-04 06:47:24,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 356 transitions, 894 flow [2025-03-04 06:47:24,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 356 transitions, 892 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:24,960 INFO L231 Difference]: Finished difference. Result has 361 places, 356 transitions, 734 flow [2025-03-04 06:47:24,961 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-04 06:47:24,961 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 0 predicate places. [2025-03-04 06:47:24,961 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 356 transitions, 734 flow [2025-03-04 06:47:24,962 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-04 06:47:24,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:24,962 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-04 06:47:24,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:47:24,962 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-04 06:47:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1196763920, now seen corresponding path program 1 times [2025-03-04 06:47:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169553492] [2025-03-04 06:47:24,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:24,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 06:47:24,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 06:47:24,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:24,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:25,033 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-04 06:47:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:25,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169553492] [2025-03-04 06:47:25,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169553492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:25,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:25,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:25,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256356135] [2025-03-04 06:47:25,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:25,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:25,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:25,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:25,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:25,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 364 [2025-03-04 06:47:25,047 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-04 06:47:25,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:25,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 364 [2025-03-04 06:47:25,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:25,130 INFO L124 PetriNetUnfolderBase]: 29/844 cut-off events. [2025-03-04 06:47:25,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:25,132 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 2403 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-04 06:47:25,133 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-04 06:47:25,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 762 flow [2025-03-04 06:47:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-04 06:47:25,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-03-04 06:47:25,136 INFO L175 Difference]: Start difference. First operand has 361 places, 356 transitions, 734 flow. Second operand 3 states and 1064 transitions. [2025-03-04 06:47:25,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 762 flow [2025-03-04 06:47:25,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 752 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:25,139 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 736 flow [2025-03-04 06:47:25,140 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-04 06:47:25,140 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -2 predicate places. [2025-03-04 06:47:25,140 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 736 flow [2025-03-04 06:47:25,141 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-04 06:47:25,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:25,141 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-04 06:47:25,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:47:25,142 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-04 06:47:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1695554020, now seen corresponding path program 1 times [2025-03-04 06:47:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652247296] [2025-03-04 06:47:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:25,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 06:47:25,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 06:47:25,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:25,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:25,622 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-04 06:47:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652247296] [2025-03-04 06:47:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652247296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500322088] [2025-03-04 06:47:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:25,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:25,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:25,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:25,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-04 06:47:25,999 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-04 06:47:25,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:25,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-04 06:47:25,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:26,161 INFO L124 PetriNetUnfolderBase]: 75/1156 cut-off events. [2025-03-04 06:47:26,161 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:47:26,164 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 4593 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-04 06:47:26,167 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 54 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-04 06:47:26,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 356 transitions, 852 flow [2025-03-04 06:47:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1872 transitions. [2025-03-04 06:47:26,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-04 06:47:26,171 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 736 flow. Second operand 6 states and 1872 transitions. [2025-03-04 06:47:26,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 356 transitions, 852 flow [2025-03-04 06:47:26,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 356 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:26,178 INFO L231 Difference]: Finished difference. Result has 362 places, 356 transitions, 742 flow [2025-03-04 06:47:26,178 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-04 06:47:26,180 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 1 predicate places. [2025-03-04 06:47:26,180 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 356 transitions, 742 flow [2025-03-04 06:47:26,181 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-04 06:47:26,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:26,181 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-04 06:47:26,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:47:26,181 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-04 06:47:26,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:26,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2077865117, now seen corresponding path program 1 times [2025-03-04 06:47:26,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:26,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85181987] [2025-03-04 06:47:26,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:26,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:26,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 06:47:26,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 06:47:26,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:26,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:47:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85181987] [2025-03-04 06:47:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85181987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:26,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516011257] [2025-03-04 06:47:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:26,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:26,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:26,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 364 [2025-03-04 06:47:26,976 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-04 06:47:26,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:26,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 364 [2025-03-04 06:47:26,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:27,182 INFO L124 PetriNetUnfolderBase]: 450/2136 cut-off events. [2025-03-04 06:47:27,183 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:27,186 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 12255 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-04 06:47:27,190 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 79 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-03-04 06:47:27,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 355 transitions, 908 flow [2025-03-04 06:47:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1747 transitions. [2025-03-04 06:47:27,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.799908424908425 [2025-03-04 06:47:27,194 INFO L175 Difference]: Start difference. First operand has 362 places, 356 transitions, 742 flow. Second operand 6 states and 1747 transitions. [2025-03-04 06:47:27,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 355 transitions, 908 flow [2025-03-04 06:47:27,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 355 transitions, 898 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:27,198 INFO L231 Difference]: Finished difference. Result has 361 places, 355 transitions, 740 flow [2025-03-04 06:47:27,198 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-04 06:47:27,199 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 0 predicate places. [2025-03-04 06:47:27,199 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 355 transitions, 740 flow [2025-03-04 06:47:27,200 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-04 06:47:27,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:27,201 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-04 06:47:27,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:47:27,201 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-04 06:47:27,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1400158045, now seen corresponding path program 1 times [2025-03-04 06:47:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:27,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624145743] [2025-03-04 06:47:27,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:27,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 06:47:27,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 06:47:27,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:27,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:47:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624145743] [2025-03-04 06:47:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624145743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45922555] [2025-03-04 06:47:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:27,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:27,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:27,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:27,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 364 [2025-03-04 06:47:27,887 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-04 06:47:27,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:27,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 364 [2025-03-04 06:47:27,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:28,145 INFO L124 PetriNetUnfolderBase]: 450/2132 cut-off events. [2025-03-04 06:47:28,145 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:28,150 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 12220 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-04 06:47:28,157 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2025-03-04 06:47:28,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 354 transitions, 898 flow [2025-03-04 06:47:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1767 transitions. [2025-03-04 06:47:28,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090659340659341 [2025-03-04 06:47:28,160 INFO L175 Difference]: Start difference. First operand has 361 places, 355 transitions, 740 flow. Second operand 6 states and 1767 transitions. [2025-03-04 06:47:28,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 354 transitions, 898 flow [2025-03-04 06:47:28,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 354 transitions, 888 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:28,165 INFO L231 Difference]: Finished difference. Result has 360 places, 354 transitions, 738 flow [2025-03-04 06:47:28,166 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-04 06:47:28,168 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -1 predicate places. [2025-03-04 06:47:28,168 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 354 transitions, 738 flow [2025-03-04 06:47:28,169 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-04 06:47:28,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:28,169 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-04 06:47:28,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:47:28,169 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-04 06:47:28,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1957155011, now seen corresponding path program 1 times [2025-03-04 06:47:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:28,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144533409] [2025-03-04 06:47:28,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:28,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 06:47:28,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 06:47:28,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:28,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:28,568 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-04 06:47:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:28,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144533409] [2025-03-04 06:47:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144533409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:28,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:28,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620429718] [2025-03-04 06:47:28,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:28,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:28,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:28,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:28,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 364 [2025-03-04 06:47:28,906 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-04 06:47:28,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:28,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 364 [2025-03-04 06:47:28,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:29,169 INFO L124 PetriNetUnfolderBase]: 450/2128 cut-off events. [2025-03-04 06:47:29,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:29,172 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 12238 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-04 06:47:29,178 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2025-03-04 06:47:29,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 353 transitions, 896 flow [2025-03-04 06:47:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1767 transitions. [2025-03-04 06:47:29,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090659340659341 [2025-03-04 06:47:29,182 INFO L175 Difference]: Start difference. First operand has 360 places, 354 transitions, 738 flow. Second operand 6 states and 1767 transitions. [2025-03-04 06:47:29,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 353 transitions, 896 flow [2025-03-04 06:47:29,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 353 transitions, 886 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:29,187 INFO L231 Difference]: Finished difference. Result has 359 places, 353 transitions, 736 flow [2025-03-04 06:47:29,187 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-04 06:47:29,188 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -2 predicate places. [2025-03-04 06:47:29,188 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 353 transitions, 736 flow [2025-03-04 06:47:29,189 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-04 06:47:29,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:29,189 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-04 06:47:29,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:47:29,189 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-04 06:47:29,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash -450761053, now seen corresponding path program 1 times [2025-03-04 06:47:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:29,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173388057] [2025-03-04 06:47:29,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:29,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:29,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 06:47:29,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 06:47:29,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:29,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:47:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:29,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173388057] [2025-03-04 06:47:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173388057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:29,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:29,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544911167] [2025-03-04 06:47:29,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:29,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:29,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:29,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:29,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 364 [2025-03-04 06:47:29,783 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-04 06:47:29,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:29,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 364 [2025-03-04 06:47:29,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:30,016 INFO L124 PetriNetUnfolderBase]: 450/2124 cut-off events. [2025-03-04 06:47:30,016 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:30,021 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 12162 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-04 06:47:30,025 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 80 selfloop transitions, 5 changer transitions 0/352 dead transitions. [2025-03-04 06:47:30,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 352 transitions, 904 flow [2025-03-04 06:47:30,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1742 transitions. [2025-03-04 06:47:30,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7976190476190477 [2025-03-04 06:47:30,029 INFO L175 Difference]: Start difference. First operand has 359 places, 353 transitions, 736 flow. Second operand 6 states and 1742 transitions. [2025-03-04 06:47:30,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 352 transitions, 904 flow [2025-03-04 06:47:30,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 352 transitions, 894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:30,034 INFO L231 Difference]: Finished difference. Result has 358 places, 352 transitions, 734 flow [2025-03-04 06:47:30,034 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-04 06:47:30,035 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -3 predicate places. [2025-03-04 06:47:30,036 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 352 transitions, 734 flow [2025-03-04 06:47:30,036 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-04 06:47:30,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:30,037 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-04 06:47:30,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:47:30,037 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-04 06:47:30,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1495623850, now seen corresponding path program 1 times [2025-03-04 06:47:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:30,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544242531] [2025-03-04 06:47:30,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:30,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-04 06:47:30,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-04 06:47:30,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:30,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:47:30,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544242531] [2025-03-04 06:47:30,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544242531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690876365] [2025-03-04 06:47:30,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:30,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:30,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:30,206 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-04 06:47:30,208 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-04 06:47:30,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-04 06:47:30,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-04 06:47:30,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:30,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:30,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:47:30,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:47:30,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:47:30,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690876365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:30,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:30,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:47:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213595582] [2025-03-04 06:47:30,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:30,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:47:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:30,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:47:30,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:47:30,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-04 06:47:30,707 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-04 06:47:30,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:30,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-04 06:47:30,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:30,867 INFO L124 PetriNetUnfolderBase]: 29/1008 cut-off events. [2025-03-04 06:47:30,867 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:47:30,868 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 1826 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-04 06:47:30,870 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 15 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2025-03-04 06:47:30,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 800 flow [2025-03-04 06:47:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:47:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:47:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3149 transitions. [2025-03-04 06:47:30,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9612332112332113 [2025-03-04 06:47:30,875 INFO L175 Difference]: Start difference. First operand has 358 places, 352 transitions, 734 flow. Second operand 9 states and 3149 transitions. [2025-03-04 06:47:30,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 800 flow [2025-03-04 06:47:30,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 360 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:30,879 INFO L231 Difference]: Finished difference. Result has 364 places, 358 transitions, 774 flow [2025-03-04 06:47:30,880 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-04 06:47:30,880 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 3 predicate places. [2025-03-04 06:47:30,880 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 358 transitions, 774 flow [2025-03-04 06:47:30,881 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-04 06:47:30,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:30,881 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-04 06:47:30,890 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-04 06:47:31,082 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-04 06:47:31,082 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-04 06:47:31,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 791187038, now seen corresponding path program 2 times [2025-03-04 06:47:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190636705] [2025-03-04 06:47:31,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:31,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-03-04 06:47:31,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 407 statements. [2025-03-04 06:47:31,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:31,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-03-04 06:47:31,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:31,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190636705] [2025-03-04 06:47:31,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190636705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:31,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:31,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823441684] [2025-03-04 06:47:31,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:31,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:31,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:31,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:32,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 364 [2025-03-04 06:47:32,125 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-04 06:47:32,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:32,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 364 [2025-03-04 06:47:32,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:32,403 INFO L124 PetriNetUnfolderBase]: 199/1909 cut-off events. [2025-03-04 06:47:32,403 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:47:32,406 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 8846 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-04 06:47:32,412 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 71 selfloop transitions, 23 changer transitions 0/393 dead transitions. [2025-03-04 06:47:32,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 393 transitions, 1040 flow [2025-03-04 06:47:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1913 transitions. [2025-03-04 06:47:32,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8759157509157509 [2025-03-04 06:47:32,417 INFO L175 Difference]: Start difference. First operand has 364 places, 358 transitions, 774 flow. Second operand 6 states and 1913 transitions. [2025-03-04 06:47:32,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 393 transitions, 1040 flow [2025-03-04 06:47:32,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 393 transitions, 1034 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:32,422 INFO L231 Difference]: Finished difference. Result has 373 places, 380 transitions, 926 flow [2025-03-04 06:47:32,423 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-04 06:47:32,423 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 12 predicate places. [2025-03-04 06:47:32,423 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 380 transitions, 926 flow [2025-03-04 06:47:32,424 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-04 06:47:32,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:32,424 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-04 06:47:32,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:47:32,425 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-04 06:47:32,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:32,426 INFO L85 PathProgramCache]: Analyzing trace with hash 745624649, now seen corresponding path program 1 times [2025-03-04 06:47:32,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:32,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712650789] [2025-03-04 06:47:32,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:32,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:32,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-04 06:47:32,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-04 06:47:32,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:32,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-03-04 06:47:32,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712650789] [2025-03-04 06:47:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712650789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296651378] [2025-03-04 06:47:32,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:32,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:32,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:32,761 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-04 06:47:32,762 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-04 06:47:32,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-04 06:47:33,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-04 06:47:33,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:33,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:33,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:47:33,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 1 proven. 441 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 06:47:33,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 1 proven. 441 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 06:47:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296651378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:33,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 06:47:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608361299] [2025-03-04 06:47:33,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:33,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 06:47:33,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:33,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 06:47:33,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 06:47:33,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 364 [2025-03-04 06:47:33,856 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-04 06:47:33,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:33,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 364 [2025-03-04 06:47:33,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:35,224 INFO L124 PetriNetUnfolderBase]: 186/3447 cut-off events. [2025-03-04 06:47:35,224 INFO L125 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2025-03-04 06:47:35,229 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 9473 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-04 06:47:35,232 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 47 selfloop transitions, 68 changer transitions 0/466 dead transitions. [2025-03-04 06:47:35,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 466 transitions, 1566 flow [2025-03-04 06:47:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 06:47:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-04 06:47:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 21611 transitions. [2025-03-04 06:47:35,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.942394906680621 [2025-03-04 06:47:35,247 INFO L175 Difference]: Start difference. First operand has 373 places, 380 transitions, 926 flow. Second operand 63 states and 21611 transitions. [2025-03-04 06:47:35,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 466 transitions, 1566 flow [2025-03-04 06:47:35,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 466 transitions, 1566 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:35,254 INFO L231 Difference]: Finished difference. Result has 451 places, 442 transitions, 1446 flow [2025-03-04 06:47:35,254 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-04 06:47:35,255 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 90 predicate places. [2025-03-04 06:47:35,255 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 442 transitions, 1446 flow [2025-03-04 06:47:35,256 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-04 06:47:35,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:35,257 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-04 06:47:35,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:47:35,457 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-04 06:47:35,458 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-04 06:47:35,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash 132973045, now seen corresponding path program 2 times [2025-03-04 06:47:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71746522] [2025-03-04 06:47:35,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:35,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1432 statements into 2 equivalence classes. [2025-03-04 06:47:35,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1432 statements. [2025-03-04 06:47:35,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:35,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13737 trivial. 0 not checked. [2025-03-04 06:47:35,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:35,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71746522] [2025-03-04 06:47:35,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71746522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:35,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:35,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584475917] [2025-03-04 06:47:35,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:35,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:35,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:35,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:36,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 364 [2025-03-04 06:47:36,493 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-04 06:47:36,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:36,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 364 [2025-03-04 06:47:36,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:37,530 INFO L124 PetriNetUnfolderBase]: 311/4003 cut-off events. [2025-03-04 06:47:37,530 INFO L125 PetriNetUnfolderBase]: For 702/738 co-relation queries the response was YES. [2025-03-04 06:47:37,537 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 15654 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-04 06:47:37,542 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 84 selfloop transitions, 31 changer transitions 0/481 dead transitions. [2025-03-04 06:47:37,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 481 transitions, 1796 flow [2025-03-04 06:47:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1909 transitions. [2025-03-04 06:47:37,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8740842490842491 [2025-03-04 06:47:37,544 INFO L175 Difference]: Start difference. First operand has 451 places, 442 transitions, 1446 flow. Second operand 6 states and 1909 transitions. [2025-03-04 06:47:37,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 481 transitions, 1796 flow [2025-03-04 06:47:37,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 481 transitions, 1720 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 06:47:37,554 INFO L231 Difference]: Finished difference. Result has 454 places, 472 transitions, 1628 flow [2025-03-04 06:47:37,554 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-04 06:47:37,555 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 93 predicate places. [2025-03-04 06:47:37,555 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 472 transitions, 1628 flow [2025-03-04 06:47:37,555 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-04 06:47:37,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:37,556 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-04 06:47:37,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:47:37,556 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-04 06:47:37,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1337820178, now seen corresponding path program 1 times [2025-03-04 06:47:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:37,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070452136] [2025-03-04 06:47:37,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:37,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1436 statements into 1 equivalence classes. [2025-03-04 06:47:37,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1436 of 1436 statements. [2025-03-04 06:47:37,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:37,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13737 backedges. 7194 proven. 3073 refuted. 0 times theorem prover too weak. 3470 trivial. 0 not checked. [2025-03-04 06:47:40,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070452136] [2025-03-04 06:47:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070452136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055220382] [2025-03-04 06:47:40,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:40,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:40,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:40,176 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-04 06:47:40,178 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-04 06:47:40,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1436 statements into 1 equivalence classes. [2025-03-04 06:47:41,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1436 of 1436 statements. [2025-03-04 06:47:41,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:41,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:41,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 5657 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:47:41,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13737 backedges. 7194 proven. 3073 refuted. 0 times theorem prover too weak. 3470 trivial. 0 not checked. [2025-03-04 06:47:41,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13737 backedges. 7194 proven. 3073 refuted. 0 times theorem prover too weak. 3470 trivial. 0 not checked. [2025-03-04 06:47:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055220382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:42,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:42,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 06:47:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509444857] [2025-03-04 06:47:42,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:42,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:47:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:42,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:47:42,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:47:42,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-04 06:47:42,411 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-04 06:47:42,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:42,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-04 06:47:42,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:44,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([845] 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: 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: 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: 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, 362#true, 254#ULTIMATE.startFINALtrue, 422#true, 364#true, 25#L1057true, 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-04 06:47:44,691 INFO L294 olderBase$Statistics]: this new event has 2964 ancestors and is cut-off event [2025-03-04 06:47:44,691 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-04 06:47:44,691 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-04 06:47:44,691 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-04 06:47:45,549 INFO L124 PetriNetUnfolderBase]: 340/6473 cut-off events. [2025-03-04 06:47:45,550 INFO L125 PetriNetUnfolderBase]: For 3586/3604 co-relation queries the response was YES. [2025-03-04 06:47:45,559 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 17990 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-04 06:47:45,565 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 47 selfloop transitions, 135 changer transitions 0/573 dead transitions. [2025-03-04 06:47:45,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 573 transitions, 2756 flow [2025-03-04 06:47:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 06:47:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 06:47:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 15695 transitions. [2025-03-04 06:47:45,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581807081807082 [2025-03-04 06:47:45,571 INFO L175 Difference]: Start difference. First operand has 454 places, 472 transitions, 1628 flow. Second operand 45 states and 15695 transitions. [2025-03-04 06:47:45,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 573 transitions, 2756 flow [2025-03-04 06:47:45,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 573 transitions, 2756 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:45,584 INFO L231 Difference]: Finished difference. Result has 507 places, 547 transitions, 2502 flow [2025-03-04 06:47:45,584 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-04 06:47:45,585 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 146 predicate places. [2025-03-04 06:47:45,585 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 547 transitions, 2502 flow [2025-03-04 06:47:45,588 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-04 06:47:45,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:45,589 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-04 06:47:45,605 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-04 06:47:45,789 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-04 06:47:45,790 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-04 06:47:45,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash -234706414, now seen corresponding path program 2 times [2025-03-04 06:47:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:45,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596130427] [2025-03-04 06:47:45,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:46,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2876 statements into 2 equivalence classes. [2025-03-04 06:47:46,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 2876 statements. [2025-03-04 06:47:46,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:46,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 64441 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64441 trivial. 0 not checked. [2025-03-04 06:47:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596130427] [2025-03-04 06:47:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596130427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:46,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801074005] [2025-03-04 06:47:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:46,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:46,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:46,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:46,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-04 06:47:46,809 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-04 06:47:46,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:46,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-04 06:47:46,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:50,180 INFO L124 PetriNetUnfolderBase]: 451/6727 cut-off events. [2025-03-04 06:47:50,180 INFO L125 PetriNetUnfolderBase]: For 2444/2550 co-relation queries the response was YES. [2025-03-04 06:47:50,193 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 21332 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-04 06:47:50,204 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 108 selfloop transitions, 55 changer transitions 0/608 dead transitions. [2025-03-04 06:47:50,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 608 transitions, 3154 flow [2025-03-04 06:47:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1906 transitions. [2025-03-04 06:47:50,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8727106227106227 [2025-03-04 06:47:50,206 INFO L175 Difference]: Start difference. First operand has 507 places, 547 transitions, 2502 flow. Second operand 6 states and 1906 transitions. [2025-03-04 06:47:50,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 608 transitions, 3154 flow [2025-03-04 06:47:50,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 608 transitions, 3046 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-04 06:47:50,226 INFO L231 Difference]: Finished difference. Result has 499 places, 596 transitions, 2948 flow [2025-03-04 06:47:50,227 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-04 06:47:50,227 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 138 predicate places. [2025-03-04 06:47:50,227 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 596 transitions, 2948 flow [2025-03-04 06:47:50,228 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-04 06:47:50,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:50,228 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-04 06:47:50,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:47:50,229 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-04 06:47:50,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash 121520061, now seen corresponding path program 1 times [2025-03-04 06:47:50,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:50,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620719030] [2025-03-04 06:47:50,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:50,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:50,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2882 statements into 1 equivalence classes. [2025-03-04 06:47:50,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2882 of 2882 statements. [2025-03-04 06:47:50,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:50,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 64441 backedges. 32906 proven. 15345 refuted. 0 times theorem prover too weak. 16190 trivial. 0 not checked. [2025-03-04 06:48:00,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:00,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620719030] [2025-03-04 06:48:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620719030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:48:00,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123392145] [2025-03-04 06:48:00,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:00,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:48:00,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:48:00,372 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-04 06:48:00,374 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-04 06:48:01,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2882 statements into 1 equivalence classes. [2025-03-04 06:48:02,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2882 of 2882 statements. [2025-03-04 06:48:02,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:02,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:02,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 11563 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:48:02,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:48:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 64441 backedges. 32906 proven. 15345 refuted. 0 times theorem prover too weak. 16190 trivial. 0 not checked. [2025-03-04 06:48:03,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:48:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 64441 backedges. 32906 proven. 15345 refuted. 0 times theorem prover too weak. 16190 trivial. 0 not checked. [2025-03-04 06:48:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123392145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:48:04,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:48:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-04 06:48:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721536216] [2025-03-04 06:48:04,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:48:04,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 06:48:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:48:04,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 06:48:04,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 06:48:04,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-04 06:48:04,817 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-04 06:48:04,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:48:04,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-04 06:48:04,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:11,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([845] 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, 362#true, 364#true, 25#L1057true, 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-04 06:48:11,541 INFO L294 olderBase$Statistics]: this new event has 5664 ancestors and is cut-off event [2025-03-04 06:48:11,541 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-04 06:48:11,541 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-04 06:48:11,542 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-04 06:48:14,499 INFO L124 PetriNetUnfolderBase]: 526/11255 cut-off events. [2025-03-04 06:48:14,499 INFO L125 PetriNetUnfolderBase]: For 15318/15436 co-relation queries the response was YES. [2025-03-04 06:48:14,519 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 24676 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-04 06:48:14,531 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 92 selfloop transitions, 270 changer transitions 0/802 dead transitions. [2025-03-04 06:48:14,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 802 transitions, 5858 flow [2025-03-04 06:48:14,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 06:48:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-04 06:48:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 31377 transitions. [2025-03-04 06:48:14,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9577838827838828 [2025-03-04 06:48:14,547 INFO L175 Difference]: Start difference. First operand has 499 places, 596 transitions, 2948 flow. Second operand 90 states and 31377 transitions. [2025-03-04 06:48:14,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 802 transitions, 5858 flow [2025-03-04 06:48:14,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 802 transitions, 5858 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:48:14,579 INFO L231 Difference]: Finished difference. Result has 604 places, 734 transitions, 4940 flow [2025-03-04 06:48:14,580 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-04 06:48:14,580 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 243 predicate places. [2025-03-04 06:48:14,580 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 734 transitions, 4940 flow [2025-03-04 06:48:14,585 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-04 06:48:14,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:14,587 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-04 06:48:14,615 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-04 06:48:14,787 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-04 06:48:14,788 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-04 06:48:14,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash -997034115, now seen corresponding path program 2 times [2025-03-04 06:48:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:14,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718774856] [2025-03-04 06:48:14,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:48:14,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:15,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5582 statements into 2 equivalence classes. [2025-03-04 06:48:15,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 124 of 5582 statements. [2025-03-04 06:48:15,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:48:15,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 260251 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260251 trivial. 0 not checked. [2025-03-04 06:48:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:15,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718774856] [2025-03-04 06:48:15,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718774856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:48:15,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:48:15,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:48:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980501732] [2025-03-04 06:48:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:48:15,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:48:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:48:15,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:48:15,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:48:16,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-04 06:48:16,089 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-04 06:48:16,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:48:16,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-04 06:48:16,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:26,339 INFO L124 PetriNetUnfolderBase]: 567/11118 cut-off events. [2025-03-04 06:48:26,339 INFO L125 PetriNetUnfolderBase]: For 7903/8210 co-relation queries the response was YES. [2025-03-04 06:48:26,360 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 24232 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-04 06:48:26,372 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 141 selfloop transitions, 79 changer transitions 0/807 dead transitions. [2025-03-04 06:48:26,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 807 transitions, 5918 flow [2025-03-04 06:48:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:48:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:48:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1902 transitions. [2025-03-04 06:48:26,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8708791208791209 [2025-03-04 06:48:26,374 INFO L175 Difference]: Start difference. First operand has 604 places, 734 transitions, 4940 flow. Second operand 6 states and 1902 transitions. [2025-03-04 06:48:26,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 807 transitions, 5918 flow [2025-03-04 06:48:26,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 807 transitions, 5564 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-04 06:48:26,412 INFO L231 Difference]: Finished difference. Result has 572 places, 799 transitions, 5484 flow [2025-03-04 06:48:26,413 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-04 06:48:26,413 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 211 predicate places. [2025-03-04 06:48:26,413 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 799 transitions, 5484 flow [2025-03-04 06:48:26,414 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-04 06:48:26,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:26,415 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-04 06:48:26,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:48:26,416 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-04 06:48:26,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash 254751446, now seen corresponding path program 1 times [2025-03-04 06:48:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310799235] [2025-03-04 06:48:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:27,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5584 statements into 1 equivalence classes. [2025-03-04 06:48:27,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5584 of 5584 statements. [2025-03-04 06:48:27,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:27,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 260251 backedges. 0 proven. 131491 refuted. 0 times theorem prover too weak. 128760 trivial. 0 not checked. [2025-03-04 06:48:40,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310799235] [2025-03-04 06:48:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310799235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:48:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133528981] [2025-03-04 06:48:40,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:40,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:48:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:48:40,437 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-04 06:48:40,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process