./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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_21-arrayloop2_nr.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 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:37:22,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:37:22,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:37:22,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:37:22,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:37:22,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:37:22,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:37:22,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:37:22,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:37:22,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:37:22,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:37:22,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:37:22,858 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:37:22,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:37:22,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:37:22,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:37:22,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:37:22,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:37:22,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:22,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:37:22,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:37:22,861 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 -> 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e [2025-03-14 01:37:23,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:37:23,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:37:23,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:37:23,088 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:37:23,088 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:37:23,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2025-03-14 01:37:24,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2368973/ab50741c16f14f62b2c88870833ad0c8/FLAG8749cf7bf [2025-03-14 01:37:24,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:37:24,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2025-03-14 01:37:24,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2368973/ab50741c16f14f62b2c88870833ad0c8/FLAG8749cf7bf [2025-03-14 01:37:24,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2368973/ab50741c16f14f62b2c88870833ad0c8 [2025-03-14 01:37:24,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:37:24,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:37:24,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:24,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:37:24,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:37:24,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:24" (1/1) ... [2025-03-14 01:37:24,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234b8bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:24, skipping insertion in model container [2025-03-14 01:37:24,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:24" (1/1) ... [2025-03-14 01:37:24,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:37:25,078 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:25,078 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:25,079 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:25,079 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:25,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:25,122 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:37:25,172 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:25,173 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:25,173 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:25,173 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:25,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:25,227 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:37:25,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25 WrapperNode [2025-03-14 01:37:25,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:25,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:25,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:37:25,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:37:25,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,262 INFO L138 Inliner]: procedures = 273, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 259 [2025-03-14 01:37:25,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:25,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:37:25,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:37:25,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:37:25,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:37:25,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:37:25,295 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:37:25,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:37:25,296 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (1/1) ... [2025-03-14 01:37:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:25,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:25,319 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-14 01:37:25,322 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-14 01:37:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-14 01:37:25,338 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-14 01:37:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:37:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:37:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:37:25,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:37:25,340 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:37:25,450 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:37:25,452 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:37:25,811 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:37:25,812 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:37:25,812 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:37:25,832 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:37:25,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:25 BoogieIcfgContainer [2025-03-14 01:37:25,832 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:37:25,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:37:25,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:37:25,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:37:25,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:37:24" (1/3) ... [2025-03-14 01:37:25,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a73a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:25, skipping insertion in model container [2025-03-14 01:37:25,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:25" (2/3) ... [2025-03-14 01:37:25,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a73a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:25, skipping insertion in model container [2025-03-14 01:37:25,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:25" (3/3) ... [2025-03-14 01:37:25,839 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_21-arrayloop2_nr.i [2025-03-14 01:37:25,849 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:37:25,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_21-arrayloop2_nr.i that has 2 procedures, 291 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-03-14 01:37:25,852 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:37:25,965 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:37:25,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 364 transitions, 736 flow [2025-03-14 01:37:26,087 INFO L124 PetriNetUnfolderBase]: 8/362 cut-off events. [2025-03-14 01:37:26,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:26,097 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 597 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-14 01:37:26,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 363 places, 364 transitions, 736 flow [2025-03-14 01:37:26,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 362 transitions, 730 flow [2025-03-14 01:37:26,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:37:26,117 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;@33c8d838, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:37:26,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-14 01:37:26,137 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:37:26,137 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-14 01:37:26,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:26,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:26,138 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-14 01:37:26,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:26,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1760796171, now seen corresponding path program 1 times [2025-03-14 01:37:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:26,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078448921] [2025-03-14 01:37:26,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:26,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-14 01:37:26,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-14 01:37:26,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:26,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:26,985 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-14 01:37:26,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078448921] [2025-03-14 01:37:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078448921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134163863] [2025-03-14 01:37:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:26,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:26,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:27,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:27,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:27,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 364 [2025-03-14 01:37:27,366 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-14 01:37:27,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:27,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 364 [2025-03-14 01:37:27,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:27,798 INFO L124 PetriNetUnfolderBase]: 449/1836 cut-off events. [2025-03-14 01:37:27,798 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:37:27,803 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 11575 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-14 01:37:27,811 INFO L140 encePairwiseOnDemand]: 350/364 looper letters, 72 selfloop transitions, 10 changer transitions 0/358 dead transitions. [2025-03-14 01:37:27,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 358 transitions, 886 flow [2025-03-14 01:37:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2025-03-14 01:37:27,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8031135531135531 [2025-03-14 01:37:27,831 INFO L175 Difference]: Start difference. First operand has 361 places, 362 transitions, 730 flow. Second operand 6 states and 1754 transitions. [2025-03-14 01:37:27,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 358 transitions, 886 flow [2025-03-14 01:37:27,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 358 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:37:27,840 INFO L231 Difference]: Finished difference. Result has 362 places, 358 transitions, 740 flow [2025-03-14 01:37:27,843 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-14 01:37:27,845 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 1 predicate places. [2025-03-14 01:37:27,845 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 358 transitions, 740 flow [2025-03-14 01:37:27,848 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-14 01:37:27,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:27,848 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-14 01:37:27,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:37:27,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:27,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash 299687016, now seen corresponding path program 1 times [2025-03-14 01:37:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:27,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293092505] [2025-03-14 01:37:27,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:27,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:37:27,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:37:27,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:27,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:28,254 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-14 01:37:28,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:28,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293092505] [2025-03-14 01:37:28,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293092505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:28,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:28,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:28,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567994486] [2025-03-14 01:37:28,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:28,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:28,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:28,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:28,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:28,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 364 [2025-03-14 01:37:28,668 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-14 01:37:28,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:28,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 364 [2025-03-14 01:37:28,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:28,974 INFO L124 PetriNetUnfolderBase]: 449/1834 cut-off events. [2025-03-14 01:37:28,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:28,978 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 11560 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-14 01:37:28,983 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 72 selfloop transitions, 10 changer transitions 0/356 dead transitions. [2025-03-14 01:37:28,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 356 transitions, 900 flow [2025-03-14 01:37:28,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1752 transitions. [2025-03-14 01:37:28,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2025-03-14 01:37:28,989 INFO L175 Difference]: Start difference. First operand has 362 places, 358 transitions, 740 flow. Second operand 6 states and 1752 transitions. [2025-03-14 01:37:28,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 356 transitions, 900 flow [2025-03-14 01:37:28,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 356 transitions, 880 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:28,994 INFO L231 Difference]: Finished difference. Result has 360 places, 356 transitions, 736 flow [2025-03-14 01:37:28,994 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-14 01:37:28,995 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -1 predicate places. [2025-03-14 01:37:28,995 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 356 transitions, 736 flow [2025-03-14 01:37:28,996 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-14 01:37:28,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:28,996 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-14 01:37:28,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:37:28,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:28,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash 901430133, now seen corresponding path program 1 times [2025-03-14 01:37:28,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:28,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467415371] [2025-03-14 01:37:28,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:28,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:29,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-14 01:37:29,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-14 01:37:29,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:29,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:29,090 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-14 01:37:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467415371] [2025-03-14 01:37:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467415371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252900219] [2025-03-14 01:37:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:29,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:29,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:29,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:29,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 364 [2025-03-14 01:37:29,106 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-14 01:37:29,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:29,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 364 [2025-03-14 01:37:29,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:29,168 INFO L124 PetriNetUnfolderBase]: 29/658 cut-off events. [2025-03-14 01:37:29,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:29,170 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 2442 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-14 01:37:29,171 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-14 01:37:29,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 357 transitions, 764 flow [2025-03-14 01:37:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-14 01:37:29,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-03-14 01:37:29,174 INFO L175 Difference]: Start difference. First operand has 360 places, 356 transitions, 736 flow. Second operand 3 states and 1064 transitions. [2025-03-14 01:37:29,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 357 transitions, 764 flow [2025-03-14 01:37:29,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 357 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:29,180 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 728 flow [2025-03-14 01:37:29,180 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-14 01:37:29,181 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -3 predicate places. [2025-03-14 01:37:29,182 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 728 flow [2025-03-14 01:37:29,182 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-14 01:37:29,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:29,183 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-14 01:37:29,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:37:29,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:29,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash -645244264, now seen corresponding path program 1 times [2025-03-14 01:37:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450533404] [2025-03-14 01:37:29,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:29,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-14 01:37:29,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-14 01:37:29,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:29,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:29,572 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-14 01:37:29,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:29,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450533404] [2025-03-14 01:37:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450533404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:29,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91755946] [2025-03-14 01:37:29,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:29,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:29,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:29,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:29,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 364 [2025-03-14 01:37:29,918 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-14 01:37:29,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:29,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 364 [2025-03-14 01:37:29,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:30,174 INFO L124 PetriNetUnfolderBase]: 450/1956 cut-off events. [2025-03-14 01:37:30,174 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:37:30,178 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 12225 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-14 01:37:30,184 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-14 01:37:30,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 356 transitions, 894 flow [2025-03-14 01:37:30,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1747 transitions. [2025-03-14 01:37:30,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.799908424908425 [2025-03-14 01:37:30,188 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 728 flow. Second operand 6 states and 1747 transitions. [2025-03-14 01:37:30,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 356 transitions, 894 flow [2025-03-14 01:37:30,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 356 transitions, 892 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:30,193 INFO L231 Difference]: Finished difference. Result has 361 places, 356 transitions, 734 flow [2025-03-14 01:37:30,194 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-14 01:37:30,195 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 0 predicate places. [2025-03-14 01:37:30,195 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 356 transitions, 734 flow [2025-03-14 01:37:30,196 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-14 01:37:30,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:30,196 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-14 01:37:30,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:37:30,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:30,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 120065690, now seen corresponding path program 1 times [2025-03-14 01:37:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:30,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131060185] [2025-03-14 01:37:30,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:30,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:30,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-14 01:37:30,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-14 01:37:30,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:30,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:30,270 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-14 01:37:30,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:30,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131060185] [2025-03-14 01:37:30,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131060185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:30,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:30,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289301237] [2025-03-14 01:37:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:30,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:30,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:30,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:30,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 364 [2025-03-14 01:37:30,281 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-14 01:37:30,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:30,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 364 [2025-03-14 01:37:30,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:30,365 INFO L124 PetriNetUnfolderBase]: 29/844 cut-off events. [2025-03-14 01:37:30,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:30,366 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 2393 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-14 01:37:30,368 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-03-14 01:37:30,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 762 flow [2025-03-14 01:37:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-03-14 01:37:30,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-03-14 01:37:30,371 INFO L175 Difference]: Start difference. First operand has 361 places, 356 transitions, 734 flow. Second operand 3 states and 1064 transitions. [2025-03-14 01:37:30,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 762 flow [2025-03-14 01:37:30,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 752 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:30,377 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 736 flow [2025-03-14 01:37:30,378 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-14 01:37:30,378 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -2 predicate places. [2025-03-14 01:37:30,378 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 736 flow [2025-03-14 01:37:30,379 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-14 01:37:30,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:30,380 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-14 01:37:30,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:37:30,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:30,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 772303976, now seen corresponding path program 1 times [2025-03-14 01:37:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850730303] [2025-03-14 01:37:30,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:30,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:37:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:37:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:30,896 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-14 01:37:30,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:30,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850730303] [2025-03-14 01:37:30,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850730303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:30,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:30,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813023325] [2025-03-14 01:37:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:30,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:30,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:30,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:30,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:31,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-14 01:37:31,244 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-14 01:37:31,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:31,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-14 01:37:31,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:31,408 INFO L124 PetriNetUnfolderBase]: 75/1156 cut-off events. [2025-03-14 01:37:31,409 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:37:31,411 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 4594 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-14 01:37:31,415 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 54 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-14 01:37:31,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 356 transitions, 852 flow [2025-03-14 01:37:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1872 transitions. [2025-03-14 01:37:31,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-14 01:37:31,418 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 736 flow. Second operand 6 states and 1872 transitions. [2025-03-14 01:37:31,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 356 transitions, 852 flow [2025-03-14 01:37:31,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 356 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:31,425 INFO L231 Difference]: Finished difference. Result has 362 places, 356 transitions, 742 flow [2025-03-14 01:37:31,426 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-14 01:37:31,426 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 1 predicate places. [2025-03-14 01:37:31,427 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 356 transitions, 742 flow [2025-03-14 01:37:31,428 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-14 01:37:31,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:31,428 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-14 01:37:31,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:37:31,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:31,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:31,429 INFO L85 PathProgramCache]: Analyzing trace with hash 186034327, now seen corresponding path program 1 times [2025-03-14 01:37:31,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:31,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186802189] [2025-03-14 01:37:31,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:31,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:31,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-14 01:37:31,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-14 01:37:31,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:31,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:31,846 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-14 01:37:31,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:31,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186802189] [2025-03-14 01:37:31,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186802189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:31,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:31,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810896606] [2025-03-14 01:37:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:31,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:31,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:31,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:32,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 364 [2025-03-14 01:37:32,101 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-14 01:37:32,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:32,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 364 [2025-03-14 01:37:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:32,351 INFO L124 PetriNetUnfolderBase]: 450/2136 cut-off events. [2025-03-14 01:37:32,351 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:32,355 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 12184 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-14 01:37:32,362 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 79 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-03-14 01:37:32,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 355 transitions, 908 flow [2025-03-14 01:37:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1747 transitions. [2025-03-14 01:37:32,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.799908424908425 [2025-03-14 01:37:32,365 INFO L175 Difference]: Start difference. First operand has 362 places, 356 transitions, 742 flow. Second operand 6 states and 1747 transitions. [2025-03-14 01:37:32,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 355 transitions, 908 flow [2025-03-14 01:37:32,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 355 transitions, 898 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:32,371 INFO L231 Difference]: Finished difference. Result has 361 places, 355 transitions, 740 flow [2025-03-14 01:37:32,371 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-14 01:37:32,373 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 0 predicate places. [2025-03-14 01:37:32,373 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 355 transitions, 740 flow [2025-03-14 01:37:32,374 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-14 01:37:32,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:32,374 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-14 01:37:32,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:37:32,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:32,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:32,375 INFO L85 PathProgramCache]: Analyzing trace with hash 196377321, now seen corresponding path program 1 times [2025-03-14 01:37:32,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:32,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294611351] [2025-03-14 01:37:32,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:32,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:32,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-14 01:37:32,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-14 01:37:32,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:32,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:32,753 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-14 01:37:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294611351] [2025-03-14 01:37:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294611351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:32,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721779575] [2025-03-14 01:37:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:32,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:32,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:32,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:33,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 364 [2025-03-14 01:37:33,039 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-14 01:37:33,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:33,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 364 [2025-03-14 01:37:33,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:33,314 INFO L124 PetriNetUnfolderBase]: 450/2132 cut-off events. [2025-03-14 01:37:33,314 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:33,318 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 12202 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-14 01:37:33,325 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2025-03-14 01:37:33,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 354 transitions, 898 flow [2025-03-14 01:37:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1767 transitions. [2025-03-14 01:37:33,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090659340659341 [2025-03-14 01:37:33,329 INFO L175 Difference]: Start difference. First operand has 361 places, 355 transitions, 740 flow. Second operand 6 states and 1767 transitions. [2025-03-14 01:37:33,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 354 transitions, 898 flow [2025-03-14 01:37:33,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 354 transitions, 888 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:33,333 INFO L231 Difference]: Finished difference. Result has 360 places, 354 transitions, 738 flow [2025-03-14 01:37:33,334 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-14 01:37:33,334 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -1 predicate places. [2025-03-14 01:37:33,335 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 354 transitions, 738 flow [2025-03-14 01:37:33,336 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-14 01:37:33,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:33,336 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-14 01:37:33,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:37:33,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:33,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:33,337 INFO L85 PathProgramCache]: Analyzing trace with hash 10402307, now seen corresponding path program 1 times [2025-03-14 01:37:33,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:33,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614152212] [2025-03-14 01:37:33,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:33,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:33,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-14 01:37:33,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-14 01:37:33,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:33,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:33,738 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-14 01:37:33,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:33,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614152212] [2025-03-14 01:37:33,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614152212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:33,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:33,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550732814] [2025-03-14 01:37:33,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:33,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:33,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:33,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:34,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 364 [2025-03-14 01:37:34,044 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-14 01:37:34,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:34,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 364 [2025-03-14 01:37:34,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:34,301 INFO L124 PetriNetUnfolderBase]: 450/2128 cut-off events. [2025-03-14 01:37:34,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:34,305 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 12179 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-14 01:37:34,344 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2025-03-14 01:37:34,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 353 transitions, 896 flow [2025-03-14 01:37:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1767 transitions. [2025-03-14 01:37:34,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090659340659341 [2025-03-14 01:37:34,347 INFO L175 Difference]: Start difference. First operand has 360 places, 354 transitions, 738 flow. Second operand 6 states and 1767 transitions. [2025-03-14 01:37:34,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 353 transitions, 896 flow [2025-03-14 01:37:34,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 353 transitions, 886 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:34,352 INFO L231 Difference]: Finished difference. Result has 359 places, 353 transitions, 736 flow [2025-03-14 01:37:34,352 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-14 01:37:34,353 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -2 predicate places. [2025-03-14 01:37:34,353 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 353 transitions, 736 flow [2025-03-14 01:37:34,354 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-14 01:37:34,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:34,354 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-14 01:37:34,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:37:34,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:34,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash 33791929, now seen corresponding path program 1 times [2025-03-14 01:37:34,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:34,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295719376] [2025-03-14 01:37:34,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:34,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-14 01:37:34,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-14 01:37:34,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:34,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:34,709 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-14 01:37:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:34,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295719376] [2025-03-14 01:37:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295719376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:34,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:34,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196888222] [2025-03-14 01:37:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:34,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:34,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:34,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:34,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:34,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 364 [2025-03-14 01:37:34,963 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-14 01:37:34,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:34,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 364 [2025-03-14 01:37:34,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:35,152 INFO L124 PetriNetUnfolderBase]: 450/2124 cut-off events. [2025-03-14 01:37:35,152 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:35,156 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 12186 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-14 01:37:35,188 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 80 selfloop transitions, 5 changer transitions 0/352 dead transitions. [2025-03-14 01:37:35,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 352 transitions, 904 flow [2025-03-14 01:37:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1742 transitions. [2025-03-14 01:37:35,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7976190476190477 [2025-03-14 01:37:35,191 INFO L175 Difference]: Start difference. First operand has 359 places, 353 transitions, 736 flow. Second operand 6 states and 1742 transitions. [2025-03-14 01:37:35,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 352 transitions, 904 flow [2025-03-14 01:37:35,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 352 transitions, 894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:35,195 INFO L231 Difference]: Finished difference. Result has 358 places, 352 transitions, 734 flow [2025-03-14 01:37:35,196 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-14 01:37:35,196 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -3 predicate places. [2025-03-14 01:37:35,197 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 352 transitions, 734 flow [2025-03-14 01:37:35,197 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-14 01:37:35,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:35,197 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-14 01:37:35,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:37:35,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:35,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash -975278370, now seen corresponding path program 1 times [2025-03-14 01:37:35,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:35,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289603059] [2025-03-14 01:37:35,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:35,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:35,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-14 01:37:35,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-14 01:37:35,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:35,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:37:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289603059] [2025-03-14 01:37:35,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289603059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124290579] [2025-03-14 01:37:35,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:35,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:35,327 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-14 01:37:35,328 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-14 01:37:35,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-14 01:37:35,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-14 01:37:35,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:35,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:35,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:37:35,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:37:35,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:37:35,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124290579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:35,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:35,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:37:35,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188375895] [2025-03-14 01:37:35,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:35,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:37:35,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:35,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:37:35,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:37:35,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-14 01:37:35,809 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-14 01:37:35,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:35,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-14 01:37:35,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:35,987 INFO L124 PetriNetUnfolderBase]: 29/1008 cut-off events. [2025-03-14 01:37:35,988 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:37:35,989 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 1819 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-14 01:37:35,990 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 15 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2025-03-14 01:37:35,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 800 flow [2025-03-14 01:37:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:37:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:37:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3149 transitions. [2025-03-14 01:37:35,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9612332112332113 [2025-03-14 01:37:35,996 INFO L175 Difference]: Start difference. First operand has 358 places, 352 transitions, 734 flow. Second operand 9 states and 3149 transitions. [2025-03-14 01:37:35,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 800 flow [2025-03-14 01:37:35,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 360 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:36,001 INFO L231 Difference]: Finished difference. Result has 364 places, 358 transitions, 774 flow [2025-03-14 01:37:36,002 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-14 01:37:36,002 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 3 predicate places. [2025-03-14 01:37:36,002 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 358 transitions, 774 flow [2025-03-14 01:37:36,003 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-14 01:37:36,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:36,004 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-14 01:37:36,012 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-14 01:37:36,204 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-14 01:37:36,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:36,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash -371300250, now seen corresponding path program 2 times [2025-03-14 01:37:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754551451] [2025-03-14 01:37:36,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:36,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-03-14 01:37:36,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 407 statements. [2025-03-14 01:37:36,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:36,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-14 01:37:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754551451] [2025-03-14 01:37:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754551451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:36,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:36,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835937530] [2025-03-14 01:37:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:36,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:36,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:36,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:37,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 364 [2025-03-14 01:37:37,327 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-14 01:37:37,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:37,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 364 [2025-03-14 01:37:37,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:37,644 INFO L124 PetriNetUnfolderBase]: 199/1909 cut-off events. [2025-03-14 01:37:37,644 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:37:37,648 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 8784 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-14 01:37:37,655 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 71 selfloop transitions, 23 changer transitions 0/393 dead transitions. [2025-03-14 01:37:37,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 393 transitions, 1040 flow [2025-03-14 01:37:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1913 transitions. [2025-03-14 01:37:37,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8759157509157509 [2025-03-14 01:37:37,659 INFO L175 Difference]: Start difference. First operand has 364 places, 358 transitions, 774 flow. Second operand 6 states and 1913 transitions. [2025-03-14 01:37:37,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 393 transitions, 1040 flow [2025-03-14 01:37:37,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 393 transitions, 1034 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:37,666 INFO L231 Difference]: Finished difference. Result has 373 places, 380 transitions, 926 flow [2025-03-14 01:37:37,667 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-14 01:37:37,668 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 12 predicate places. [2025-03-14 01:37:37,668 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 380 transitions, 926 flow [2025-03-14 01:37:37,669 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-14 01:37:37,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:37,670 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-14 01:37:37,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:37:37,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:37,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash -831153668, now seen corresponding path program 1 times [2025-03-14 01:37:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:37,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467971186] [2025-03-14 01:37:37,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:37,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-14 01:37:37,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-14 01:37:37,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:37,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-03-14 01:37:37,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:37,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467971186] [2025-03-14 01:37:37,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467971186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:37,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380149835] [2025-03-14 01:37:37,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:37,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:37,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:37,942 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-14 01:37:37,944 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-14 01:37:38,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-14 01:37:38,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-14 01:37:38,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:38,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:38,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:37:38,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-14 01:37:38,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 1 proven. 363 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-14 01:37:38,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380149835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:38,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:38,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-14 01:37:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203064006] [2025-03-14 01:37:38,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:38,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:37:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:38,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:37:38,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:37:39,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 364 [2025-03-14 01:37:39,019 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-14 01:37:39,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:39,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 364 [2025-03-14 01:37:39,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:40,300 INFO L124 PetriNetUnfolderBase]: 186/3447 cut-off events. [2025-03-14 01:37:40,300 INFO L125 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2025-03-14 01:37:40,306 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 9501 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-14 01:37:40,310 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 47 selfloop transitions, 68 changer transitions 0/466 dead transitions. [2025-03-14 01:37:40,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 466 transitions, 1566 flow [2025-03-14 01:37:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-14 01:37:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-14 01:37:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 21611 transitions. [2025-03-14 01:37:40,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.942394906680621 [2025-03-14 01:37:40,332 INFO L175 Difference]: Start difference. First operand has 373 places, 380 transitions, 926 flow. Second operand 63 states and 21611 transitions. [2025-03-14 01:37:40,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 466 transitions, 1566 flow [2025-03-14 01:37:40,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 466 transitions, 1566 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:40,339 INFO L231 Difference]: Finished difference. Result has 451 places, 442 transitions, 1446 flow [2025-03-14 01:37:40,340 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-14 01:37:40,340 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 90 predicate places. [2025-03-14 01:37:40,340 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 442 transitions, 1446 flow [2025-03-14 01:37:40,342 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-14 01:37:40,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:40,343 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-14 01:37:40,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:37:40,547 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-14 01:37:40,547 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash -491158485, now seen corresponding path program 2 times [2025-03-14 01:37:40,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:40,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096056482] [2025-03-14 01:37:40,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:40,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1432 statements into 2 equivalence classes. [2025-03-14 01:37:40,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1432 statements. [2025-03-14 01:37:40,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:40,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2025-03-14 01:37:40,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:40,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096056482] [2025-03-14 01:37:40,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096056482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:40,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:40,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:40,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584236612] [2025-03-14 01:37:40,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:40,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:40,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:40,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:40,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:41,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 364 [2025-03-14 01:37:41,577 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-14 01:37:41,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:41,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 364 [2025-03-14 01:37:41,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:42,615 INFO L124 PetriNetUnfolderBase]: 311/4003 cut-off events. [2025-03-14 01:37:42,615 INFO L125 PetriNetUnfolderBase]: For 702/738 co-relation queries the response was YES. [2025-03-14 01:37:42,621 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 15621 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-14 01:37:42,625 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 84 selfloop transitions, 31 changer transitions 0/481 dead transitions. [2025-03-14 01:37:42,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 481 transitions, 1796 flow [2025-03-14 01:37:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1909 transitions. [2025-03-14 01:37:42,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8740842490842491 [2025-03-14 01:37:42,628 INFO L175 Difference]: Start difference. First operand has 451 places, 442 transitions, 1446 flow. Second operand 6 states and 1909 transitions. [2025-03-14 01:37:42,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 481 transitions, 1796 flow [2025-03-14 01:37:42,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 481 transitions, 1720 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-14 01:37:42,639 INFO L231 Difference]: Finished difference. Result has 454 places, 472 transitions, 1628 flow [2025-03-14 01:37:42,640 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-14 01:37:42,641 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 93 predicate places. [2025-03-14 01:37:42,641 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 472 transitions, 1628 flow [2025-03-14 01:37:42,642 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-14 01:37:42,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:42,642 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-14 01:37:42,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:37:42,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:42,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1059937565, now seen corresponding path program 1 times [2025-03-14 01:37:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070854503] [2025-03-14 01:37:42,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:42,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1436 statements into 1 equivalence classes. [2025-03-14 01:37:42,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1436 of 1436 statements. [2025-03-14 01:37:42,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:42,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-03-14 01:37:45,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070854503] [2025-03-14 01:37:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070854503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166169488] [2025-03-14 01:37:45,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:45,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:45,138 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-14 01:37:45,140 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-14 01:37:45,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1436 statements into 1 equivalence classes. [2025-03-14 01:37:46,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1436 of 1436 statements. [2025-03-14 01:37:46,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:46,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:46,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 5657 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:37:46,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-03-14 01:37:46,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 5920 proven. 2527 refuted. 0 times theorem prover too weak. 2742 trivial. 0 not checked. [2025-03-14 01:37:47,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166169488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:47,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:47,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-14 01:37:47,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608819155] [2025-03-14 01:37:47,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:47,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 01:37:47,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:47,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 01:37:47,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 01:37:47,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-14 01:37:47,278 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-14 01:37:47,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:47,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-14 01:37:47,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:49,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L1037-3-->L1037: Formula: (and (= |v_fThread1of1ForFork1_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#c~0.base_92| (store (select |v_#pthreadsMutex_20| |v_~#c~0.base_92|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_92| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_92|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_20|, ~#c~0.offset=|v_~#c~0.offset_92|} OutVars{~#c~0.base=|v_~#c~0.base_92|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_19|, ~#c~0.offset=|v_~#c~0.offset_92|, fThread1of1ForFork1_#t~ret18#1=|v_fThread1of1ForFork1_#t~ret18#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret18#1][409], [Black: 4362#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4380#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), 1810#true, Black: 4342#(and (= 0 |ULTIMATE.start_main_#t~post22#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 1812#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1209#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 4338#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), 247#ULTIMATE.startFINALtrue, Black: 426#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 390#(= |ULTIMATE.start_main_~j~1#1| 0), Black: 4424#(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: 4423#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 4425#(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)), Black: 1801#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 4426#(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: 1804#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1802#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1803#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), 1799#true, 362#true, 422#true, 364#true, 17#L1037true, Black: 1814#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 4374#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), 4432#true, Black: 3189#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 4320#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), 249#L1037true, Black: 4326#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 3461#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 3178#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 4368#(and (<= |ULTIMATE.start_main_~j~1#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~1#1| 28)), Black: 2937#(<= |ULTIMATE.start_main_~j~1#1| 3), 4421#true]) [2025-03-14 01:37:49,141 INFO L294 olderBase$Statistics]: this new event has 2964 ancestors and is cut-off event [2025-03-14 01:37:49,141 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-14 01:37:49,142 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-14 01:37:49,142 INFO L297 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-03-14 01:37:50,177 INFO L124 PetriNetUnfolderBase]: 340/6473 cut-off events. [2025-03-14 01:37:50,178 INFO L125 PetriNetUnfolderBase]: For 3586/3604 co-relation queries the response was YES. [2025-03-14 01:37:50,189 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 17993 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-14 01:37:50,197 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 47 selfloop transitions, 135 changer transitions 0/573 dead transitions. [2025-03-14 01:37:50,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 573 transitions, 2756 flow [2025-03-14 01:37:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 01:37:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 01:37:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 15695 transitions. [2025-03-14 01:37:50,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581807081807082 [2025-03-14 01:37:50,213 INFO L175 Difference]: Start difference. First operand has 454 places, 472 transitions, 1628 flow. Second operand 45 states and 15695 transitions. [2025-03-14 01:37:50,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 573 transitions, 2756 flow [2025-03-14 01:37:50,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 573 transitions, 2756 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:37:50,230 INFO L231 Difference]: Finished difference. Result has 507 places, 547 transitions, 2502 flow [2025-03-14 01:37:50,232 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-14 01:37:50,232 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 146 predicate places. [2025-03-14 01:37:50,233 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 547 transitions, 2502 flow [2025-03-14 01:37:50,236 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-14 01:37:50,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:50,237 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-14 01:37:50,253 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-14 01:37:50,438 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-14 01:37:50,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:50,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1457218333, now seen corresponding path program 2 times [2025-03-14 01:37:50,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:50,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366008026] [2025-03-14 01:37:50,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:50,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2876 statements into 2 equivalence classes. [2025-03-14 01:37:50,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 2876 statements. [2025-03-14 01:37:50,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:50,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52741 trivial. 0 not checked. [2025-03-14 01:37:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366008026] [2025-03-14 01:37:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366008026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:50,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978512217] [2025-03-14 01:37:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:50,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:50,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:51,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-14 01:37:51,311 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-14 01:37:51,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:51,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-14 01:37:51,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:54,488 INFO L124 PetriNetUnfolderBase]: 457/6733 cut-off events. [2025-03-14 01:37:54,488 INFO L125 PetriNetUnfolderBase]: For 2444/2550 co-relation queries the response was YES. [2025-03-14 01:37:54,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10679 conditions, 6733 events. 457/6733 cut-off events. For 2444/2550 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21216 event pairs, 87 based on Foata normal form. 34/6536 useless extension candidates. Maximal degree in co-relation 7262. Up to 1847 conditions per place. [2025-03-14 01:37:54,504 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 108 selfloop transitions, 55 changer transitions 0/608 dead transitions. [2025-03-14 01:37:54,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 608 transitions, 3154 flow [2025-03-14 01:37:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1906 transitions. [2025-03-14 01:37:54,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8727106227106227 [2025-03-14 01:37:54,506 INFO L175 Difference]: Start difference. First operand has 507 places, 547 transitions, 2502 flow. Second operand 6 states and 1906 transitions. [2025-03-14 01:37:54,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 608 transitions, 3154 flow [2025-03-14 01:37:54,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 608 transitions, 3046 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-14 01:37:54,523 INFO L231 Difference]: Finished difference. Result has 499 places, 596 transitions, 2948 flow [2025-03-14 01:37:54,523 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-14 01:37:54,523 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 138 predicate places. [2025-03-14 01:37:54,523 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 596 transitions, 2948 flow [2025-03-14 01:37:54,524 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-14 01:37:54,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:54,525 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-14 01:37:54,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:37:54,525 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:37:54,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1687454605, now seen corresponding path program 1 times [2025-03-14 01:37:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:54,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081914935] [2025-03-14 01:37:54,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:54,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2882 statements into 1 equivalence classes. [2025-03-14 01:37:55,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2882 of 2882 statements. [2025-03-14 01:37:55,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:55,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-03-14 01:38:05,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081914935] [2025-03-14 01:38:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081914935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149604663] [2025-03-14 01:38:05,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:05,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:05,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:05,354 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-14 01:38:05,356 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-14 01:38:06,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2882 statements into 1 equivalence classes. [2025-03-14 01:38:07,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2882 of 2882 statements. [2025-03-14 01:38:07,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:07,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:07,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 11563 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:38:07,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:38:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-03-14 01:38:08,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:38:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 52741 backedges. 27056 proven. 12615 refuted. 0 times theorem prover too weak. 13070 trivial. 0 not checked. [2025-03-14 01:38:10,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149604663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:38:10,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:38:10,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-14 01:38:10,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192598544] [2025-03-14 01:38:10,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:38:10,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-14 01:38:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:10,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-14 01:38:10,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-14 01:38:10,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-03-14 01:38:10,110 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-14 01:38:10,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:10,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-03-14 01:38:10,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:15,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L1037-3-->L1037: Formula: (and (= |v_fThread1of1ForFork1_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| |v_~#c~0.base_92| (store (select |v_#pthreadsMutex_20| |v_~#c~0.base_92|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_92| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_92|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_20|, ~#c~0.offset=|v_~#c~0.offset_92|} OutVars{~#c~0.base=|v_~#c~0.base_92|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_19|, ~#c~0.offset=|v_~#c~0.offset_92|, fThread1of1ForFork1_#t~ret18#1=|v_fThread1of1ForFork1_#t~ret18#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret18#1][528], [1810#true, Black: 1209#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 426#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 390#(= |ULTIMATE.start_main_~j~1#1| 0), Black: 1801#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 1804#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1802#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1803#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), 1799#true, 362#true, 364#true, Black: 1814#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 4374#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), 4432#true, Black: 3189#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 4320#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 4326#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), 249#L1037true, Black: 3461#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 3178#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 4368#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4332#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 2937#(<= |ULTIMATE.start_main_~j~1#1| 3), 4421#true, Black: 4362#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4380#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4342#(and (= 0 |ULTIMATE.start_main_#t~post22#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 1812#(= |ULTIMATE.start_main_~i~0#1| 0), 247#ULTIMATE.startFINALtrue, Black: 4338#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), Black: 4424#(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: 4423#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 10876#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 4425#(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)), Black: 12236#(< |ULTIMATE.start_main_~j~1#1| 24), Black: 11148#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 4426#(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: 4448#(<= |ULTIMATE.start_main_~j~1#1| 7), Black: 11420#(< |ULTIMATE.start_main_~j~1#1| 27), Black: 11964#(< |ULTIMATE.start_main_~j~1#1| 25), Black: 10865#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 11692#(< |ULTIMATE.start_main_~j~1#1| 26), Black: 13144#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), Black: 13143#(= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0), 13152#true, Black: 13145#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 2 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), Black: 13146#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 2 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 3 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), 422#true, 17#L1037true, 13141#true, Black: 380#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2025-03-14 01:38:15,588 INFO L294 olderBase$Statistics]: this new event has 5664 ancestors and is cut-off event [2025-03-14 01:38:15,588 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-14 01:38:15,588 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-14 01:38:15,588 INFO L297 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-03-14 01:38:18,727 INFO L124 PetriNetUnfolderBase]: 526/11255 cut-off events. [2025-03-14 01:38:18,727 INFO L125 PetriNetUnfolderBase]: For 15318/15436 co-relation queries the response was YES. [2025-03-14 01:38:18,748 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 24629 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-14 01:38:18,761 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 92 selfloop transitions, 270 changer transitions 0/802 dead transitions. [2025-03-14 01:38:18,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 802 transitions, 5858 flow [2025-03-14 01:38:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-14 01:38:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-14 01:38:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 31377 transitions. [2025-03-14 01:38:18,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9577838827838828 [2025-03-14 01:38:18,783 INFO L175 Difference]: Start difference. First operand has 499 places, 596 transitions, 2948 flow. Second operand 90 states and 31377 transitions. [2025-03-14 01:38:18,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 802 transitions, 5858 flow [2025-03-14 01:38:18,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 802 transitions, 5858 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:38:18,816 INFO L231 Difference]: Finished difference. Result has 604 places, 734 transitions, 4940 flow [2025-03-14 01:38:18,817 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-14 01:38:18,818 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 243 predicate places. [2025-03-14 01:38:18,818 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 734 transitions, 4940 flow [2025-03-14 01:38:18,822 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-14 01:38:18,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:18,824 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-14 01:38:18,853 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-14 01:38:19,024 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-14 01:38:19,024 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:38:19,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1746363571, now seen corresponding path program 2 times [2025-03-14 01:38:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:19,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987936824] [2025-03-14 01:38:19,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:38:19,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:19,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5582 statements into 2 equivalence classes. [2025-03-14 01:38:19,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 124 of 5582 statements. [2025-03-14 01:38:19,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:38:19,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 213451 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213451 trivial. 0 not checked. [2025-03-14 01:38:19,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:19,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987936824] [2025-03-14 01:38:19,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987936824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:19,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:19,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:19,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222627846] [2025-03-14 01:38:19,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:19,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:19,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:19,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:20,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-03-14 01:38:20,191 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-14 01:38:20,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:20,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-03-14 01:38:20,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:28,830 INFO L124 PetriNetUnfolderBase]: 567/11118 cut-off events. [2025-03-14 01:38:28,831 INFO L125 PetriNetUnfolderBase]: For 7903/8210 co-relation queries the response was YES. [2025-03-14 01:38:28,854 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 24213 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-14 01:38:28,869 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 141 selfloop transitions, 79 changer transitions 0/807 dead transitions. [2025-03-14 01:38:28,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 807 transitions, 5918 flow [2025-03-14 01:38:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1902 transitions. [2025-03-14 01:38:28,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8708791208791209 [2025-03-14 01:38:28,871 INFO L175 Difference]: Start difference. First operand has 604 places, 734 transitions, 4940 flow. Second operand 6 states and 1902 transitions. [2025-03-14 01:38:28,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 807 transitions, 5918 flow [2025-03-14 01:38:28,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 807 transitions, 5564 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-14 01:38:28,916 INFO L231 Difference]: Finished difference. Result has 572 places, 799 transitions, 5484 flow [2025-03-14 01:38:28,917 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-14 01:38:28,917 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 211 predicate places. [2025-03-14 01:38:28,917 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 799 transitions, 5484 flow [2025-03-14 01:38:28,918 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-14 01:38:28,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:28,919 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-14 01:38:28,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:38:28,919 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:38:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1497889121, now seen corresponding path program 1 times [2025-03-14 01:38:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812276799] [2025-03-14 01:38:28,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:29,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5584 statements into 1 equivalence classes. [2025-03-14 01:38:29,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5584 of 5584 statements. [2025-03-14 01:38:29,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:29,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat