./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:22:51,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:22:51,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:22:51,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:22:51,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:22:51,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:22:51,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:22:51,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:22:51,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:22:51,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:22:51,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:22:51,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:22:51,283 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:22:51,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:22:51,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:22:51,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:22:51,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:22:51,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:22:51,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:22:51,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:22:51,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:22:51,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:22:51,284 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:22:51,284 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:22:51,284 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:22:51,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:22:51,284 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:22:51,285 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:22:51,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:22:51,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:22:51,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:22:51,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:22:51,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:22:51,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:22:51,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:22:51,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:22:51,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:22:51,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:22:51,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:22:51,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:22:51,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:22:51,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:22:51,286 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-jdk21/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 -> a0270befea30c9963adb19613f3074c8c29d9100e1f0592dc0c89cf3d3dda0df [2025-02-06 09:22:51,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:22:51,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:22:51,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:22:51,607 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:22:51,608 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:22:51,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2025-02-06 09:22:52,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10b536a2f/5255c9f4419b49b7a04bd5d9f554a136/FLAGbb2a2c13d [2025-02-06 09:22:53,249 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:22:53,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_22-nocollapse.i [2025-02-06 09:22:53,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10b536a2f/5255c9f4419b49b7a04bd5d9f554a136/FLAGbb2a2c13d [2025-02-06 09:22:53,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10b536a2f/5255c9f4419b49b7a04bd5d9f554a136 [2025-02-06 09:22:53,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:22:53,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:22:53,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:22:53,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:22:53,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:22:53,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:22:53" (1/1) ... [2025-02-06 09:22:53,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:53, skipping insertion in model container [2025-02-06 09:22:53,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:22:53" (1/1) ... [2025-02-06 09:22:53,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:22:53,837 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:22:53,838 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:22:53,838 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:22:53,839 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:22:53,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:22:53,908 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:22:53,941 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:22:53,942 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:22:53,945 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:22:53,946 WARN L1731 CHandler]: Possible shadowing of function new [2025-02-06 09:22:53,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:22:54,030 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:22:54,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54 WrapperNode [2025-02-06 09:22:54,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:22:54,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:22:54,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:22:54,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:22:54,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,083 INFO L138 Inliner]: procedures = 274, calls = 98, calls flagged for inlining = 9, calls inlined = 8, statements flattened = 270 [2025-02-06 09:22:54,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:22:54,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:22:54,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:22:54,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:22:54,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:22:54,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:22:54,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:22:54,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:22:54,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (1/1) ... [2025-02-06 09:22:54,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:22:54,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:54,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:22:54,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:22:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-06 09:22:54,209 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-06 09:22:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:22:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:22:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:22:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:22:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:22:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:22:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:22:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:22:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:22:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:22:54,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:22:54,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:22:54,212 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:22:54,378 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:22:54,381 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:22:55,067 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:22:55,068 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:22:55,114 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:22:55,115 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:22:55,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:55 BoogieIcfgContainer [2025-02-06 09:22:55,115 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:22:55,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:22:55,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:22:55,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:22:55,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:22:53" (1/3) ... [2025-02-06 09:22:55,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641b596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:22:55, skipping insertion in model container [2025-02-06 09:22:55,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:54" (2/3) ... [2025-02-06 09:22:55,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641b596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:22:55, skipping insertion in model container [2025-02-06 09:22:55,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:55" (3/3) ... [2025-02-06 09:22:55,129 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_22-nocollapse.i [2025-02-06 09:22:55,146 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:22:55,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_22-nocollapse.i that has 2 procedures, 305 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-02-06 09:22:55,149 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:22:55,294 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:22:55,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 379 transitions, 766 flow [2025-02-06 09:22:55,506 INFO L124 PetriNetUnfolderBase]: 9/377 cut-off events. [2025-02-06 09:22:55,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:55,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 377 events. 9/377 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 606 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 304. Up to 2 conditions per place. [2025-02-06 09:22:55,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 379 transitions, 766 flow [2025-02-06 09:22:55,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 760 flow [2025-02-06 09:22:55,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:22:55,560 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;@1a85d0b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:22:55,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-06 09:22:55,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:22:55,591 INFO L124 PetriNetUnfolderBase]: 1/115 cut-off events. [2025-02-06 09:22:55,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:55,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:55,594 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] [2025-02-06 09:22:55,594 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-02-06 09:22:55,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1391034647, now seen corresponding path program 1 times [2025-02-06 09:22:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:55,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382040879] [2025-02-06 09:22:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:55,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:22:55,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:22:55,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:55,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:56,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:56,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382040879] [2025-02-06 09:22:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382040879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:56,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:56,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233873978] [2025-02-06 09:22:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:56,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:56,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:56,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:57,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 379 [2025-02-06 09:22:57,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 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-02-06 09:22:57,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:57,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 379 [2025-02-06 09:22:57,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:57,817 INFO L124 PetriNetUnfolderBase]: 449/1850 cut-off events. [2025-02-06 09:22:57,817 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 09:22:57,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 1850 events. 449/1850 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11513 event pairs, 342 based on Foata normal form. 35/1677 useless extension candidates. Maximal degree in co-relation 2472. Up to 846 conditions per place. [2025-02-06 09:22:57,840 INFO L140 encePairwiseOnDemand]: 364/379 looper letters, 72 selfloop transitions, 10 changer transitions 1/372 dead transitions. [2025-02-06 09:22:57,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 372 transitions, 914 flow [2025-02-06 09:22:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1839 transitions. [2025-02-06 09:22:57,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8087071240105541 [2025-02-06 09:22:57,873 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 760 flow. Second operand 6 states and 1839 transitions. [2025-02-06 09:22:57,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 372 transitions, 914 flow [2025-02-06 09:22:57,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 372 transitions, 912 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:22:57,893 INFO L231 Difference]: Finished difference. Result has 376 places, 371 transitions, 766 flow [2025-02-06 09:22:57,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=376, PETRI_TRANSITIONS=371} [2025-02-06 09:22:57,901 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 1 predicate places. [2025-02-06 09:22:57,901 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 371 transitions, 766 flow [2025-02-06 09:22:57,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 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-02-06 09:22:57,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:57,904 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] [2025-02-06 09:22:57,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:22:57,905 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-02-06 09:22:57,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash 570931479, now seen corresponding path program 1 times [2025-02-06 09:22:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:57,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039708291] [2025-02-06 09:22:57,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:57,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:57,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 09:22:57,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 09:22:57,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:57,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:58,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039708291] [2025-02-06 09:22:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039708291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:58,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879989492] [2025-02-06 09:22:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:58,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:58,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:58,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:58,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 379 [2025-02-06 09:22:58,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 371 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 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-02-06 09:22:58,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:58,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 379 [2025-02-06 09:22:58,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:59,520 INFO L124 PetriNetUnfolderBase]: 449/1847 cut-off events. [2025-02-06 09:22:59,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:59,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1847 events. 449/1847 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11494 event pairs, 342 based on Foata normal form. 0/1642 useless extension candidates. Maximal degree in co-relation 2581. Up to 846 conditions per place. [2025-02-06 09:22:59,537 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 72 selfloop transitions, 10 changer transitions 0/369 dead transitions. [2025-02-06 09:22:59,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 369 transitions, 926 flow [2025-02-06 09:22:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1836 transitions. [2025-02-06 09:22:59,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8073878627968337 [2025-02-06 09:22:59,542 INFO L175 Difference]: Start difference. First operand has 376 places, 371 transitions, 766 flow. Second operand 6 states and 1836 transitions. [2025-02-06 09:22:59,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 369 transitions, 926 flow [2025-02-06 09:22:59,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 369 transitions, 906 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:59,550 INFO L231 Difference]: Finished difference. Result has 373 places, 369 transitions, 762 flow [2025-02-06 09:22:59,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=762, PETRI_PLACES=373, PETRI_TRANSITIONS=369} [2025-02-06 09:22:59,552 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-02-06 09:22:59,552 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 369 transitions, 762 flow [2025-02-06 09:22:59,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.3333333333333) internal successors, (1760), 6 states have internal predecessors, (1760), 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-02-06 09:22:59,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:59,555 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] [2025-02-06 09:22:59,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:22:59,556 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-02-06 09:22:59,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1698838141, now seen corresponding path program 1 times [2025-02-06 09:22:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620455373] [2025-02-06 09:22:59,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:59,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 09:22:59,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 09:22:59,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:59,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620455373] [2025-02-06 09:22:59,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620455373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:59,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:59,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:22:59,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033478038] [2025-02-06 09:22:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:59,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:22:59,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:59,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:22:59,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:22:59,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 379 [2025-02-06 09:22:59,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 369 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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-02-06 09:22:59,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:59,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 379 [2025-02-06 09:22:59,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:59,797 INFO L124 PetriNetUnfolderBase]: 29/671 cut-off events. [2025-02-06 09:22:59,797 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:59,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 671 events. 29/671 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2434 event pairs, 18 based on Foata normal form. 1/620 useless extension candidates. Maximal degree in co-relation 435. Up to 45 conditions per place. [2025-02-06 09:22:59,802 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-02-06 09:22:59,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 370 transitions, 790 flow [2025-02-06 09:22:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:22:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:22:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-02-06 09:22:59,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9727352682497801 [2025-02-06 09:22:59,806 INFO L175 Difference]: Start difference. First operand has 373 places, 369 transitions, 762 flow. Second operand 3 states and 1106 transitions. [2025-02-06 09:22:59,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 370 transitions, 790 flow [2025-02-06 09:22:59,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 770 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:59,816 INFO L231 Difference]: Finished difference. Result has 371 places, 370 transitions, 754 flow [2025-02-06 09:22:59,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=371, PETRI_TRANSITIONS=370} [2025-02-06 09:22:59,818 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -4 predicate places. [2025-02-06 09:22:59,818 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 370 transitions, 754 flow [2025-02-06 09:22:59,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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-02-06 09:22:59,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:59,819 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] [2025-02-06 09:22:59,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:22:59,820 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-02-06 09:22:59,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2060271083, now seen corresponding path program 1 times [2025-02-06 09:22:59,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:59,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13396576] [2025-02-06 09:22:59,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:59,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 09:22:59,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 09:22:59,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:59,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:00,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:00,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13396576] [2025-02-06 09:23:00,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13396576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:00,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:00,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005088799] [2025-02-06 09:23:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:00,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:00,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:00,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:00,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:00,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 379 [2025-02-06 09:23:00,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 370 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 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-02-06 09:23:00,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:00,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 379 [2025-02-06 09:23:00,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:01,210 INFO L124 PetriNetUnfolderBase]: 450/1969 cut-off events. [2025-02-06 09:23:01,210 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:23:01,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 1969 events. 450/1969 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12249 event pairs, 342 based on Foata normal form. 0/1760 useless extension candidates. Maximal degree in co-relation 2655. Up to 894 conditions per place. [2025-02-06 09:23:01,224 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 79 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-02-06 09:23:01,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 369 transitions, 920 flow [2025-02-06 09:23:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1831 transitions. [2025-02-06 09:23:01,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051890941072999 [2025-02-06 09:23:01,229 INFO L175 Difference]: Start difference. First operand has 371 places, 370 transitions, 754 flow. Second operand 6 states and 1831 transitions. [2025-02-06 09:23:01,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 369 transitions, 920 flow [2025-02-06 09:23:01,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 369 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:23:01,235 INFO L231 Difference]: Finished difference. Result has 374 places, 369 transitions, 760 flow [2025-02-06 09:23:01,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=374, PETRI_TRANSITIONS=369} [2025-02-06 09:23:01,237 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-02-06 09:23:01,237 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 369 transitions, 760 flow [2025-02-06 09:23:01,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 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-02-06 09:23:01,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:01,239 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] [2025-02-06 09:23:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:23:01,239 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-02-06 09:23:01,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1573498170, now seen corresponding path program 1 times [2025-02-06 09:23:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661383562] [2025-02-06 09:23:01,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:01,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 09:23:01,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 09:23:01,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:01,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661383562] [2025-02-06 09:23:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661383562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:01,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:23:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147074914] [2025-02-06 09:23:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:23:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:01,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:23:01,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:23:01,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 379 [2025-02-06 09:23:01,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 369 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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-02-06 09:23:01,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:01,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 379 [2025-02-06 09:23:01,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:01,484 INFO L124 PetriNetUnfolderBase]: 29/857 cut-off events. [2025-02-06 09:23:01,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:01,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 857 events. 29/857 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2429 event pairs, 18 based on Foata normal form. 2/801 useless extension candidates. Maximal degree in co-relation 513. Up to 49 conditions per place. [2025-02-06 09:23:01,493 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-02-06 09:23:01,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 370 transitions, 788 flow [2025-02-06 09:23:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:23:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:23:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-02-06 09:23:01,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9727352682497801 [2025-02-06 09:23:01,496 INFO L175 Difference]: Start difference. First operand has 374 places, 369 transitions, 760 flow. Second operand 3 states and 1106 transitions. [2025-02-06 09:23:01,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 370 transitions, 788 flow [2025-02-06 09:23:01,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 370 transitions, 778 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:01,505 INFO L231 Difference]: Finished difference. Result has 372 places, 370 transitions, 762 flow [2025-02-06 09:23:01,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=372, PETRI_TRANSITIONS=370} [2025-02-06 09:23:01,510 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-02-06 09:23:01,510 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 370 transitions, 762 flow [2025-02-06 09:23:01,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 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-02-06 09:23:01,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:01,511 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] [2025-02-06 09:23:01,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:23:01,511 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-02-06 09:23:01,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash -231714112, now seen corresponding path program 1 times [2025-02-06 09:23:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910351740] [2025-02-06 09:23:01,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:01,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:23:01,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:23:01,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:01,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910351740] [2025-02-06 09:23:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910351740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508830347] [2025-02-06 09:23:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:02,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:02,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:02,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:02,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-02-06 09:23:02,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 370 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 320.5) internal successors, (1923), 6 states have internal predecessors, (1923), 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-02-06 09:23:02,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:02,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-02-06 09:23:02,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:02,954 INFO L124 PetriNetUnfolderBase]: 75/1169 cut-off events. [2025-02-06 09:23:02,954 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:23:02,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 1169 events. 75/1169 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4612 event pairs, 42 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 953. Up to 263 conditions per place. [2025-02-06 09:23:02,961 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 54 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-02-06 09:23:02,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 369 transitions, 878 flow [2025-02-06 09:23:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1956 transitions. [2025-02-06 09:23:02,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8601583113456465 [2025-02-06 09:23:02,966 INFO L175 Difference]: Start difference. First operand has 372 places, 370 transitions, 762 flow. Second operand 6 states and 1956 transitions. [2025-02-06 09:23:02,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 369 transitions, 878 flow [2025-02-06 09:23:02,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 369 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:23:02,975 INFO L231 Difference]: Finished difference. Result has 375 places, 369 transitions, 768 flow [2025-02-06 09:23:02,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=768, PETRI_PLACES=375, PETRI_TRANSITIONS=369} [2025-02-06 09:23:02,977 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 0 predicate places. [2025-02-06 09:23:02,977 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 369 transitions, 768 flow [2025-02-06 09:23:02,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.5) internal successors, (1923), 6 states have internal predecessors, (1923), 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-02-06 09:23:02,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:02,978 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] [2025-02-06 09:23:02,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:23:02,978 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-02-06 09:23:02,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1484926838, now seen corresponding path program 1 times [2025-02-06 09:23:02,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:02,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050968698] [2025-02-06 09:23:02,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:03,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 09:23:03,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 09:23:03,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:03,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050968698] [2025-02-06 09:23:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050968698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:03,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:03,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570137732] [2025-02-06 09:23:03,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:03,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:03,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:03,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:03,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 379 [2025-02-06 09:23:03,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 369 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 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-02-06 09:23:03,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:03,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 379 [2025-02-06 09:23:03,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:04,305 INFO L124 PetriNetUnfolderBase]: 450/2149 cut-off events. [2025-02-06 09:23:04,305 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:23:04,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2149 events. 450/2149 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12273 event pairs, 342 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 2698. Up to 960 conditions per place. [2025-02-06 09:23:04,319 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 79 selfloop transitions, 5 changer transitions 0/368 dead transitions. [2025-02-06 09:23:04,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 368 transitions, 934 flow [2025-02-06 09:23:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1831 transitions. [2025-02-06 09:23:04,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051890941072999 [2025-02-06 09:23:04,324 INFO L175 Difference]: Start difference. First operand has 375 places, 369 transitions, 768 flow. Second operand 6 states and 1831 transitions. [2025-02-06 09:23:04,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 368 transitions, 934 flow [2025-02-06 09:23:04,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 368 transitions, 924 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:04,333 INFO L231 Difference]: Finished difference. Result has 374 places, 368 transitions, 766 flow [2025-02-06 09:23:04,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=374, PETRI_TRANSITIONS=368} [2025-02-06 09:23:04,334 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-02-06 09:23:04,334 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 368 transitions, 766 flow [2025-02-06 09:23:04,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 296.3333333333333) internal successors, (1778), 6 states have internal predecessors, (1778), 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-02-06 09:23:04,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:04,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, 1, 1, 1] [2025-02-06 09:23:04,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:23:04,336 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-02-06 09:23:04,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1289711983, now seen corresponding path program 1 times [2025-02-06 09:23:04,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:04,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566719018] [2025-02-06 09:23:04,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:04,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 09:23:04,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 09:23:04,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:04,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:23:04,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566719018] [2025-02-06 09:23:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566719018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:04,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:04,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:04,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138864947] [2025-02-06 09:23:04,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:04,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:04,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:04,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:05,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 379 [2025-02-06 09:23:05,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 368 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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-02-06 09:23:05,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:05,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 379 [2025-02-06 09:23:05,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:05,649 INFO L124 PetriNetUnfolderBase]: 450/2145 cut-off events. [2025-02-06 09:23:05,650 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:23:05,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 2145 events. 450/2145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12281 event pairs, 342 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 2714. Up to 944 conditions per place. [2025-02-06 09:23:05,666 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 75 selfloop transitions, 5 changer transitions 0/367 dead transitions. [2025-02-06 09:23:05,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 367 transitions, 924 flow [2025-02-06 09:23:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1851 transitions. [2025-02-06 09:23:05,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139841688654353 [2025-02-06 09:23:05,671 INFO L175 Difference]: Start difference. First operand has 374 places, 368 transitions, 766 flow. Second operand 6 states and 1851 transitions. [2025-02-06 09:23:05,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 367 transitions, 924 flow [2025-02-06 09:23:05,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 367 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:05,677 INFO L231 Difference]: Finished difference. Result has 373 places, 367 transitions, 764 flow [2025-02-06 09:23:05,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=373, PETRI_TRANSITIONS=367} [2025-02-06 09:23:05,679 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-02-06 09:23:05,679 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 367 transitions, 764 flow [2025-02-06 09:23:05,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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-02-06 09:23:05,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:05,680 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] [2025-02-06 09:23:05,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:23:05,681 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-02-06 09:23:05,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1090537409, now seen corresponding path program 1 times [2025-02-06 09:23:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:05,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496099465] [2025-02-06 09:23:05,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:05,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:05,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 09:23:05,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 09:23:05,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:05,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:23:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496099465] [2025-02-06 09:23:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496099465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205100046] [2025-02-06 09:23:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:06,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:06,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 379 [2025-02-06 09:23:06,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 367 transitions, 764 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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-02-06 09:23:06,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:06,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 379 [2025-02-06 09:23:06,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:07,013 INFO L124 PetriNetUnfolderBase]: 450/2141 cut-off events. [2025-02-06 09:23:07,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:23:07,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 2141 events. 450/2141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12209 event pairs, 342 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 2729. Up to 944 conditions per place. [2025-02-06 09:23:07,033 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 75 selfloop transitions, 5 changer transitions 0/366 dead transitions. [2025-02-06 09:23:07,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 366 transitions, 922 flow [2025-02-06 09:23:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1851 transitions. [2025-02-06 09:23:07,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8139841688654353 [2025-02-06 09:23:07,039 INFO L175 Difference]: Start difference. First operand has 373 places, 367 transitions, 764 flow. Second operand 6 states and 1851 transitions. [2025-02-06 09:23:07,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 366 transitions, 922 flow [2025-02-06 09:23:07,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 366 transitions, 912 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:07,045 INFO L231 Difference]: Finished difference. Result has 372 places, 366 transitions, 762 flow [2025-02-06 09:23:07,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=762, PETRI_PLACES=372, PETRI_TRANSITIONS=366} [2025-02-06 09:23:07,047 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-02-06 09:23:07,047 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 366 transitions, 762 flow [2025-02-06 09:23:07,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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-02-06 09:23:07,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:07,049 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] [2025-02-06 09:23:07,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:23:07,049 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-02-06 09:23:07,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash 682887699, now seen corresponding path program 1 times [2025-02-06 09:23:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:07,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047453080] [2025-02-06 09:23:07,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:07,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:07,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-06 09:23:07,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-06 09:23:07,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:07,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:23:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:07,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047453080] [2025-02-06 09:23:07,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047453080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:07,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:07,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:07,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776725253] [2025-02-06 09:23:07,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:07,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:07,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:07,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:07,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 379 [2025-02-06 09:23:07,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 366 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 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-02-06 09:23:07,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:07,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 379 [2025-02-06 09:23:07,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:08,377 INFO L124 PetriNetUnfolderBase]: 450/2137 cut-off events. [2025-02-06 09:23:08,377 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:23:08,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 2137 events. 450/2137 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12189 event pairs, 342 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 2742. Up to 964 conditions per place. [2025-02-06 09:23:08,390 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 80 selfloop transitions, 5 changer transitions 0/365 dead transitions. [2025-02-06 09:23:08,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 365 transitions, 930 flow [2025-02-06 09:23:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1826 transitions. [2025-02-06 09:23:08,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.802990325417766 [2025-02-06 09:23:08,396 INFO L175 Difference]: Start difference. First operand has 372 places, 366 transitions, 762 flow. Second operand 6 states and 1826 transitions. [2025-02-06 09:23:08,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 365 transitions, 930 flow [2025-02-06 09:23:08,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 365 transitions, 920 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:08,403 INFO L231 Difference]: Finished difference. Result has 371 places, 365 transitions, 760 flow [2025-02-06 09:23:08,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=371, PETRI_TRANSITIONS=365} [2025-02-06 09:23:08,405 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -4 predicate places. [2025-02-06 09:23:08,405 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 365 transitions, 760 flow [2025-02-06 09:23:08,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 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-02-06 09:23:08,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:08,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:08,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:23:08,406 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-02-06 09:23:08,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2049295721, now seen corresponding path program 1 times [2025-02-06 09:23:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:08,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708666684] [2025-02-06 09:23:08,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:08,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 09:23:08,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 09:23:08,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:08,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 09:23:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708666684] [2025-02-06 09:23:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708666684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280288440] [2025-02-06 09:23:08,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:08,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:08,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:08,628 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:23:08,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:23:08,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 09:23:08,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 09:23:08,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:08,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:08,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:23:08,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 09:23:09,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:23:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 09:23:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280288440] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:23:09,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:23:09,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:23:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567918380] [2025-02-06 09:23:09,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:23:09,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:23:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:09,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:23:09,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:23:09,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-02-06 09:23:09,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 365 transitions, 760 flow. Second operand has 10 states, 10 states have (on average 363.0) internal successors, (3630), 10 states have internal predecessors, (3630), 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-02-06 09:23:09,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:09,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-02-06 09:23:09,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:09,526 INFO L124 PetriNetUnfolderBase]: 29/1021 cut-off events. [2025-02-06 09:23:09,526 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:23:09,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 1021 events. 29/1021 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1822 event pairs, 18 based on Foata normal form. 4/987 useless extension candidates. Maximal degree in co-relation 506. Up to 49 conditions per place. [2025-02-06 09:23:09,530 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 15 selfloop transitions, 9 changer transitions 0/373 dead transitions. [2025-02-06 09:23:09,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 373 transitions, 826 flow [2025-02-06 09:23:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:23:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:23:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3275 transitions. [2025-02-06 09:23:09,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601289944297859 [2025-02-06 09:23:09,537 INFO L175 Difference]: Start difference. First operand has 371 places, 365 transitions, 760 flow. Second operand 9 states and 3275 transitions. [2025-02-06 09:23:09,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 373 transitions, 826 flow [2025-02-06 09:23:09,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 373 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:23:09,544 INFO L231 Difference]: Finished difference. Result has 377 places, 371 transitions, 800 flow [2025-02-06 09:23:09,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=800, PETRI_PLACES=377, PETRI_TRANSITIONS=371} [2025-02-06 09:23:09,545 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 2 predicate places. [2025-02-06 09:23:09,545 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 371 transitions, 800 flow [2025-02-06 09:23:09,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 363.0) internal successors, (3630), 10 states have internal predecessors, (3630), 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-02-06 09:23:09,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:09,548 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:09,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:23:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 09:23:09,749 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-02-06 09:23:09,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2054178937, now seen corresponding path program 2 times [2025-02-06 09:23:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403586613] [2025-02-06 09:23:09,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:23:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:09,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 420 statements into 2 equivalence classes. [2025-02-06 09:23:09,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 121 of 420 statements. [2025-02-06 09:23:09,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:23:09,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-02-06 09:23:10,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:10,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403586613] [2025-02-06 09:23:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403586613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:10,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500298992] [2025-02-06 09:23:10,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:10,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:10,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:10,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:11,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 379 [2025-02-06 09:23:11,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 371 transitions, 800 flow. Second operand has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 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-02-06 09:23:11,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:11,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 379 [2025-02-06 09:23:11,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:11,596 INFO L124 PetriNetUnfolderBase]: 199/1922 cut-off events. [2025-02-06 09:23:11,596 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:23:11,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 1922 events. 199/1922 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8801 event pairs, 54 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 1891. Up to 448 conditions per place. [2025-02-06 09:23:11,603 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 71 selfloop transitions, 23 changer transitions 0/406 dead transitions. [2025-02-06 09:23:11,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 406 transitions, 1066 flow [2025-02-06 09:23:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1997 transitions. [2025-02-06 09:23:11,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781882145998241 [2025-02-06 09:23:11,608 INFO L175 Difference]: Start difference. First operand has 377 places, 371 transitions, 800 flow. Second operand 6 states and 1997 transitions. [2025-02-06 09:23:11,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 406 transitions, 1066 flow [2025-02-06 09:23:11,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 406 transitions, 1060 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:23:11,615 INFO L231 Difference]: Finished difference. Result has 386 places, 393 transitions, 952 flow [2025-02-06 09:23:11,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=386, PETRI_TRANSITIONS=393} [2025-02-06 09:23:11,617 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 11 predicate places. [2025-02-06 09:23:11,618 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 393 transitions, 952 flow [2025-02-06 09:23:11,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.5) internal successors, (1947), 6 states have internal predecessors, (1947), 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-02-06 09:23:11,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:11,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:11,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:23:11,619 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-02-06 09:23:11,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1381722651, now seen corresponding path program 1 times [2025-02-06 09:23:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828215790] [2025-02-06 09:23:11,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:11,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-02-06 09:23:11,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-02-06 09:23:11,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:11,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-02-06 09:23:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828215790] [2025-02-06 09:23:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828215790] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976533004] [2025-02-06 09:23:12,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:12,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:12,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:23:12,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:23:12,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-02-06 09:23:12,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-02-06 09:23:12,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:12,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:23:12,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 09:23:12,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:23:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 09:23:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976533004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:23:13,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:23:13,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-06 09:23:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107514887] [2025-02-06 09:23:13,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:23:13,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 09:23:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:13,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 09:23:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-06 09:23:13,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 379 [2025-02-06 09:23:13,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 393 transitions, 952 flow. Second operand has 19 states, 19 states have (on average 357.6842105263158) internal successors, (6796), 19 states have internal predecessors, (6796), 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-02-06 09:23:13,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:13,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 379 [2025-02-06 09:23:13,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:15,145 INFO L124 PetriNetUnfolderBase]: 186/3460 cut-off events. [2025-02-06 09:23:15,145 INFO L125 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2025-02-06 09:23:15,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4184 conditions, 3460 events. 186/3460 cut-off events. For 134/138 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9484 event pairs, 55 based on Foata normal form. 13/3304 useless extension candidates. Maximal degree in co-relation 2868. Up to 146 conditions per place. [2025-02-06 09:23:15,152 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 47 selfloop transitions, 68 changer transitions 0/479 dead transitions. [2025-02-06 09:23:15,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 479 transitions, 1592 flow [2025-02-06 09:23:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-06 09:23:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-02-06 09:23:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 22493 transitions. [2025-02-06 09:23:15,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420362692130502 [2025-02-06 09:23:15,175 INFO L175 Difference]: Start difference. First operand has 386 places, 393 transitions, 952 flow. Second operand 63 states and 22493 transitions. [2025-02-06 09:23:15,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 479 transitions, 1592 flow [2025-02-06 09:23:15,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 479 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:15,184 INFO L231 Difference]: Finished difference. Result has 464 places, 455 transitions, 1472 flow [2025-02-06 09:23:15,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1472, PETRI_PLACES=464, PETRI_TRANSITIONS=455} [2025-02-06 09:23:15,185 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 89 predicate places. [2025-02-06 09:23:15,185 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 455 transitions, 1472 flow [2025-02-06 09:23:15,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 357.6842105263158) internal successors, (6796), 19 states have internal predecessors, (6796), 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-02-06 09:23:15,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:15,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:15,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:23:15,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:15,389 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-02-06 09:23:15,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1003277599, now seen corresponding path program 2 times [2025-02-06 09:23:15,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:15,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928203132] [2025-02-06 09:23:15,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:23:15,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:15,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1445 statements into 2 equivalence classes. [2025-02-06 09:23:15,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 127 of 1445 statements. [2025-02-06 09:23:15,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:23:15,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15305 trivial. 0 not checked. [2025-02-06 09:23:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928203132] [2025-02-06 09:23:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928203132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:15,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:15,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584483987] [2025-02-06 09:23:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:15,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:15,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:15,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:16,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 379 [2025-02-06 09:23:16,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 455 transitions, 1472 flow. Second operand has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 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-02-06 09:23:16,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:16,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 379 [2025-02-06 09:23:16,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:17,927 INFO L124 PetriNetUnfolderBase]: 311/4016 cut-off events. [2025-02-06 09:23:17,927 INFO L125 PetriNetUnfolderBase]: For 710/744 co-relation queries the response was YES. [2025-02-06 09:23:17,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 4016 events. 311/4016 cut-off events. For 710/744 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15626 event pairs, 61 based on Foata normal form. 8/3810 useless extension candidates. Maximal degree in co-relation 3815. Up to 1009 conditions per place. [2025-02-06 09:23:17,942 INFO L140 encePairwiseOnDemand]: 367/379 looper letters, 84 selfloop transitions, 31 changer transitions 0/494 dead transitions. [2025-02-06 09:23:17,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 494 transitions, 1822 flow [2025-02-06 09:23:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2025-02-06 09:23:17,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876429199648197 [2025-02-06 09:23:17,945 INFO L175 Difference]: Start difference. First operand has 464 places, 455 transitions, 1472 flow. Second operand 6 states and 1993 transitions. [2025-02-06 09:23:17,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 494 transitions, 1822 flow [2025-02-06 09:23:17,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 494 transitions, 1746 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-02-06 09:23:17,961 INFO L231 Difference]: Finished difference. Result has 467 places, 485 transitions, 1654 flow [2025-02-06 09:23:17,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1654, PETRI_PLACES=467, PETRI_TRANSITIONS=485} [2025-02-06 09:23:17,963 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 92 predicate places. [2025-02-06 09:23:17,963 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 485 transitions, 1654 flow [2025-02-06 09:23:17,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.6666666666667) internal successors, (1948), 6 states have internal predecessors, (1948), 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-02-06 09:23:17,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:17,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:17,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:23:17,969 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-02-06 09:23:17,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash -365938043, now seen corresponding path program 1 times [2025-02-06 09:23:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349463476] [2025-02-06 09:23:17,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:18,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-02-06 09:23:18,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-02-06 09:23:18,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:18,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-02-06 09:23:21,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349463476] [2025-02-06 09:23:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349463476] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198537881] [2025-02-06 09:23:21,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:21,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:21,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:21,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:23:21,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:23:21,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1449 statements into 1 equivalence classes. [2025-02-06 09:23:22,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1449 of 1449 statements. [2025-02-06 09:23:22,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:22,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:22,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 5678 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:23:22,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-02-06 09:23:23,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:23:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-02-06 09:23:23,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198537881] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:23:23,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:23:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-02-06 09:23:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850864437] [2025-02-06 09:23:23,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:23:23,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 09:23:23,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:23,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 09:23:23,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 09:23:23,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-02-06 09:23:23,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 485 transitions, 1654 flow. Second operand has 34 states, 34 states have (on average 363.1764705882353) internal successors, (12348), 34 states have internal predecessors, (12348), 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-02-06 09:23:23,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:23,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-02-06 09:23:23,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:26,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L1044-3-->L1044: Formula: (and (= |v_fThread1of1ForFork1_#t~ret20#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_89| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_89|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_89| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#c~0.offset=|v_~#c~0.offset_89|} OutVars{~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_11|, fThread1of1ForFork1_#t~ret20#1=|v_fThread1of1ForFork1_#t~ret20#1_1|, ~#c~0.offset=|v_~#c~0.offset_89|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret20#1][421], [436#true, 376#true, Black: 394#(= |ULTIMATE.start_main_~i~0#1| 0), 4591#true, 1891#true, Black: 404#(= |ULTIMATE.start_main_~j~1#1| 0), 4602#true, 264#ULTIMATE.startFINALtrue, 121#L1044true, Black: 3315#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 440#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 4502#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 4508#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), Black: 1268#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 1906#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 3598#(< |ULTIMATE.start_main_~j~1#1| 28), 378#true, Black: 3062#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 4512#(and (= 0 |ULTIMATE.start_main_#t~post25#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4496#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 4538#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3326#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 1904#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1894#(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: 4544#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4490#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 1895#(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)), Black: 1893#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 1896#(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: 4532#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4550#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4594#(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)), 1902#true, Black: 4593#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), 372#L1044true, Black: 4596#(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: 4595#(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))]) [2025-02-06 09:23:26,256 INFO L294 olderBase$Statistics]: this new event has 2977 ancestors and is cut-off event [2025-02-06 09:23:26,256 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-02-06 09:23:26,256 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-02-06 09:23:26,256 INFO L297 olderBase$Statistics]: existing Event has 2950 ancestors and is cut-off event [2025-02-06 09:23:26,943 INFO L124 PetriNetUnfolderBase]: 340/6486 cut-off events. [2025-02-06 09:23:26,943 INFO L125 PetriNetUnfolderBase]: For 3587/3605 co-relation queries the response was YES. [2025-02-06 09:23:26,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8384 conditions, 6486 events. 340/6486 cut-off events. For 3587/3605 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17975 event pairs, 100 based on Foata normal form. 30/6248 useless extension candidates. Maximal degree in co-relation 5734. Up to 259 conditions per place. [2025-02-06 09:23:26,965 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 47 selfloop transitions, 135 changer transitions 0/586 dead transitions. [2025-02-06 09:23:26,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 586 transitions, 2782 flow [2025-02-06 09:23:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 09:23:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-02-06 09:23:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 16325 transitions. [2025-02-06 09:23:26,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571973028437408 [2025-02-06 09:23:26,976 INFO L175 Difference]: Start difference. First operand has 467 places, 485 transitions, 1654 flow. Second operand 45 states and 16325 transitions. [2025-02-06 09:23:26,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 586 transitions, 2782 flow [2025-02-06 09:23:26,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 586 transitions, 2782 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:26,994 INFO L231 Difference]: Finished difference. Result has 520 places, 560 transitions, 2528 flow [2025-02-06 09:23:26,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2528, PETRI_PLACES=520, PETRI_TRANSITIONS=560} [2025-02-06 09:23:26,996 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 145 predicate places. [2025-02-06 09:23:26,996 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 560 transitions, 2528 flow [2025-02-06 09:23:27,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 363.1764705882353) internal successors, (12348), 34 states have internal predecessors, (12348), 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-02-06 09:23:27,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:27,001 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:27,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 09:23:27,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:27,202 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-02-06 09:23:27,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1136915067, now seen corresponding path program 2 times [2025-02-06 09:23:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511903191] [2025-02-06 09:23:27,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:23:27,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:27,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2889 statements into 2 equivalence classes. [2025-02-06 09:23:27,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 131 of 2889 statements. [2025-02-06 09:23:27,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:23:27,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71641 trivial. 0 not checked. [2025-02-06 09:23:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511903191] [2025-02-06 09:23:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511903191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:23:27,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:23:27,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:23:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195446059] [2025-02-06 09:23:27,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:23:27,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:23:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:27,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:23:27,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:28,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-02-06 09:23:28,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 560 transitions, 2528 flow. Second operand has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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-02-06 09:23:28,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:28,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-02-06 09:23:28,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:31,878 INFO L124 PetriNetUnfolderBase]: 457/6746 cut-off events. [2025-02-06 09:23:31,878 INFO L125 PetriNetUnfolderBase]: For 2378/2470 co-relation queries the response was YES. [2025-02-06 09:23:31,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10692 conditions, 6746 events. 457/6746 cut-off events. For 2378/2470 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21240 event pairs, 87 based on Foata normal form. 34/6549 useless extension candidates. Maximal degree in co-relation 7275. Up to 1847 conditions per place. [2025-02-06 09:23:31,902 INFO L140 encePairwiseOnDemand]: 368/379 looper letters, 108 selfloop transitions, 55 changer transitions 0/621 dead transitions. [2025-02-06 09:23:31,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 621 transitions, 3180 flow [2025-02-06 09:23:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1990 transitions. [2025-02-06 09:23:31,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8751099384344767 [2025-02-06 09:23:31,904 INFO L175 Difference]: Start difference. First operand has 520 places, 560 transitions, 2528 flow. Second operand 6 states and 1990 transitions. [2025-02-06 09:23:31,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 621 transitions, 3180 flow [2025-02-06 09:23:31,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 621 transitions, 3072 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-02-06 09:23:31,931 INFO L231 Difference]: Finished difference. Result has 512 places, 609 transitions, 2974 flow [2025-02-06 09:23:31,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2974, PETRI_PLACES=512, PETRI_TRANSITIONS=609} [2025-02-06 09:23:31,932 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 137 predicate places. [2025-02-06 09:23:31,932 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 609 transitions, 2974 flow [2025-02-06 09:23:31,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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-02-06 09:23:31,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:31,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:23:31,934 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-02-06 09:23:31,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash -403446745, now seen corresponding path program 1 times [2025-02-06 09:23:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860351390] [2025-02-06 09:23:31,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:31,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:32,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2895 statements into 1 equivalence classes. [2025-02-06 09:23:32,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2895 of 2895 statements. [2025-02-06 09:23:32,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:32,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 36506 proven. 17025 refuted. 0 times theorem prover too weak. 18110 trivial. 0 not checked. [2025-02-06 09:23:43,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:43,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860351390] [2025-02-06 09:23:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860351390] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:43,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683489104] [2025-02-06 09:23:43,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:43,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:43,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:43,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:23:43,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:23:45,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2895 statements into 1 equivalence classes. [2025-02-06 09:23:46,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2895 of 2895 statements. [2025-02-06 09:23:46,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:46,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:46,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 11584 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 09:23:46,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 36506 proven. 17025 refuted. 0 times theorem prover too weak. 18110 trivial. 0 not checked. [2025-02-06 09:23:47,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:23:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 36506 proven. 17025 refuted. 0 times theorem prover too weak. 18110 trivial. 0 not checked. [2025-02-06 09:23:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683489104] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:23:49,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:23:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-02-06 09:23:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798336898] [2025-02-06 09:23:49,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:23:49,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-06 09:23:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:23:49,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-06 09:23:49,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 09:23:49,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 379 [2025-02-06 09:23:49,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 609 transitions, 2974 flow. Second operand has 63 states, 63 states have (on average 363.14285714285717) internal successors, (22878), 63 states have internal predecessors, (22878), 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-02-06 09:23:49,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:49,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 379 [2025-02-06 09:23:49,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:55,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L1044-3-->L1044: Formula: (and (= |v_fThread1of1ForFork1_#t~ret20#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_89| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_89|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_89| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#c~0.offset=|v_~#c~0.offset_89|} OutVars{~#c~0.base=|v_~#c~0.base_89|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_11|, fThread1of1ForFork1_#t~ret20#1=|v_fThread1of1ForFork1_#t~ret20#1_1|, ~#c~0.offset=|v_~#c~0.offset_89|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret20#1][540], [Black: 394#(= |ULTIMATE.start_main_~i~0#1| 0), 4591#true, 1891#true, 13400#true, Black: 404#(= |ULTIMATE.start_main_~j~1#1| 0), 121#L1044true, 378#true, 436#true, Black: 11363#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 4618#(<= |ULTIMATE.start_main_~j~1#1| 7), 376#true, Black: 11635#(< |ULTIMATE.start_main_~j~1#1| 27), Black: 11080#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 11907#(< |ULTIMATE.start_main_~j~1#1| 26), Black: 12451#(< |ULTIMATE.start_main_~j~1#1| 24), Black: 12179#(< |ULTIMATE.start_main_~j~1#1| 25), Black: 11091#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 13391#(= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0), Black: 13393#(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: 13394#(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)), Black: 13392#(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)), 4602#true, 264#ULTIMATE.startFINALtrue, Black: 3315#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 440#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 4502#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 4508#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), 13389#true, Black: 1268#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 1906#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 3598#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 3062#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 4512#(and (= 0 |ULTIMATE.start_main_#t~post25#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4496#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 4538#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3326#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 1904#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1894#(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: 4544#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4490#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 1895#(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)), Black: 1893#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 4532#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 1896#(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: 4550#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4594#(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)), 1902#true, Black: 4593#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), 372#L1044true, Black: 4596#(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: 4595#(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))]) [2025-02-06 09:23:55,964 INFO L294 olderBase$Statistics]: this new event has 5677 ancestors and is cut-off event [2025-02-06 09:23:55,964 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-02-06 09:23:55,964 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-02-06 09:23:55,964 INFO L297 olderBase$Statistics]: existing Event has 5650 ancestors and is cut-off event [2025-02-06 09:23:58,868 INFO L124 PetriNetUnfolderBase]: 526/11268 cut-off events. [2025-02-06 09:23:58,869 INFO L125 PetriNetUnfolderBase]: For 15131/15229 co-relation queries the response was YES. [2025-02-06 09:23:58,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15515 conditions, 11268 events. 526/11268 cut-off events. For 15131/15229 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 24612 event pairs, 115 based on Foata normal form. 81/11018 useless extension candidates. Maximal degree in co-relation 12202. Up to 318 conditions per place. [2025-02-06 09:23:58,902 INFO L140 encePairwiseOnDemand]: 373/379 looper letters, 92 selfloop transitions, 270 changer transitions 0/815 dead transitions. [2025-02-06 09:23:58,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 815 transitions, 5884 flow [2025-02-06 09:23:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-02-06 09:23:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-02-06 09:23:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 32637 transitions. [2025-02-06 09:23:58,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956816182937555 [2025-02-06 09:23:58,933 INFO L175 Difference]: Start difference. First operand has 512 places, 609 transitions, 2974 flow. Second operand 90 states and 32637 transitions. [2025-02-06 09:23:58,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 815 transitions, 5884 flow [2025-02-06 09:23:58,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 815 transitions, 5884 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:58,983 INFO L231 Difference]: Finished difference. Result has 617 places, 747 transitions, 4966 flow [2025-02-06 09:23:58,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=2974, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4966, PETRI_PLACES=617, PETRI_TRANSITIONS=747} [2025-02-06 09:23:58,986 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 242 predicate places. [2025-02-06 09:23:58,986 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 747 transitions, 4966 flow [2025-02-06 09:23:58,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 363.14285714285717) internal successors, (22878), 63 states have internal predecessors, (22878), 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-02-06 09:23:58,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:58,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:23:59,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:23:59,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 09:23:59,195 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-02-06 09:23:59,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash -96056057, now seen corresponding path program 2 times [2025-02-06 09:23:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389578803] [2025-02-06 09:23:59,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:23:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:59,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5595 statements into 2 equivalence classes. [2025-02-06 09:23:59,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 137 of 5595 statements. [2025-02-06 09:23:59,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:23:59,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 289051 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 289051 trivial. 0 not checked. [2025-02-06 09:24:00,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:00,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389578803] [2025-02-06 09:24:00,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389578803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:00,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:00,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:00,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636964699] [2025-02-06 09:24:00,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:00,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:00,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:00,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:00,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 379 [2025-02-06 09:24:00,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 747 transitions, 4966 flow. Second operand has 6 states, 6 states have (on average 323.6666666666667) internal successors, (1942), 6 states have internal predecessors, (1942), 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-02-06 09:24:00,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:00,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 379 [2025-02-06 09:24:00,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand