./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_24-evilcollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_24-evilcollapse_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 085e9170c725dbfce47ad23ff96af1e2e4188372955794675158fde45968fe8a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:27:57,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:27:57,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:27:57,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:27:57,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:27:57,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:27:57,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:27:57,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:27:57,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:27:57,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:27:57,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:27:57,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:27:57,328 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:27:57,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:27:57,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:27:57,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:27:57,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:27:57,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:27:57,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:27:57,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:27:57,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:27:57,330 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:57,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:57,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:57,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:27:57,331 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 085e9170c725dbfce47ad23ff96af1e2e4188372955794675158fde45968fe8a [2025-04-30 10:27:57,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:27:57,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:27:57,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:27:57,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:27:57,559 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:27:57,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_24-evilcollapse_nr.i [2025-04-30 10:27:58,842 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2605923a7/b557b164b85f4cb0bf8d97a4fd36e73f/FLAG2d7e79e82 [2025-04-30 10:27:59,116 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:27:59,117 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_24-evilcollapse_nr.i [2025-04-30 10:27:59,128 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2605923a7/b557b164b85f4cb0bf8d97a4fd36e73f/FLAG2d7e79e82 [2025-04-30 10:27:59,842 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2605923a7/b557b164b85f4cb0bf8d97a4fd36e73f [2025-04-30 10:27:59,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:27:59,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:27:59,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:59,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:27:59,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:27:59,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:59" (1/1) ... [2025-04-30 10:27:59,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e4efe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:59, skipping insertion in model container [2025-04-30 10:27:59,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:59" (1/1) ... [2025-04-30 10:27:59,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:28:00,214 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:28:00,219 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:28:00,220 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:28:00,220 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:28:00,243 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:28:00,271 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:28:00,328 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:28:00,329 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:28:00,330 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:28:00,331 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:28:00,350 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:28:00,393 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:28:00,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00 WrapperNode [2025-04-30 10:28:00,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:28:00,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:28:00,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:28:00,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:28:00,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,460 INFO L138 Inliner]: procedures = 275, calls = 101, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 309 [2025-04-30 10:28:00,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:28:00,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:28:00,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:28:00,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:28:00,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:28:00,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:28:00,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:28:00,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:28:00,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (1/1) ... [2025-04-30 10:28:00,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:28:00,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:00,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:28:00,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:28:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-04-30 10:28:00,568 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-04-30 10:28:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:28:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-30 10:28:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:28:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:28:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:28:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:28:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:28:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:28:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:28:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:28:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:28:00,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:28:00,570 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:28:00,700 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:28:00,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:28:01,249 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:28:01,249 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:28:01,267 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:28:01,267 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:28:01,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:01 BoogieIcfgContainer [2025-04-30 10:28:01,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:28:01,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:28:01,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:28:01,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:28:01,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:27:59" (1/3) ... [2025-04-30 10:28:01,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45617143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:28:01, skipping insertion in model container [2025-04-30 10:28:01,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:00" (2/3) ... [2025-04-30 10:28:01,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45617143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:28:01, skipping insertion in model container [2025-04-30 10:28:01,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:01" (3/3) ... [2025-04-30 10:28:01,273 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_24-evilcollapse_nr.i [2025-04-30 10:28:01,282 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:28:01,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_24-evilcollapse_nr.i that has 2 procedures, 357 locations, 363 edges, 1 initial locations, 4 loop locations, and 16 error locations. [2025-04-30 10:28:01,284 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:28:01,365 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:28:01,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 433 transitions, 874 flow [2025-04-30 10:28:01,505 INFO L116 PetriNetUnfolderBase]: 11/431 cut-off events. [2025-04-30 10:28:01,506 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:01,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 431 events. 11/431 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 784 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 358. Up to 2 conditions per place. [2025-04-30 10:28:01,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 433 transitions, 874 flow [2025-04-30 10:28:01,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 431 transitions, 868 flow [2025-04-30 10:28:01,523 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:28:01,530 INFO L340 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;@22f55513, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:28:01,532 INFO L341 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-04-30 10:28:01,572 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:28:01,572 INFO L116 PetriNetUnfolderBase]: 0/114 cut-off events. [2025-04-30 10:28:01,572 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:01,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:01,573 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] [2025-04-30 10:28:01,573 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:01,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1004013427, now seen corresponding path program 1 times [2025-04-30 10:28:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:01,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583082227] [2025-04-30 10:28:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:01,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-30 10:28:01,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-30 10:28:01,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:01,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:02,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583082227] [2025-04-30 10:28:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583082227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954913351] [2025-04-30 10:28:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:02,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:02,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:02,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:02,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 433 [2025-04-30 10:28:02,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 431 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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-04-30 10:28:02,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:02,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 433 [2025-04-30 10:28:02,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:03,234 INFO L116 PetriNetUnfolderBase]: 450/1908 cut-off events. [2025-04-30 10:28:03,234 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-30 10:28:03,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 1908 events. 450/1908 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11486 event pairs, 342 based on Foata normal form. 36/1732 useless extension candidates. Maximal degree in co-relation 2477. Up to 854 conditions per place. [2025-04-30 10:28:03,248 INFO L140 encePairwiseOnDemand]: 417/433 looper letters, 80 selfloop transitions, 10 changer transitions 2/425 dead transitions. [2025-04-30 10:28:03,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1036 flow [2025-04-30 10:28:03,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2118 transitions. [2025-04-30 10:28:03,266 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.815242494226328 [2025-04-30 10:28:03,267 INFO L175 Difference]: Start difference. First operand has 427 places, 431 transitions, 868 flow. Second operand 6 states and 2118 transitions. [2025-04-30 10:28:03,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1036 flow [2025-04-30 10:28:03,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1034 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:03,282 INFO L231 Difference]: Finished difference. Result has 428 places, 423 transitions, 870 flow [2025-04-30 10:28:03,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=870, PETRI_PLACES=428, PETRI_TRANSITIONS=423} [2025-04-30 10:28:03,287 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-04-30 10:28:03,287 INFO L485 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 870 flow [2025-04-30 10:28:03,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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-04-30 10:28:03,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:03,289 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] [2025-04-30 10:28:03,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:28:03,289 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:03,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash -930745059, now seen corresponding path program 1 times [2025-04-30 10:28:03,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:03,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195153466] [2025-04-30 10:28:03,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:03,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:03,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-30 10:28:03,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-30 10:28:03,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:03,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:03,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:03,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195153466] [2025-04-30 10:28:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195153466] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:03,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:03,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:03,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436027705] [2025-04-30 10:28:03,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:03,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:03,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:03,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:04,049 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 433 [2025-04-30 10:28:04,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 423 transitions, 870 flow. Second operand has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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-04-30 10:28:04,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:04,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 433 [2025-04-30 10:28:04,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:04,263 INFO L116 PetriNetUnfolderBase]: 450/1904 cut-off events. [2025-04-30 10:28:04,264 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:04,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1904 events. 450/1904 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11496 event pairs, 342 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2646. Up to 854 conditions per place. [2025-04-30 10:28:04,275 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 80 selfloop transitions, 10 changer transitions 0/421 dead transitions. [2025-04-30 10:28:04,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 421 transitions, 1046 flow [2025-04-30 10:28:04,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2114 transitions. [2025-04-30 10:28:04,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8137028483448807 [2025-04-30 10:28:04,279 INFO L175 Difference]: Start difference. First operand has 428 places, 423 transitions, 870 flow. Second operand 6 states and 2114 transitions. [2025-04-30 10:28:04,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 421 transitions, 1046 flow [2025-04-30 10:28:04,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1026 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:04,290 INFO L231 Difference]: Finished difference. Result has 424 places, 421 transitions, 866 flow [2025-04-30 10:28:04,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=424, PETRI_TRANSITIONS=421} [2025-04-30 10:28:04,292 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -3 predicate places. [2025-04-30 10:28:04,293 INFO L485 AbstractCegarLoop]: Abstraction has has 424 places, 421 transitions, 866 flow [2025-04-30 10:28:04,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.3333333333333) internal successors, (2030), 6 states have internal predecessors, (2030), 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-04-30 10:28:04,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:04,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:04,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:28:04,295 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:04,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1156264127, now seen corresponding path program 1 times [2025-04-30 10:28:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:04,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054990126] [2025-04-30 10:28:04,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:04,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-30 10:28:04,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-30 10:28:04,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:04,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:04,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:04,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054990126] [2025-04-30 10:28:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054990126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:04,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:04,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:28:04,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307857100] [2025-04-30 10:28:04,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:04,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:04,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:04,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:04,409 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 433 [2025-04-30 10:28:04,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 421 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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-04-30 10:28:04,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:04,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 433 [2025-04-30 10:28:04,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:04,487 INFO L116 PetriNetUnfolderBase]: 30/723 cut-off events. [2025-04-30 10:28:04,488 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:04,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 723 events. 30/723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2581 event pairs, 18 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 493. Up to 45 conditions per place. [2025-04-30 10:28:04,491 INFO L140 encePairwiseOnDemand]: 430/433 looper letters, 11 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-04-30 10:28:04,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 422 transitions, 894 flow [2025-04-30 10:28:04,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2025-04-30 10:28:04,493 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9738260200153964 [2025-04-30 10:28:04,494 INFO L175 Difference]: Start difference. First operand has 424 places, 421 transitions, 866 flow. Second operand 3 states and 1265 transitions. [2025-04-30 10:28:04,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 422 transitions, 894 flow [2025-04-30 10:28:04,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 422 transitions, 874 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:04,501 INFO L231 Difference]: Finished difference. Result has 422 places, 422 transitions, 858 flow [2025-04-30 10:28:04,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=422, PETRI_TRANSITIONS=422} [2025-04-30 10:28:04,503 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -5 predicate places. [2025-04-30 10:28:04,503 INFO L485 AbstractCegarLoop]: Abstraction has has 422 places, 422 transitions, 858 flow [2025-04-30 10:28:04,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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-04-30 10:28:04,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:04,504 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] [2025-04-30 10:28:04,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:28:04,505 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:04,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash -548631127, now seen corresponding path program 1 times [2025-04-30 10:28:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:04,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352658704] [2025-04-30 10:28:04,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:04,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-04-30 10:28:04,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-04-30 10:28:04,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:04,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:04,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352658704] [2025-04-30 10:28:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352658704] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:04,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:04,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689230802] [2025-04-30 10:28:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:04,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:04,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:04,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:05,191 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 433 [2025-04-30 10:28:05,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 422 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 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-04-30 10:28:05,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:05,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 433 [2025-04-30 10:28:05,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:05,415 INFO L116 PetriNetUnfolderBase]: 451/2026 cut-off events. [2025-04-30 10:28:05,416 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:28:05,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 2026 events. 451/2026 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12107 event pairs, 342 based on Foata normal form. 0/1814 useless extension candidates. Maximal degree in co-relation 2726. Up to 902 conditions per place. [2025-04-30 10:28:05,427 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 87 selfloop transitions, 5 changer transitions 0/421 dead transitions. [2025-04-30 10:28:05,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1040 flow [2025-04-30 10:28:05,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2109 transitions. [2025-04-30 10:28:05,433 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8117782909930716 [2025-04-30 10:28:05,433 INFO L175 Difference]: Start difference. First operand has 422 places, 422 transitions, 858 flow. Second operand 6 states and 2109 transitions. [2025-04-30 10:28:05,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1040 flow [2025-04-30 10:28:05,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 421 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:28:05,438 INFO L231 Difference]: Finished difference. Result has 425 places, 421 transitions, 864 flow [2025-04-30 10:28:05,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=425, PETRI_TRANSITIONS=421} [2025-04-30 10:28:05,441 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -2 predicate places. [2025-04-30 10:28:05,441 INFO L485 AbstractCegarLoop]: Abstraction has has 425 places, 421 transitions, 864 flow [2025-04-30 10:28:05,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 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-04-30 10:28:05,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:05,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:05,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:28:05,442 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:05,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:05,443 INFO L85 PathProgramCache]: Analyzing trace with hash 59557119, now seen corresponding path program 1 times [2025-04-30 10:28:05,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:05,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166541981] [2025-04-30 10:28:05,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:05,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:05,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-04-30 10:28:05,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-04-30 10:28:05,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:05,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:05,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:05,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166541981] [2025-04-30 10:28:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166541981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:05,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:05,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:28:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917677205] [2025-04-30 10:28:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:05,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:05,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:05,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:05,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:05,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 433 [2025-04-30 10:28:05,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 421 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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-04-30 10:28:05,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:05,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 433 [2025-04-30 10:28:05,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:05,603 INFO L116 PetriNetUnfolderBase]: 30/909 cut-off events. [2025-04-30 10:28:05,604 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:05,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 909 events. 30/909 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2617 event pairs, 18 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 571. Up to 49 conditions per place. [2025-04-30 10:28:05,607 INFO L140 encePairwiseOnDemand]: 430/433 looper letters, 11 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-04-30 10:28:05,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 892 flow [2025-04-30 10:28:05,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1265 transitions. [2025-04-30 10:28:05,612 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9738260200153964 [2025-04-30 10:28:05,612 INFO L175 Difference]: Start difference. First operand has 425 places, 421 transitions, 864 flow. Second operand 3 states and 1265 transitions. [2025-04-30 10:28:05,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 892 flow [2025-04-30 10:28:05,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 422 transitions, 882 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:05,618 INFO L231 Difference]: Finished difference. Result has 423 places, 422 transitions, 866 flow [2025-04-30 10:28:05,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=423, PETRI_TRANSITIONS=422} [2025-04-30 10:28:05,620 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -4 predicate places. [2025-04-30 10:28:05,620 INFO L485 AbstractCegarLoop]: Abstraction has has 423 places, 422 transitions, 866 flow [2025-04-30 10:28:05,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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-04-30 10:28:05,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:05,621 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] [2025-04-30 10:28:05,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:28:05,622 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:05,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1654344533, now seen corresponding path program 1 times [2025-04-30 10:28:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:05,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169957513] [2025-04-30 10:28:05,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:05,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-30 10:28:05,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-30 10:28:05,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:05,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:06,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169957513] [2025-04-30 10:28:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169957513] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280812856] [2025-04-30 10:28:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:06,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:06,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:06,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:06,450 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-04-30 10:28:06,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 422 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 373.5) internal successors, (2241), 6 states have internal predecessors, (2241), 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-04-30 10:28:06,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:06,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-04-30 10:28:06,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:06,604 INFO L116 PetriNetUnfolderBase]: 76/1221 cut-off events. [2025-04-30 10:28:06,604 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:28:06,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1221 events. 76/1221 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4686 event pairs, 42 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 1011. Up to 263 conditions per place. [2025-04-30 10:28:06,610 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/421 dead transitions. [2025-04-30 10:28:06,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 421 transitions, 982 flow [2025-04-30 10:28:06,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-04-30 10:28:06,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-04-30 10:28:06,614 INFO L175 Difference]: Start difference. First operand has 423 places, 422 transitions, 866 flow. Second operand 6 states and 2274 transitions. [2025-04-30 10:28:06,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 421 transitions, 982 flow [2025-04-30 10:28:06,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 421 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:28:06,619 INFO L231 Difference]: Finished difference. Result has 426 places, 421 transitions, 872 flow [2025-04-30 10:28:06,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=426, PETRI_TRANSITIONS=421} [2025-04-30 10:28:06,620 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -1 predicate places. [2025-04-30 10:28:06,620 INFO L485 AbstractCegarLoop]: Abstraction has has 426 places, 421 transitions, 872 flow [2025-04-30 10:28:06,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 373.5) internal successors, (2241), 6 states have internal predecessors, (2241), 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-04-30 10:28:06,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:06,621 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] [2025-04-30 10:28:06,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:28:06,621 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:06,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash 79890255, now seen corresponding path program 1 times [2025-04-30 10:28:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:06,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023432952] [2025-04-30 10:28:06,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:06,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-04-30 10:28:06,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-04-30 10:28:06,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:06,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:06,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:06,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023432952] [2025-04-30 10:28:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023432952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:06,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659575284] [2025-04-30 10:28:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:06,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:06,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:06,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:07,252 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 433 [2025-04-30 10:28:07,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 421 transitions, 872 flow. Second operand has 6 states, 6 states have (on average 341.3333333333333) internal successors, (2048), 6 states have internal predecessors, (2048), 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-04-30 10:28:07,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:07,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 433 [2025-04-30 10:28:07,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:07,474 INFO L116 PetriNetUnfolderBase]: 451/2206 cut-off events. [2025-04-30 10:28:07,474 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:28:07,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3270 conditions, 2206 events. 451/2206 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12352 event pairs, 342 based on Foata normal form. 0/1994 useless extension candidates. Maximal degree in co-relation 2769. Up to 968 conditions per place. [2025-04-30 10:28:07,486 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 87 selfloop transitions, 5 changer transitions 0/420 dead transitions. [2025-04-30 10:28:07,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 420 transitions, 1054 flow [2025-04-30 10:28:07,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2109 transitions. [2025-04-30 10:28:07,490 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8117782909930716 [2025-04-30 10:28:07,490 INFO L175 Difference]: Start difference. First operand has 426 places, 421 transitions, 872 flow. Second operand 6 states and 2109 transitions. [2025-04-30 10:28:07,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 420 transitions, 1054 flow [2025-04-30 10:28:07,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1044 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:07,496 INFO L231 Difference]: Finished difference. Result has 425 places, 420 transitions, 870 flow [2025-04-30 10:28:07,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=870, PETRI_PLACES=425, PETRI_TRANSITIONS=420} [2025-04-30 10:28:07,497 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -2 predicate places. [2025-04-30 10:28:07,498 INFO L485 AbstractCegarLoop]: Abstraction has has 425 places, 420 transitions, 870 flow [2025-04-30 10:28:07,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 341.3333333333333) internal successors, (2048), 6 states have internal predecessors, (2048), 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-04-30 10:28:07,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:07,499 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] [2025-04-30 10:28:07,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:28:07,499 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:07,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1191096107, now seen corresponding path program 1 times [2025-04-30 10:28:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:07,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183421399] [2025-04-30 10:28:07,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:07,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-04-30 10:28:07,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-04-30 10:28:07,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:07,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:07,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183421399] [2025-04-30 10:28:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183421399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017047992] [2025-04-30 10:28:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:07,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:07,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:07,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:08,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 433 [2025-04-30 10:28:08,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 420 transitions, 870 flow. Second operand has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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-04-30 10:28:08,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:08,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 433 [2025-04-30 10:28:08,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:08,546 INFO L116 PetriNetUnfolderBase]: 451/2202 cut-off events. [2025-04-30 10:28:08,547 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:28:08,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3250 conditions, 2202 events. 451/2202 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12337 event pairs, 342 based on Foata normal form. 0/1994 useless extension candidates. Maximal degree in co-relation 2785. Up to 952 conditions per place. [2025-04-30 10:28:08,558 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 83 selfloop transitions, 5 changer transitions 0/419 dead transitions. [2025-04-30 10:28:08,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 419 transitions, 1044 flow [2025-04-30 10:28:08,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2129 transitions. [2025-04-30 10:28:08,563 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8194765204003079 [2025-04-30 10:28:08,563 INFO L175 Difference]: Start difference. First operand has 425 places, 420 transitions, 870 flow. Second operand 6 states and 2129 transitions. [2025-04-30 10:28:08,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 419 transitions, 1044 flow [2025-04-30 10:28:08,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 419 transitions, 1034 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:08,569 INFO L231 Difference]: Finished difference. Result has 424 places, 419 transitions, 868 flow [2025-04-30 10:28:08,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=868, PETRI_PLACES=424, PETRI_TRANSITIONS=419} [2025-04-30 10:28:08,572 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -3 predicate places. [2025-04-30 10:28:08,572 INFO L485 AbstractCegarLoop]: Abstraction has has 424 places, 419 transitions, 868 flow [2025-04-30 10:28:08,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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-04-30 10:28:08,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:08,574 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] [2025-04-30 10:28:08,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:28:08,574 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:08,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1343605523, now seen corresponding path program 1 times [2025-04-30 10:28:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:08,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689571800] [2025-04-30 10:28:08,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:08,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-04-30 10:28:08,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-04-30 10:28:08,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:08,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:08,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689571800] [2025-04-30 10:28:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689571800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:08,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399553556] [2025-04-30 10:28:08,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:08,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:08,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:08,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:09,257 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 433 [2025-04-30 10:28:09,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 419 transitions, 868 flow. Second operand has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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-04-30 10:28:09,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:09,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 433 [2025-04-30 10:28:09,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:09,445 INFO L116 PetriNetUnfolderBase]: 451/2198 cut-off events. [2025-04-30 10:28:09,446 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:09,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 2198 events. 451/2198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12277 event pairs, 342 based on Foata normal form. 0/1994 useless extension candidates. Maximal degree in co-relation 2800. Up to 952 conditions per place. [2025-04-30 10:28:09,454 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 83 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2025-04-30 10:28:09,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 418 transitions, 1042 flow [2025-04-30 10:28:09,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2129 transitions. [2025-04-30 10:28:09,459 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8194765204003079 [2025-04-30 10:28:09,459 INFO L175 Difference]: Start difference. First operand has 424 places, 419 transitions, 868 flow. Second operand 6 states and 2129 transitions. [2025-04-30 10:28:09,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 418 transitions, 1042 flow [2025-04-30 10:28:09,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 418 transitions, 1032 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:09,464 INFO L231 Difference]: Finished difference. Result has 423 places, 418 transitions, 866 flow [2025-04-30 10:28:09,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=423, PETRI_TRANSITIONS=418} [2025-04-30 10:28:09,465 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -4 predicate places. [2025-04-30 10:28:09,465 INFO L485 AbstractCegarLoop]: Abstraction has has 423 places, 418 transitions, 866 flow [2025-04-30 10:28:09,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 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-04-30 10:28:09,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:09,466 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] [2025-04-30 10:28:09,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:28:09,466 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:09,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash -953601274, now seen corresponding path program 1 times [2025-04-30 10:28:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:09,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328837113] [2025-04-30 10:28:09,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:09,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-04-30 10:28:09,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-04-30 10:28:09,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:09,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:28:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:09,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328837113] [2025-04-30 10:28:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328837113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:09,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:09,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:09,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534621567] [2025-04-30 10:28:09,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:09,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:09,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:09,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:10,088 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 433 [2025-04-30 10:28:10,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 418 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 342.5) internal successors, (2055), 6 states have internal predecessors, (2055), 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-04-30 10:28:10,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:10,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 433 [2025-04-30 10:28:10,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:10,462 INFO L116 PetriNetUnfolderBase]: 451/2194 cut-off events. [2025-04-30 10:28:10,463 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:28:10,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3262 conditions, 2194 events. 451/2194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12305 event pairs, 342 based on Foata normal form. 0/1994 useless extension candidates. Maximal degree in co-relation 2813. Up to 972 conditions per place. [2025-04-30 10:28:10,471 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 88 selfloop transitions, 5 changer transitions 0/417 dead transitions. [2025-04-30 10:28:10,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 417 transitions, 1050 flow [2025-04-30 10:28:10,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2104 transitions. [2025-04-30 10:28:10,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8098537336412626 [2025-04-30 10:28:10,476 INFO L175 Difference]: Start difference. First operand has 423 places, 418 transitions, 866 flow. Second operand 6 states and 2104 transitions. [2025-04-30 10:28:10,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 417 transitions, 1050 flow [2025-04-30 10:28:10,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 417 transitions, 1040 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:10,481 INFO L231 Difference]: Finished difference. Result has 422 places, 417 transitions, 864 flow [2025-04-30 10:28:10,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=422, PETRI_TRANSITIONS=417} [2025-04-30 10:28:10,483 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -5 predicate places. [2025-04-30 10:28:10,483 INFO L485 AbstractCegarLoop]: Abstraction has has 422 places, 417 transitions, 864 flow [2025-04-30 10:28:10,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.5) internal successors, (2055), 6 states have internal predecessors, (2055), 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-04-30 10:28:10,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:10,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:10,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:28:10,485 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:10,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1980143527, now seen corresponding path program 1 times [2025-04-30 10:28:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:10,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301533227] [2025-04-30 10:28:10,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:10,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-04-30 10:28:10,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-04-30 10:28:10,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:10,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:28:10,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:10,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301533227] [2025-04-30 10:28:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301533227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:10,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085086078] [2025-04-30 10:28:10,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:10,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:10,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:10,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:10,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:28:10,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-04-30 10:28:10,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-04-30 10:28:10,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:10,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:10,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:28:10,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:28:10,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:28:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085086078] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:11,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:28:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270446558] [2025-04-30 10:28:11,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:11,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:28:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:11,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:28:11,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:28:11,095 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-04-30 10:28:11,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 417 transitions, 864 flow. Second operand has 10 states, 10 states have (on average 415.8) internal successors, (4158), 10 states have internal predecessors, (4158), 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-04-30 10:28:11,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:11,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-04-30 10:28:11,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:11,260 INFO L116 PetriNetUnfolderBase]: 30/1073 cut-off events. [2025-04-30 10:28:11,260 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:28:11,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 1073 events. 30/1073 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1990 event pairs, 18 based on Foata normal form. 4/1036 useless extension candidates. Maximal degree in co-relation 564. Up to 49 conditions per place. [2025-04-30 10:28:11,265 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 15 selfloop transitions, 9 changer transitions 0/425 dead transitions. [2025-04-30 10:28:11,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 930 flow [2025-04-30 10:28:11,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:28:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:28:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3752 transitions. [2025-04-30 10:28:11,271 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9627918911983577 [2025-04-30 10:28:11,272 INFO L175 Difference]: Start difference. First operand has 422 places, 417 transitions, 864 flow. Second operand 9 states and 3752 transitions. [2025-04-30 10:28:11,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 930 flow [2025-04-30 10:28:11,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 425 transitions, 920 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:11,277 INFO L231 Difference]: Finished difference. Result has 428 places, 423 transitions, 904 flow [2025-04-30 10:28:11,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=904, PETRI_PLACES=428, PETRI_TRANSITIONS=423} [2025-04-30 10:28:11,278 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-04-30 10:28:11,279 INFO L485 AbstractCegarLoop]: Abstraction has has 428 places, 423 transitions, 904 flow [2025-04-30 10:28:11,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 415.8) internal successors, (4158), 10 states have internal predecessors, (4158), 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-04-30 10:28:11,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:11,280 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:11,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:28:11,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:28:11,485 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:11,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 999765669, now seen corresponding path program 2 times [2025-04-30 10:28:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:11,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898279839] [2025-04-30 10:28:11,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:11,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-04-30 10:28:11,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 407 statements. [2025-04-30 10:28:11,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:11,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-04-30 10:28:11,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:11,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898279839] [2025-04-30 10:28:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898279839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:11,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:11,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239608474] [2025-04-30 10:28:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:11,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:11,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:11,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:11,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:12,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-04-30 10:28:12,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 423 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 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-04-30 10:28:12,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:12,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-04-30 10:28:12,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:12,816 INFO L116 PetriNetUnfolderBase]: 76/1388 cut-off events. [2025-04-30 10:28:12,816 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-30 10:28:12,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 1388 events. 76/1388 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4065 event pairs, 42 based on Foata normal form. 0/1305 useless extension candidates. Maximal degree in co-relation 1133. Up to 307 conditions per place. [2025-04-30 10:28:12,823 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/422 dead transitions. [2025-04-30 10:28:12,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 422 transitions, 1020 flow [2025-04-30 10:28:12,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-04-30 10:28:12,829 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-04-30 10:28:12,829 INFO L175 Difference]: Start difference. First operand has 428 places, 423 transitions, 904 flow. Second operand 6 states and 2274 transitions. [2025-04-30 10:28:12,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 422 transitions, 1020 flow [2025-04-30 10:28:12,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 422 transitions, 1014 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:28:12,835 INFO L231 Difference]: Finished difference. Result has 431 places, 422 transitions, 906 flow [2025-04-30 10:28:12,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=906, PETRI_PLACES=431, PETRI_TRANSITIONS=422} [2025-04-30 10:28:12,837 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 4 predicate places. [2025-04-30 10:28:12,837 INFO L485 AbstractCegarLoop]: Abstraction has has 431 places, 422 transitions, 906 flow [2025-04-30 10:28:12,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 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-04-30 10:28:12,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:12,839 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:12,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:28:12,839 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:12,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:12,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1853984689, now seen corresponding path program 1 times [2025-04-30 10:28:12,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:12,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109523855] [2025-04-30 10:28:12,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:12,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-04-30 10:28:12,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-04-30 10:28:12,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:12,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-04-30 10:28:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:13,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109523855] [2025-04-30 10:28:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109523855] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:13,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290141833] [2025-04-30 10:28:13,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:13,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:13,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:13,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:13,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:28:13,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-04-30 10:28:13,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-04-30 10:28:13,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:13,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:28:13,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-30 10:28:13,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 333 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-30 10:28:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290141833] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:14,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-04-30 10:28:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305477287] [2025-04-30 10:28:14,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:14,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:28:14,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:14,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:28:14,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:28:14,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 433 [2025-04-30 10:28:14,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 422 transitions, 906 flow. Second operand has 19 states, 19 states have (on average 410.5263157894737) internal successors, (7800), 19 states have internal predecessors, (7800), 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-04-30 10:28:14,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:14,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 433 [2025-04-30 10:28:14,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:15,160 INFO L116 PetriNetUnfolderBase]: 31/2452 cut-off events. [2025-04-30 10:28:15,161 INFO L117 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-04-30 10:28:15,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 2452 events. 31/2452 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1985 event pairs, 18 based on Foata normal form. 13/2425 useless extension candidates. Maximal degree in co-relation 2363. Up to 51 conditions per place. [2025-04-30 10:28:15,166 INFO L140 encePairwiseOnDemand]: 422/433 looper letters, 47 selfloop transitions, 68 changer transitions 0/508 dead transitions. [2025-04-30 10:28:15,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 508 transitions, 1546 flow [2025-04-30 10:28:15,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-30 10:28:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-04-30 10:28:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 25832 transitions. [2025-04-30 10:28:15,188 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9469555335606143 [2025-04-30 10:28:15,189 INFO L175 Difference]: Start difference. First operand has 431 places, 422 transitions, 906 flow. Second operand 63 states and 25832 transitions. [2025-04-30 10:28:15,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 508 transitions, 1546 flow [2025-04-30 10:28:15,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 508 transitions, 1536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:15,195 INFO L231 Difference]: Finished difference. Result has 504 places, 484 transitions, 1416 flow [2025-04-30 10:28:15,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1416, PETRI_PLACES=504, PETRI_TRANSITIONS=484} [2025-04-30 10:28:15,196 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 77 predicate places. [2025-04-30 10:28:15,196 INFO L485 AbstractCegarLoop]: Abstraction has has 504 places, 484 transitions, 1416 flow [2025-04-30 10:28:15,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 410.5263157894737) internal successors, (7800), 19 states have internal predecessors, (7800), 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-04-30 10:28:15,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:15,198 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] [2025-04-30 10:28:15,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:28:15,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:28:15,403 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:15,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1337777599, now seen corresponding path program 2 times [2025-04-30 10:28:15,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:15,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728480649] [2025-04-30 10:28:15,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:15,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:15,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1426 statements into 2 equivalence classes. [2025-04-30 10:28:15,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 1426 statements. [2025-04-30 10:28:15,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:15,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10209 trivial. 0 not checked. [2025-04-30 10:28:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:15,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728480649] [2025-04-30 10:28:15,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728480649] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:15,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195326438] [2025-04-30 10:28:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:15,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:15,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:15,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:16,473 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 433 [2025-04-30 10:28:16,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 484 transitions, 1416 flow. Second operand has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 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-04-30 10:28:16,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:16,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 433 [2025-04-30 10:28:16,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:17,114 INFO L116 PetriNetUnfolderBase]: 77/2767 cut-off events. [2025-04-30 10:28:17,114 INFO L117 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-04-30 10:28:17,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 2767 events. 77/2767 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4040 event pairs, 42 based on Foata normal form. 0/2685 useless extension candidates. Maximal degree in co-relation 1813. Up to 735 conditions per place. [2025-04-30 10:28:17,119 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 54 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-04-30 10:28:17,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 483 transitions, 1532 flow [2025-04-30 10:28:17,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2274 transitions. [2025-04-30 10:28:17,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8752886836027713 [2025-04-30 10:28:17,122 INFO L175 Difference]: Start difference. First operand has 504 places, 484 transitions, 1416 flow. Second operand 6 states and 2274 transitions. [2025-04-30 10:28:17,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 483 transitions, 1532 flow [2025-04-30 10:28:17,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 483 transitions, 1456 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-04-30 10:28:17,131 INFO L231 Difference]: Finished difference. Result has 501 places, 483 transitions, 1348 flow [2025-04-30 10:28:17,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1348, PETRI_PLACES=501, PETRI_TRANSITIONS=483} [2025-04-30 10:28:17,131 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 74 predicate places. [2025-04-30 10:28:17,131 INFO L485 AbstractCegarLoop]: Abstraction has has 501 places, 483 transitions, 1348 flow [2025-04-30 10:28:17,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.3333333333333) internal successors, (2258), 6 states have internal predecessors, (2258), 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-04-30 10:28:17,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:17,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:17,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:28:17,133 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:17,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -635940151, now seen corresponding path program 1 times [2025-04-30 10:28:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:17,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022935927] [2025-04-30 10:28:17,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:17,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-04-30 10:28:17,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-04-30 10:28:17,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:17,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-04-30 10:28:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:19,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022935927] [2025-04-30 10:28:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022935927] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:19,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12475184] [2025-04-30 10:28:19,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:19,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:19,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:28:20,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1460 statements into 1 equivalence classes. [2025-04-30 10:28:20,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1460 of 1460 statements. [2025-04-30 10:28:20,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:20,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:20,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 5698 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:28:20,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-04-30 10:28:21,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10279 backedges. 5465 proven. 2317 refuted. 0 times theorem prover too weak. 2497 trivial. 0 not checked. [2025-04-30 10:28:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12475184] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:21,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:21,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-04-30 10:28:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094842130] [2025-04-30 10:28:21,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:21,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:28:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:21,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:28:21,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:28:21,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-04-30 10:28:21,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 483 transitions, 1348 flow. Second operand has 34 states, 34 states have (on average 416.1764705882353) internal successors, (14150), 34 states have internal predecessors, (14150), 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-04-30 10:28:21,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:21,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-04-30 10:28:21,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:23,588 INFO L116 PetriNetUnfolderBase]: 31/4611 cut-off events. [2025-04-30 10:28:23,588 INFO L117 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-04-30 10:28:23,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5422 conditions, 4611 events. 31/4611 cut-off events. For 3207/3207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1982 event pairs, 18 based on Foata normal form. 24/4596 useless extension candidates. Maximal degree in co-relation 5381. Up to 78 conditions per place. [2025-04-30 10:28:23,596 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 47 selfloop transitions, 135 changer transitions 0/584 dead transitions. [2025-04-30 10:28:23,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 584 transitions, 2476 flow [2025-04-30 10:28:23,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-30 10:28:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-30 10:28:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 18710 transitions. [2025-04-30 10:28:23,603 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9602258147292789 [2025-04-30 10:28:23,604 INFO L175 Difference]: Start difference. First operand has 501 places, 483 transitions, 1348 flow. Second operand 45 states and 18710 transitions. [2025-04-30 10:28:23,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 584 transitions, 2476 flow [2025-04-30 10:28:23,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 584 transitions, 2466 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:23,617 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 2212 flow [2025-04-30 10:28:23,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2212, PETRI_PLACES=549, PETRI_TRANSITIONS=558} [2025-04-30 10:28:23,619 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 122 predicate places. [2025-04-30 10:28:23,619 INFO L485 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 2212 flow [2025-04-30 10:28:23,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 416.1764705882353) internal successors, (14150), 34 states have internal predecessors, (14150), 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-04-30 10:28:23,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:23,623 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, 1, 1, 1, 1, 1] [2025-04-30 10:28:23,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:28:23,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:23,824 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:23,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash 836801737, now seen corresponding path program 2 times [2025-04-30 10:28:23,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:23,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625261479] [2025-04-30 10:28:23,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:24,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2900 statements into 2 equivalence classes. [2025-04-30 10:28:24,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 142 of 2900 statements. [2025-04-30 10:28:24,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:24,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48391 trivial. 0 not checked. [2025-04-30 10:28:24,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:24,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625261479] [2025-04-30 10:28:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625261479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:24,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:24,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:24,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523445558] [2025-04-30 10:28:24,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:24,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:24,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:24,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:25,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 433 [2025-04-30 10:28:25,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 558 transitions, 2212 flow. Second operand has 6 states, 6 states have (on average 377.5) internal successors, (2265), 6 states have internal predecessors, (2265), 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-04-30 10:28:25,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:25,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 433 [2025-04-30 10:28:25,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:27,712 INFO L116 PetriNetUnfolderBase]: 201/5512 cut-off events. [2025-04-30 10:28:27,713 INFO L117 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-04-30 10:28:27,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 5512 events. 201/5512 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8978 event pairs, 54 based on Foata normal form. 0/5368 useless extension candidates. Maximal degree in co-relation 4118. Up to 1548 conditions per place. [2025-04-30 10:28:27,721 INFO L140 encePairwiseOnDemand]: 421/433 looper letters, 71 selfloop transitions, 23 changer transitions 0/593 dead transitions. [2025-04-30 10:28:27,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 593 transitions, 2478 flow [2025-04-30 10:28:27,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2315 transitions. [2025-04-30 10:28:27,722 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8910700538876059 [2025-04-30 10:28:27,723 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 2212 flow. Second operand 6 states and 2315 transitions. [2025-04-30 10:28:27,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 593 transitions, 2478 flow [2025-04-30 10:28:27,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 593 transitions, 2370 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-04-30 10:28:27,735 INFO L231 Difference]: Finished difference. Result has 541 places, 580 transitions, 2262 flow [2025-04-30 10:28:27,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2262, PETRI_PLACES=541, PETRI_TRANSITIONS=580} [2025-04-30 10:28:27,736 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 114 predicate places. [2025-04-30 10:28:27,736 INFO L485 AbstractCegarLoop]: Abstraction has has 541 places, 580 transitions, 2262 flow [2025-04-30 10:28:27,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.5) internal successors, (2265), 6 states have internal predecessors, (2265), 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-04-30 10:28:27,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:27,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:27,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:28:27,738 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:27,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash 684512123, now seen corresponding path program 1 times [2025-04-30 10:28:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:27,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994501312] [2025-04-30 10:28:27,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:27,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:28,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2906 statements into 1 equivalence classes. [2025-04-30 10:28:28,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2906 of 2906 statements. [2025-04-30 10:28:28,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:28,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-04-30 10:28:38,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:38,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994501312] [2025-04-30 10:28:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994501312] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:38,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562577201] [2025-04-30 10:28:38,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:38,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:38,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:38,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:38,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:28:39,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2906 statements into 1 equivalence classes. [2025-04-30 10:28:40,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2906 of 2906 statements. [2025-04-30 10:28:40,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:40,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:40,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 11604 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:28:40,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-04-30 10:28:41,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 48391 backedges. 24881 proven. 11565 refuted. 0 times theorem prover too weak. 11945 trivial. 0 not checked. [2025-04-30 10:28:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562577201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:42,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:42,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-04-30 10:28:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416747999] [2025-04-30 10:28:42,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:42,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-30 10:28:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:42,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-30 10:28:42,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-04-30 10:28:42,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 433 [2025-04-30 10:28:42,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 580 transitions, 2262 flow. Second operand has 63 states, 63 states have (on average 416.14285714285717) internal successors, (26217), 63 states have internal predecessors, (26217), 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-04-30 10:28:42,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:42,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 433 [2025-04-30 10:28:42,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:50,337 INFO L116 PetriNetUnfolderBase]: 187/9720 cut-off events. [2025-04-30 10:28:50,337 INFO L117 PetriNetUnfolderBase]: For 13429/13433 co-relation queries the response was YES. [2025-04-30 10:28:50,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12063 conditions, 9720 events. 187/9720 cut-off events. For 13429/13433 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9686 event pairs, 55 based on Foata normal form. 45/9595 useless extension candidates. Maximal degree in co-relation 10722. Up to 168 conditions per place. [2025-04-30 10:28:50,354 INFO L140 encePairwiseOnDemand]: 427/433 looper letters, 92 selfloop transitions, 270 changer transitions 0/786 dead transitions. [2025-04-30 10:28:50,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 786 transitions, 5172 flow [2025-04-30 10:28:50,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-30 10:28:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-04-30 10:28:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 37407 transitions. [2025-04-30 10:28:50,367 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9598922247882987 [2025-04-30 10:28:50,367 INFO L175 Difference]: Start difference. First operand has 541 places, 580 transitions, 2262 flow. Second operand 90 states and 37407 transitions. [2025-04-30 10:28:50,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 786 transitions, 5172 flow [2025-04-30 10:28:50,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 786 transitions, 5172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:50,390 INFO L231 Difference]: Finished difference. Result has 646 places, 718 transitions, 4254 flow [2025-04-30 10:28:50,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=433, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4254, PETRI_PLACES=646, PETRI_TRANSITIONS=718} [2025-04-30 10:28:50,391 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 219 predicate places. [2025-04-30 10:28:50,391 INFO L485 AbstractCegarLoop]: Abstraction has has 646 places, 718 transitions, 4254 flow [2025-04-30 10:28:50,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 416.14285714285717) internal successors, (26217), 63 states have internal predecessors, (26217), 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-04-30 10:28:50,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:50,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:50,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:28:50,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:28:50,598 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:50,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1881448773, now seen corresponding path program 2 times [2025-04-30 10:28:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:50,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577246596] [2025-04-30 10:28:50,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:51,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5606 statements into 2 equivalence classes. [2025-04-30 10:28:51,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 148 of 5606 statements. [2025-04-30 10:28:51,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:51,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 195751 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195751 trivial. 0 not checked. [2025-04-30 10:28:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:51,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577246596] [2025-04-30 10:28:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577246596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:51,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:51,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:51,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316436503] [2025-04-30 10:28:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:51,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:51,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:51,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:51,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:52,086 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 433 [2025-04-30 10:28:52,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 718 transitions, 4254 flow. Second operand has 6 states, 6 states have (on average 377.6666666666667) internal successors, (2266), 6 states have internal predecessors, (2266), 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-04-30 10:28:52,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:52,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 433 [2025-04-30 10:28:52,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15