./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_21-arrayloop2_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_21-arrayloop2_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:27:42,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:27:42,477 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:42,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:27:42,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:27:42,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:27:42,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:27:42,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:27:42,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:27:42,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:27:42,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:27:42,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:27:42,508 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:27:42,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:27:42,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:27:42,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:27:42,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:27:42,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:27:42,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:27:42,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:42,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:42,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:42,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:27:42,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:42,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:42,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:27:42,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e [2025-04-30 10:27:42,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:27:42,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:27:42,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:27:42,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:27:42,756 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:27:42,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_21-arrayloop2_nr.i [2025-04-30 10:27:44,044 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22056e73/7164665d5f6b41408c055d03efae4d59/FLAG59081df07 [2025-04-30 10:27:44,299 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:27:44,300 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_21-arrayloop2_nr.i [2025-04-30 10:27:44,323 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22056e73/7164665d5f6b41408c055d03efae4d59/FLAG59081df07 [2025-04-30 10:27:45,045 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22056e73/7164665d5f6b41408c055d03efae4d59 [2025-04-30 10:27:45,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:27:45,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:27:45,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:45,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:27:45,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:27:45,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b8d174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45, skipping insertion in model container [2025-04-30 10:27:45,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:27:45,466 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:27:45,467 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:27:45,467 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:27:45,469 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:27:45,492 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:45,514 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:27:45,572 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:27:45,573 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:27:45,573 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:27:45,573 WARN L1765 CHandler]: Possible shadowing of function new [2025-04-30 10:27:45,588 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:45,633 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:27:45,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45 WrapperNode [2025-04-30 10:27:45,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:45,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:45,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:27:45,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:27:45,638 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:27:45" (1/1) ... [2025-04-30 10:27:45,652 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:27:45" (1/1) ... [2025-04-30 10:27:45,682 INFO L138 Inliner]: procedures = 273, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 259 [2025-04-30 10:27:45,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:45,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:27:45,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:27:45,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:27:45,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:27:45,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:27:45,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:27:45,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:27:45,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (1/1) ... [2025-04-30 10:27:45,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:45,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:45,747 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:27:45,749 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:27:45,767 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-04-30 10:27:45,768 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-04-30 10:27:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:27:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-30 10:27:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:27:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:27:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:27:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:27:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:27:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:27:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:27:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:27:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:27:45,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:27:45,771 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:27:45,893 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:27:45,895 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:27:46,340 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:27:46,340 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:27:46,359 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:27:46,359 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:27:46,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:46 BoogieIcfgContainer [2025-04-30 10:27:46,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:27:46,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:27:46,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:27:46,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:27:46,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:27:45" (1/3) ... [2025-04-30 10:27:46,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42122b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:46, skipping insertion in model container [2025-04-30 10:27:46,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:45" (2/3) ... [2025-04-30 10:27:46,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42122b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:46, skipping insertion in model container [2025-04-30 10:27:46,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:46" (3/3) ... [2025-04-30 10:27:46,369 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_21-arrayloop2_nr.i [2025-04-30 10:27:46,379 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:27:46,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_21-arrayloop2_nr.i that has 2 procedures, 291 locations, 294 edges, 1 initial locations, 4 loop locations, and 14 error locations. [2025-04-30 10:27:46,383 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:27:46,508 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:27:46,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 364 transitions, 736 flow [2025-04-30 10:27:46,646 INFO L116 PetriNetUnfolderBase]: 8/362 cut-off events. [2025-04-30 10:27:46,648 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:46,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 362 events. 8/362 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 577 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 289. Up to 2 conditions per place. [2025-04-30 10:27:46,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 363 places, 364 transitions, 736 flow [2025-04-30 10:27:46,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 362 transitions, 730 flow [2025-04-30 10:27:46,675 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:27:46,684 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;@7508ec3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:27:46,684 INFO L341 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-04-30 10:27:46,698 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:27:46,698 INFO L116 PetriNetUnfolderBase]: 0/105 cut-off events. [2025-04-30 10:27:46,698 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:46,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:46,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:46,699 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:46,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1919011940, now seen corresponding path program 1 times [2025-04-30 10:27:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:46,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793284098] [2025-04-30 10:27:46,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:46,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-30 10:27:46,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-30 10:27:46,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:46,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:47,579 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:27:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:47,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793284098] [2025-04-30 10:27:47,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793284098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:47,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:47,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:47,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959129190] [2025-04-30 10:27:47,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:47,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:47,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:47,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:47,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 364 [2025-04-30 10:27:47,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 362 transitions, 730 flow. Second operand has 6 states, 6 states have (on average 279.3333333333333) internal successors, (1676), 6 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:47,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:47,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 364 [2025-04-30 10:27:47,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:48,394 INFO L116 PetriNetUnfolderBase]: 449/1836 cut-off events. [2025-04-30 10:27:48,394 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-30 10:27:48,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1836 events. 449/1836 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11462 event pairs, 342 based on Foata normal form. 34/1663 useless extension candidates. Maximal degree in co-relation 2472. Up to 846 conditions per place. [2025-04-30 10:27:48,411 INFO L140 encePairwiseOnDemand]: 350/364 looper letters, 72 selfloop transitions, 10 changer transitions 0/358 dead transitions. [2025-04-30 10:27:48,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 358 transitions, 886 flow [2025-04-30 10:27:48,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2025-04-30 10:27:48,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8031135531135531 [2025-04-30 10:27:48,430 INFO L175 Difference]: Start difference. First operand has 361 places, 362 transitions, 730 flow. Second operand 6 states and 1754 transitions. [2025-04-30 10:27:48,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 358 transitions, 886 flow [2025-04-30 10:27:48,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 358 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:27:48,440 INFO L231 Difference]: Finished difference. Result has 362 places, 358 transitions, 740 flow [2025-04-30 10:27:48,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=740, PETRI_PLACES=362, PETRI_TRANSITIONS=358} [2025-04-30 10:27:48,445 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 1 predicate places. [2025-04-30 10:27:48,445 INFO L485 AbstractCegarLoop]: Abstraction has has 362 places, 358 transitions, 740 flow [2025-04-30 10:27:48,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.3333333333333) internal successors, (1676), 6 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:48,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:48,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:48,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:27:48,447 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:48,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1929106989, now seen corresponding path program 1 times [2025-04-30 10:27:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:48,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530480478] [2025-04-30 10:27:48,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:48,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:48,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-30 10:27:48,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-30 10:27:48,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:48,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:48,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:27:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:48,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530480478] [2025-04-30 10:27:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530480478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883852623] [2025-04-30 10:27:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:48,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:48,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:48,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:49,307 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 364 [2025-04-30 10:27:49,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 358 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 279.3333333333333) internal successors, (1676), 6 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:49,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:49,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 364 [2025-04-30 10:27:49,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:49,651 INFO L116 PetriNetUnfolderBase]: 449/1834 cut-off events. [2025-04-30 10:27:49,652 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:49,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1834 events. 449/1834 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11433 event pairs, 342 based on Foata normal form. 0/1629 useless extension candidates. Maximal degree in co-relation 2568. Up to 846 conditions per place. [2025-04-30 10:27:49,662 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 72 selfloop transitions, 10 changer transitions 0/356 dead transitions. [2025-04-30 10:27:49,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 356 transitions, 900 flow [2025-04-30 10:27:49,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1752 transitions. [2025-04-30 10:27:49,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2025-04-30 10:27:49,665 INFO L175 Difference]: Start difference. First operand has 362 places, 358 transitions, 740 flow. Second operand 6 states and 1752 transitions. [2025-04-30 10:27:49,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 356 transitions, 900 flow [2025-04-30 10:27:49,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 356 transitions, 880 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:49,674 INFO L231 Difference]: Finished difference. Result has 360 places, 356 transitions, 736 flow [2025-04-30 10:27:49,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=356} [2025-04-30 10:27:49,676 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -1 predicate places. [2025-04-30 10:27:49,677 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 356 transitions, 736 flow [2025-04-30 10:27:49,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.3333333333333) internal successors, (1676), 6 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:49,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:49,678 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:27:49,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:27:49,679 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:49,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:49,681 INFO L85 PathProgramCache]: Analyzing trace with hash -466806559, now seen corresponding path program 1 times [2025-04-30 10:27:49,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:49,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060344658] [2025-04-30 10:27:49,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:49,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-30 10:27:49,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-30 10:27:49,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:49,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:49,796 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:27:49,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:49,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060344658] [2025-04-30 10:27:49,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060344658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:49,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:49,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314300077] [2025-04-30 10:27:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:49,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:49,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:49,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:49,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:49,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 364 [2025-04-30 10:27:49,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 356 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:49,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:49,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 364 [2025-04-30 10:27:49,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:49,877 INFO L116 PetriNetUnfolderBase]: 29/658 cut-off events. [2025-04-30 10:27:49,877 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:49,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 658 events. 29/658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2376 event pairs, 18 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 433. Up to 45 conditions per place. [2025-04-30 10:27:49,881 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-04-30 10:27:49,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 357 transitions, 764 flow [2025-04-30 10:27:49,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-04-30 10:27:49,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-04-30 10:27:49,883 INFO L175 Difference]: Start difference. First operand has 360 places, 356 transitions, 736 flow. Second operand 3 states and 1064 transitions. [2025-04-30 10:27:49,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 357 transitions, 764 flow [2025-04-30 10:27:49,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 357 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:49,891 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 728 flow [2025-04-30 10:27:49,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2025-04-30 10:27:49,893 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -3 predicate places. [2025-04-30 10:27:49,893 INFO L485 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 728 flow [2025-04-30 10:27:49,894 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:49,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:49,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:49,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:27:49,894 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:49,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash 577607820, now seen corresponding path program 1 times [2025-04-30 10:27:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:49,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731297764] [2025-04-30 10:27:49,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:49,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-30 10:27:49,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-30 10:27:49,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:49,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:50,278 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:27:50,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:50,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731297764] [2025-04-30 10:27:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731297764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:50,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816786711] [2025-04-30 10:27:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:50,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:50,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:50,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:50,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:50,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 364 [2025-04-30 10:27:50,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:50,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:50,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 364 [2025-04-30 10:27:50,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:50,816 INFO L116 PetriNetUnfolderBase]: 450/1961 cut-off events. [2025-04-30 10:27:50,816 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:50,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2913 conditions, 1961 events. 450/1961 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12280 event pairs, 342 based on Foata normal form. 0/1752 useless extension candidates. Maximal degree in co-relation 2658. Up to 894 conditions per place. [2025-04-30 10:27:50,824 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-04-30 10:27:50,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 356 transitions, 894 flow [2025-04-30 10:27:50,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1747 transitions. [2025-04-30 10:27:50,828 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.799908424908425 [2025-04-30 10:27:50,828 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 728 flow. Second operand 6 states and 1747 transitions. [2025-04-30 10:27:50,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 356 transitions, 894 flow [2025-04-30 10:27:50,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 356 transitions, 892 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:50,832 INFO L231 Difference]: Finished difference. Result has 361 places, 356 transitions, 734 flow [2025-04-30 10:27:50,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=361, PETRI_TRANSITIONS=356} [2025-04-30 10:27:50,833 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 0 predicate places. [2025-04-30 10:27:50,833 INFO L485 AbstractCegarLoop]: Abstraction has has 361 places, 356 transitions, 734 flow [2025-04-30 10:27:50,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:50,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:50,834 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:27:50,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:27:50,834 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:50,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1480661850, now seen corresponding path program 1 times [2025-04-30 10:27:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:50,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712373984] [2025-04-30 10:27:50,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:50,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-04-30 10:27:50,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-04-30 10:27:50,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:50,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:50,902 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:27:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:50,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712373984] [2025-04-30 10:27:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712373984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:50,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316555468] [2025-04-30 10:27:50,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:50,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:50,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:50,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:50,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 364 [2025-04-30 10:27:50,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 356 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:50,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:50,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 364 [2025-04-30 10:27:50,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:51,008 INFO L116 PetriNetUnfolderBase]: 29/844 cut-off events. [2025-04-30 10:27:51,008 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:51,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 844 events. 29/844 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2378 event pairs, 18 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 511. Up to 49 conditions per place. [2025-04-30 10:27:51,013 INFO L140 encePairwiseOnDemand]: 361/364 looper letters, 11 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-04-30 10:27:51,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 762 flow [2025-04-30 10:27:51,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-04-30 10:27:51,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2025-04-30 10:27:51,015 INFO L175 Difference]: Start difference. First operand has 361 places, 356 transitions, 734 flow. Second operand 3 states and 1064 transitions. [2025-04-30 10:27:51,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 762 flow [2025-04-30 10:27:51,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 752 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:51,019 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 736 flow [2025-04-30 10:27:51,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2025-04-30 10:27:51,021 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -2 predicate places. [2025-04-30 10:27:51,021 INFO L485 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 736 flow [2025-04-30 10:27:51,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:51,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:51,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:51,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:27:51,022 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:51,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -34089839, now seen corresponding path program 1 times [2025-04-30 10:27:51,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:51,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993690817] [2025-04-30 10:27:51,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:51,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-30 10:27:51,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-30 10:27:51,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:51,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:51,561 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:27:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:51,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993690817] [2025-04-30 10:27:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993690817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494668516] [2025-04-30 10:27:51,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:51,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:51,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:51,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:51,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-04-30 10:27:51,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 736 flow. Second operand has 6 states, 6 states have (on average 306.5) internal successors, (1839), 6 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:51,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:51,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-04-30 10:27:51,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:52,167 INFO L116 PetriNetUnfolderBase]: 75/1156 cut-off events. [2025-04-30 10:27:52,167 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:27:52,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 1156 events. 75/1156 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4568 event pairs, 42 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 951. Up to 263 conditions per place. [2025-04-30 10:27:52,172 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 54 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-04-30 10:27:52,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 356 transitions, 852 flow [2025-04-30 10:27:52,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1872 transitions. [2025-04-30 10:27:52,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-04-30 10:27:52,176 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 736 flow. Second operand 6 states and 1872 transitions. [2025-04-30 10:27:52,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 356 transitions, 852 flow [2025-04-30 10:27:52,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 356 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:52,180 INFO L231 Difference]: Finished difference. Result has 362 places, 356 transitions, 742 flow [2025-04-30 10:27:52,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=362, PETRI_TRANSITIONS=356} [2025-04-30 10:27:52,181 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 1 predicate places. [2025-04-30 10:27:52,181 INFO L485 AbstractCegarLoop]: Abstraction has has 362 places, 356 transitions, 742 flow [2025-04-30 10:27:52,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 306.5) internal successors, (1839), 6 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:52,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:52,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:52,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:27:52,182 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:52,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:52,183 INFO L85 PathProgramCache]: Analyzing trace with hash 707118588, now seen corresponding path program 1 times [2025-04-30 10:27:52,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:52,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905295688] [2025-04-30 10:27:52,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:52,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-04-30 10:27:52,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-04-30 10:27:52,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:52,590 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:27:52,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:52,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905295688] [2025-04-30 10:27:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905295688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:52,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903530674] [2025-04-30 10:27:52,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:52,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:52,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:52,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:52,838 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 364 [2025-04-30 10:27:52,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 356 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:52,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:52,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 364 [2025-04-30 10:27:52,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:53,044 INFO L116 PetriNetUnfolderBase]: 450/2141 cut-off events. [2025-04-30 10:27:53,044 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:27:53,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 2141 events. 450/2141 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12292 event pairs, 342 based on Foata normal form. 0/1932 useless extension candidates. Maximal degree in co-relation 2701. Up to 960 conditions per place. [2025-04-30 10:27:53,055 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 79 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-04-30 10:27:53,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 355 transitions, 908 flow [2025-04-30 10:27:53,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1747 transitions. [2025-04-30 10:27:53,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.799908424908425 [2025-04-30 10:27:53,059 INFO L175 Difference]: Start difference. First operand has 362 places, 356 transitions, 742 flow. Second operand 6 states and 1747 transitions. [2025-04-30 10:27:53,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 355 transitions, 908 flow [2025-04-30 10:27:53,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 355 transitions, 898 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:53,063 INFO L231 Difference]: Finished difference. Result has 361 places, 355 transitions, 740 flow [2025-04-30 10:27:53,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=740, PETRI_PLACES=361, PETRI_TRANSITIONS=355} [2025-04-30 10:27:53,064 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 0 predicate places. [2025-04-30 10:27:53,064 INFO L485 AbstractCegarLoop]: Abstraction has has 361 places, 355 transitions, 740 flow [2025-04-30 10:27:53,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:53,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:53,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:53,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:27:53,065 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:53,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash -921470674, now seen corresponding path program 1 times [2025-04-30 10:27:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:53,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341607691] [2025-04-30 10:27:53,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:53,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:27:53,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:27:53,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:53,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:53,454 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:27:53,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:53,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341607691] [2025-04-30 10:27:53,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341607691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:53,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:53,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:53,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518002561] [2025-04-30 10:27:53,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:53,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:53,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:53,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:53,785 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 364 [2025-04-30 10:27:53,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 355 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:53,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:53,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 364 [2025-04-30 10:27:53,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:54,093 INFO L116 PetriNetUnfolderBase]: 450/2132 cut-off events. [2025-04-30 10:27:54,093 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:27:54,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 2132 events. 450/2132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12223 event pairs, 342 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 2712. Up to 944 conditions per place. [2025-04-30 10:27:54,106 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2025-04-30 10:27:54,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 354 transitions, 898 flow [2025-04-30 10:27:54,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1767 transitions. [2025-04-30 10:27:54,109 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8090659340659341 [2025-04-30 10:27:54,109 INFO L175 Difference]: Start difference. First operand has 361 places, 355 transitions, 740 flow. Second operand 6 states and 1767 transitions. [2025-04-30 10:27:54,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 354 transitions, 898 flow [2025-04-30 10:27:54,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 354 transitions, 888 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:54,116 INFO L231 Difference]: Finished difference. Result has 360 places, 354 transitions, 738 flow [2025-04-30 10:27:54,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=360, PETRI_TRANSITIONS=354} [2025-04-30 10:27:54,118 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -1 predicate places. [2025-04-30 10:27:54,119 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 354 transitions, 738 flow [2025-04-30 10:27:54,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:54,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:54,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:54,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:27:54,121 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:54,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1969276949, now seen corresponding path program 1 times [2025-04-30 10:27:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:54,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888445931] [2025-04-30 10:27:54,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:54,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-04-30 10:27:54,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-04-30 10:27:54,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:54,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:54,538 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:27:54,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:54,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888445931] [2025-04-30 10:27:54,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888445931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:54,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:54,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:54,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595997345] [2025-04-30 10:27:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:54,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:54,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:54,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:54,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:54,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 364 [2025-04-30 10:27:54,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 354 transitions, 738 flow. Second operand has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:54,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:54,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 364 [2025-04-30 10:27:54,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:55,119 INFO L116 PetriNetUnfolderBase]: 450/2128 cut-off events. [2025-04-30 10:27:55,120 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:55,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 2128 events. 450/2128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12206 event pairs, 342 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 2727. Up to 944 conditions per place. [2025-04-30 10:27:55,133 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 75 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2025-04-30 10:27:55,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 353 transitions, 896 flow [2025-04-30 10:27:55,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1767 transitions. [2025-04-30 10:27:55,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8090659340659341 [2025-04-30 10:27:55,137 INFO L175 Difference]: Start difference. First operand has 360 places, 354 transitions, 738 flow. Second operand 6 states and 1767 transitions. [2025-04-30 10:27:55,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 353 transitions, 896 flow [2025-04-30 10:27:55,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 353 transitions, 886 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:55,142 INFO L231 Difference]: Finished difference. Result has 359 places, 353 transitions, 736 flow [2025-04-30 10:27:55,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=736, PETRI_PLACES=359, PETRI_TRANSITIONS=353} [2025-04-30 10:27:55,144 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -2 predicate places. [2025-04-30 10:27:55,144 INFO L485 AbstractCegarLoop]: Abstraction has has 359 places, 353 transitions, 736 flow [2025-04-30 10:27:55,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.0) internal successors, (1722), 6 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:55,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:55,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:55,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:27:55,146 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:55,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:55,146 INFO L85 PathProgramCache]: Analyzing trace with hash -971526699, now seen corresponding path program 1 times [2025-04-30 10:27:55,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:55,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411201187] [2025-04-30 10:27:55,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:55,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-04-30 10:27:55,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-04-30 10:27:55,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:55,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:55,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:55,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411201187] [2025-04-30 10:27:55,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411201187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:55,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:55,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643615199] [2025-04-30 10:27:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:55,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:55,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:55,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:55,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 364 [2025-04-30 10:27:55,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 353 transitions, 736 flow. Second operand has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:55,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:55,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 364 [2025-04-30 10:27:55,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:55,992 INFO L116 PetriNetUnfolderBase]: 450/2124 cut-off events. [2025-04-30 10:27:55,992 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:27:55,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 2124 events. 450/2124 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12219 event pairs, 342 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 2740. Up to 964 conditions per place. [2025-04-30 10:27:56,001 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 80 selfloop transitions, 5 changer transitions 0/352 dead transitions. [2025-04-30 10:27:56,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 352 transitions, 904 flow [2025-04-30 10:27:56,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1742 transitions. [2025-04-30 10:27:56,005 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7976190476190477 [2025-04-30 10:27:56,005 INFO L175 Difference]: Start difference. First operand has 359 places, 353 transitions, 736 flow. Second operand 6 states and 1742 transitions. [2025-04-30 10:27:56,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 352 transitions, 904 flow [2025-04-30 10:27:56,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 352 transitions, 894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:56,010 INFO L231 Difference]: Finished difference. Result has 358 places, 352 transitions, 734 flow [2025-04-30 10:27:56,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=358, PETRI_TRANSITIONS=352} [2025-04-30 10:27:56,011 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -3 predicate places. [2025-04-30 10:27:56,012 INFO L485 AbstractCegarLoop]: Abstraction has has 358 places, 352 transitions, 734 flow [2025-04-30 10:27:56,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:56,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:56,012 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:27:56,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:56,013 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:56,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:56,013 INFO L85 PathProgramCache]: Analyzing trace with hash -333761227, now seen corresponding path program 1 times [2025-04-30 10:27:56,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:56,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088479269] [2025-04-30 10:27:56,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:56,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:56,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-04-30 10:27:56,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-04-30 10:27:56,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:56,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:56,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088479269] [2025-04-30 10:27:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088479269] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:56,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036369472] [2025-04-30 10:27:56,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:56,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:56,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:56,193 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:27:56,195 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:27:56,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-04-30 10:27:56,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-04-30 10:27:56,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:56,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:27:56,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:56,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:27:56,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036369472] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:56,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:56,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:27:56,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559166425] [2025-04-30 10:27:56,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:56,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:56,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:56,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:56,690 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-04-30 10:27:56,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 352 transitions, 734 flow. Second operand has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:56,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:56,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-04-30 10:27:56,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:56,865 INFO L116 PetriNetUnfolderBase]: 29/1008 cut-off events. [2025-04-30 10:27:56,866 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:27:56,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 1008 events. 29/1008 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1820 event pairs, 18 based on Foata normal form. 4/974 useless extension candidates. Maximal degree in co-relation 504. Up to 49 conditions per place. [2025-04-30 10:27:56,869 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 15 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2025-04-30 10:27:56,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 800 flow [2025-04-30 10:27:56,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3149 transitions. [2025-04-30 10:27:56,874 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9612332112332113 [2025-04-30 10:27:56,874 INFO L175 Difference]: Start difference. First operand has 358 places, 352 transitions, 734 flow. Second operand 9 states and 3149 transitions. [2025-04-30 10:27:56,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 800 flow [2025-04-30 10:27:56,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 360 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:56,879 INFO L231 Difference]: Finished difference. Result has 364 places, 358 transitions, 774 flow [2025-04-30 10:27:56,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=364, PETRI_TRANSITIONS=358} [2025-04-30 10:27:56,880 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 3 predicate places. [2025-04-30 10:27:56,880 INFO L485 AbstractCegarLoop]: Abstraction has has 364 places, 358 transitions, 774 flow [2025-04-30 10:27:56,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:56,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:56,882 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:27:56,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:27:57,083 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:27:57,083 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:57,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash -447516653, now seen corresponding path program 2 times [2025-04-30 10:27:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:57,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113606857] [2025-04-30 10:27:57,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:57,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-04-30 10:27:57,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 108 of 407 statements. [2025-04-30 10:27:57,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-04-30 10:27:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:57,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113606857] [2025-04-30 10:27:57,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113606857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:57,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125799067] [2025-04-30 10:27:57,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:57,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:57,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:57,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:57,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:58,158 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 364 [2025-04-30 10:27:58,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 358 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:58,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:58,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 364 [2025-04-30 10:27:58,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:58,419 INFO L116 PetriNetUnfolderBase]: 199/1909 cut-off events. [2025-04-30 10:27:58,420 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-30 10:27:58,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 1909 events. 199/1909 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8789 event pairs, 54 based on Foata normal form. 0/1767 useless extension candidates. Maximal degree in co-relation 1889. Up to 448 conditions per place. [2025-04-30 10:27:58,428 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 71 selfloop transitions, 23 changer transitions 0/393 dead transitions. [2025-04-30 10:27:58,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 393 transitions, 1040 flow [2025-04-30 10:27:58,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1913 transitions. [2025-04-30 10:27:58,433 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8759157509157509 [2025-04-30 10:27:58,434 INFO L175 Difference]: Start difference. First operand has 364 places, 358 transitions, 774 flow. Second operand 6 states and 1913 transitions. [2025-04-30 10:27:58,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 393 transitions, 1040 flow [2025-04-30 10:27:58,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 393 transitions, 1034 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:58,439 INFO L231 Difference]: Finished difference. Result has 373 places, 380 transitions, 926 flow [2025-04-30 10:27:58,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=373, PETRI_TRANSITIONS=380} [2025-04-30 10:27:58,441 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 12 predicate places. [2025-04-30 10:27:58,442 INFO L485 AbstractCegarLoop]: Abstraction has has 373 places, 380 transitions, 926 flow [2025-04-30 10:27:58,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:58,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:58,443 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:58,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:27:58,443 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:27:58,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1108853463, now seen corresponding path program 1 times [2025-04-30 10:27:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:58,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564139959] [2025-04-30 10:27:58,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:58,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-04-30 10:27:58,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-04-30 10:27:58,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:58,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:58,731 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:27:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:58,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564139959] [2025-04-30 10:27:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564139959] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:58,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897756547] [2025-04-30 10:27:58,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:58,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:58,735 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:27:58,737 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:27:58,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-04-30 10:27:59,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-04-30 10:27:59,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:59,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:59,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:27:59,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:59,367 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:27:59,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:59,703 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:27:59,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897756547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:59,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:59,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-04-30 10:27:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551604510] [2025-04-30 10:27:59,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:59,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:27:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:59,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:27:59,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:27:59,806 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 364 [2025-04-30 10:27:59,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 380 transitions, 926 flow. Second operand has 19 states, 19 states have (on average 343.6842105263158) internal successors, (6530), 19 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:27:59,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:59,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 364 [2025-04-30 10:27:59,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:01,131 INFO L116 PetriNetUnfolderBase]: 186/3447 cut-off events. [2025-04-30 10:28:01,131 INFO L117 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2025-04-30 10:28:01,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4171 conditions, 3447 events. 186/3447 cut-off events. For 134/138 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9471 event pairs, 55 based on Foata normal form. 13/3291 useless extension candidates. Maximal degree in co-relation 2855. Up to 146 conditions per place. [2025-04-30 10:28:01,143 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 47 selfloop transitions, 68 changer transitions 0/466 dead transitions. [2025-04-30 10:28:01,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 466 transitions, 1566 flow [2025-04-30 10:28:01,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-30 10:28:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-04-30 10:28:01,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 21611 transitions. [2025-04-30 10:28:01,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.942394906680621 [2025-04-30 10:28:01,161 INFO L175 Difference]: Start difference. First operand has 373 places, 380 transitions, 926 flow. Second operand 63 states and 21611 transitions. [2025-04-30 10:28:01,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 466 transitions, 1566 flow [2025-04-30 10:28:01,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 466 transitions, 1566 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:01,230 INFO L231 Difference]: Finished difference. Result has 451 places, 442 transitions, 1446 flow [2025-04-30 10:28:01,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1446, PETRI_PLACES=451, PETRI_TRANSITIONS=442} [2025-04-30 10:28:01,231 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 90 predicate places. [2025-04-30 10:28:01,231 INFO L485 AbstractCegarLoop]: Abstraction has has 451 places, 442 transitions, 1446 flow [2025-04-30 10:28:01,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 343.6842105263158) internal successors, (6530), 19 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:01,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:01,235 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:01,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:28:01,435 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:01,435 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:28:01,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1102614345, now seen corresponding path program 2 times [2025-04-30 10:28:01,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:01,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821446031] [2025-04-30 10:28:01,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:01,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1432 statements into 2 equivalence classes. [2025-04-30 10:28:01,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1432 statements. [2025-04-30 10:28:01,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:01,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:01,774 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:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:01,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821446031] [2025-04-30 10:28:01,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821446031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:01,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:01,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:01,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157000353] [2025-04-30 10:28:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:01,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:01,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:01,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:02,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 364 [2025-04-30 10:28:02,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 442 transitions, 1446 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:02,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:02,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 364 [2025-04-30 10:28:02,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:03,485 INFO L116 PetriNetUnfolderBase]: 311/4003 cut-off events. [2025-04-30 10:28:03,485 INFO L117 PetriNetUnfolderBase]: For 704/738 co-relation queries the response was YES. [2025-04-30 10:28:03,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5861 conditions, 4003 events. 311/4003 cut-off events. For 704/738 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15619 event pairs, 61 based on Foata normal form. 8/3797 useless extension candidates. Maximal degree in co-relation 3813. Up to 1009 conditions per place. [2025-04-30 10:28:03,500 INFO L140 encePairwiseOnDemand]: 352/364 looper letters, 84 selfloop transitions, 31 changer transitions 0/481 dead transitions. [2025-04-30 10:28:03,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 481 transitions, 1796 flow [2025-04-30 10:28:03,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1909 transitions. [2025-04-30 10:28:03,502 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8740842490842491 [2025-04-30 10:28:03,502 INFO L175 Difference]: Start difference. First operand has 451 places, 442 transitions, 1446 flow. Second operand 6 states and 1909 transitions. [2025-04-30 10:28:03,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 481 transitions, 1796 flow [2025-04-30 10:28:03,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 481 transitions, 1720 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-04-30 10:28:03,514 INFO L231 Difference]: Finished difference. Result has 454 places, 472 transitions, 1628 flow [2025-04-30 10:28:03,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1628, PETRI_PLACES=454, PETRI_TRANSITIONS=472} [2025-04-30 10:28:03,516 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 93 predicate places. [2025-04-30 10:28:03,516 INFO L485 AbstractCegarLoop]: Abstraction has has 454 places, 472 transitions, 1628 flow [2025-04-30 10:28:03,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:03,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:03,517 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:03,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:28:03,517 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:28:03,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2027976054, now seen corresponding path program 1 times [2025-04-30 10:28:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:03,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872497800] [2025-04-30 10:28:03,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:03,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1436 statements into 1 equivalence classes. [2025-04-30 10:28:03,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1436 of 1436 statements. [2025-04-30 10:28:03,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:03,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-04-30 10:28:05,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:05,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872497800] [2025-04-30 10:28:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872497800] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:05,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119252592] [2025-04-30 10:28:05,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:05,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:05,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:05,856 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:05,857 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:06,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1436 statements into 1 equivalence classes. [2025-04-30 10:28:06,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1436 of 1436 statements. [2025-04-30 10:28:06,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:06,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:06,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 5657 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:28:06,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-04-30 10:28:07,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 5430 proven. 2317 refuted. 0 times theorem prover too weak. 2462 trivial. 0 not checked. [2025-04-30 10:28:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119252592] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:08,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:08,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-04-30 10:28:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54605978] [2025-04-30 10:28:08,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:08,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:28:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:08,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:28:08,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:28:08,243 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-04-30 10:28:08,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 472 transitions, 1628 flow. Second operand has 34 states, 34 states have (on average 349.1764705882353) internal successors, (11872), 34 states have internal predecessors, (11872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:08,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:08,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-04-30 10:28:08,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:10,484 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L1037-->L1037-3: Formula: (and (= |v_fThread1of1ForFork1_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_88| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_88|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_88| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_88|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#c~0.offset=|v_~#c~0.offset_88|} OutVars{~#c~0.base=|v_~#c~0.base_88|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#c~0.offset=|v_~#c~0.offset_88|, fThread1of1ForFork1_#t~ret18#1=|v_fThread1of1ForFork1_#t~ret18#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret18#1][408], [1810#true, Black: 1803#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), 247#ULTIMATE.startFINALtrue, Black: 4338#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), Black: 4374#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4326#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 4362#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4380#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), 177#L1037-3true, 1799#true, Black: 4342#(and (= 0 |ULTIMATE.start_main_#t~post22#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 1801#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 3178#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 4368#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4426#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 1814#(<= |ULTIMATE.start_main_~i~0#1| 1), 336#L1037-3true, Black: 1802#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 3461#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 1812#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1804#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4332#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), 362#true, Black: 426#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 4424#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 422#true, Black: 4423#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), 364#true, Black: 2937#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 3189#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 4425#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), Black: 380#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 390#(= |ULTIMATE.start_main_~j~1#1| 0), Black: 1209#(< |ULTIMATE.start_main_~j~1#1| 30), 4432#true, Black: 4320#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), 4421#true]) [2025-04-30 10:28:10,484 INFO L286 olderBase$Statistics]: this new event has 2964 ancestors and is cut-off event [2025-04-30 10:28:10,484 INFO L289 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-04-30 10:28:10,485 INFO L289 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-04-30 10:28:10,485 INFO L289 olderBase$Statistics]: existing Event has 2937 ancestors and is cut-off event [2025-04-30 10:28:11,375 INFO L116 PetriNetUnfolderBase]: 340/6473 cut-off events. [2025-04-30 10:28:11,376 INFO L117 PetriNetUnfolderBase]: For 3589/3607 co-relation queries the response was YES. [2025-04-30 10:28:11,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8371 conditions, 6473 events. 340/6473 cut-off events. For 3589/3607 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 18014 event pairs, 100 based on Foata normal form. 30/6235 useless extension candidates. Maximal degree in co-relation 5721. Up to 259 conditions per place. [2025-04-30 10:28:11,392 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 47 selfloop transitions, 135 changer transitions 0/573 dead transitions. [2025-04-30 10:28:11,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 573 transitions, 2756 flow [2025-04-30 10:28:11,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-30 10:28:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-30 10:28:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 15695 transitions. [2025-04-30 10:28:11,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9581807081807082 [2025-04-30 10:28:11,400 INFO L175 Difference]: Start difference. First operand has 454 places, 472 transitions, 1628 flow. Second operand 45 states and 15695 transitions. [2025-04-30 10:28:11,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 573 transitions, 2756 flow [2025-04-30 10:28:11,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 573 transitions, 2756 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:11,416 INFO L231 Difference]: Finished difference. Result has 507 places, 547 transitions, 2502 flow [2025-04-30 10:28:11,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2502, PETRI_PLACES=507, PETRI_TRANSITIONS=547} [2025-04-30 10:28:11,418 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 146 predicate places. [2025-04-30 10:28:11,418 INFO L485 AbstractCegarLoop]: Abstraction has has 507 places, 547 transitions, 2502 flow [2025-04-30 10:28:11,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 349.1764705882353) internal successors, (11872), 34 states have internal predecessors, (11872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:11,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:11,421 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:11,438 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:11,622 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:11,622 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:28:11,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash 985744266, now seen corresponding path program 2 times [2025-04-30 10:28:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:11,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507358563] [2025-04-30 10:28:11,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:11,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2876 statements into 2 equivalence classes. [2025-04-30 10:28:11,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 2876 statements. [2025-04-30 10:28:11,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:11,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48241 trivial. 0 not checked. [2025-04-30 10:28:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:12,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507358563] [2025-04-30 10:28:12,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507358563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:12,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:12,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:12,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526228775] [2025-04-30 10:28:12,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:12,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:12,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:12,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:12,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:12,429 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-04-30 10:28:12,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 547 transitions, 2502 flow. Second operand has 6 states, 6 states have (on average 309.5) internal successors, (1857), 6 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:12,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:12,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-04-30 10:28:12,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:16,131 INFO L116 PetriNetUnfolderBase]: 454/6730 cut-off events. [2025-04-30 10:28:16,132 INFO L117 PetriNetUnfolderBase]: For 2370/2462 co-relation queries the response was YES. [2025-04-30 10:28:16,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10673 conditions, 6730 events. 454/6730 cut-off events. For 2370/2462 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21322 event pairs, 87 based on Foata normal form. 34/6533 useless extension candidates. Maximal degree in co-relation 7262. Up to 1847 conditions per place. [2025-04-30 10:28:16,149 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 108 selfloop transitions, 55 changer transitions 0/608 dead transitions. [2025-04-30 10:28:16,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 608 transitions, 3154 flow [2025-04-30 10:28:16,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1906 transitions. [2025-04-30 10:28:16,151 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8727106227106227 [2025-04-30 10:28:16,152 INFO L175 Difference]: Start difference. First operand has 507 places, 547 transitions, 2502 flow. Second operand 6 states and 1906 transitions. [2025-04-30 10:28:16,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 608 transitions, 3154 flow [2025-04-30 10:28:16,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 608 transitions, 3046 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-04-30 10:28:16,169 INFO L231 Difference]: Finished difference. Result has 499 places, 596 transitions, 2948 flow [2025-04-30 10:28:16,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=2394, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2948, PETRI_PLACES=499, PETRI_TRANSITIONS=596} [2025-04-30 10:28:16,170 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 138 predicate places. [2025-04-30 10:28:16,170 INFO L485 AbstractCegarLoop]: Abstraction has has 499 places, 596 transitions, 2948 flow [2025-04-30 10:28:16,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.5) internal successors, (1857), 6 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:16,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:16,171 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:16,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:28:16,171 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:28:16,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 209270048, now seen corresponding path program 1 times [2025-04-30 10:28:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:16,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565771736] [2025-04-30 10:28:16,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:16,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2882 statements into 1 equivalence classes. [2025-04-30 10:28:16,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2882 of 2882 statements. [2025-04-30 10:28:16,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:16,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-04-30 10:28:25,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:25,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565771736] [2025-04-30 10:28:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565771736] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:25,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621233375] [2025-04-30 10:28:25,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:25,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:25,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:25,169 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:25,171 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:26,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2882 statements into 1 equivalence classes. [2025-04-30 10:28:27,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2882 of 2882 statements. [2025-04-30 10:28:27,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:27,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:27,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 11563 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:28:27,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-04-30 10:28:28,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 48241 backedges. 24806 proven. 11565 refuted. 0 times theorem prover too weak. 11870 trivial. 0 not checked. [2025-04-30 10:28:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621233375] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:29,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:29,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-04-30 10:28:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111350604] [2025-04-30 10:28:29,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:29,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-30 10:28:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:29,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-30 10:28:29,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-04-30 10:28:29,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 364 [2025-04-30 10:28:29,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 596 transitions, 2948 flow. Second operand has 63 states, 63 states have (on average 349.14285714285717) internal successors, (21996), 63 states have internal predecessors, (21996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:29,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:29,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 364 [2025-04-30 10:28:29,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:35,885 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L1037-->L1037-3: Formula: (and (= |v_fThread1of1ForFork1_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_88| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_88|) (+ (* |v_fThread1of1ForFork1_~j~0#1_29| 24) |v_~#c~0.offset_88| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_88|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_12|, ~#c~0.offset=|v_~#c~0.offset_88|} OutVars{~#c~0.base=|v_~#c~0.base_88|, fThread1of1ForFork1_~j~0#1=|v_fThread1of1ForFork1_~j~0#1_29|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#c~0.offset=|v_~#c~0.offset_88|, fThread1of1ForFork1_#t~ret18#1=|v_fThread1of1ForFork1_#t~ret18#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork1_#t~ret18#1][527], [1810#true, Black: 4338#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), Black: 10865#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 4374#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4326#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), Black: 4380#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), 177#L1037-3true, 1799#true, Black: 10876#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 1814#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 1812#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 13143#(= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0), Black: 3461#(< |ULTIMATE.start_main_~j~1#1| 28), 362#true, 364#true, Black: 390#(= |ULTIMATE.start_main_~j~1#1| 0), Black: 1209#(< |ULTIMATE.start_main_~j~1#1| 30), 4432#true, Black: 11420#(< |ULTIMATE.start_main_~j~1#1| 27), Black: 4320#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 12236#(< |ULTIMATE.start_main_~j~1#1| 24), Black: 4448#(<= |ULTIMATE.start_main_~j~1#1| 7), 4421#true, Black: 1803#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), 247#ULTIMATE.startFINALtrue, Black: 4362#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 13145#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 2 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), Black: 4342#(and (= 0 |ULTIMATE.start_main_#t~post22#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 1801#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 13144#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0)), Black: 3178#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 4368#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 11148#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 11964#(< |ULTIMATE.start_main_~j~1#1| 25), 13152#true, Black: 4426#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), 336#L1037-3true, Black: 1802#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 1804#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 4332#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 426#(<= |ULTIMATE.start_main_~j~1#1| 1), 422#true, Black: 4424#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), Black: 4423#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 11692#(< |ULTIMATE.start_main_~j~1#1| 26), Black: 2937#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 3189#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 4425#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), Black: 380#(= |ULTIMATE.start_main_~i~0#1| 0), 13141#true, Black: 13146#(and (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 2 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ 3 |fThread1of1ForFork0_~pos~0#1.offset|)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) (+ |fThread1of1ForFork0_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork0_~pos~0#1.base|) |fThread1of1ForFork0_~pos~0#1.offset|) 0))]) [2025-04-30 10:28:35,886 INFO L286 olderBase$Statistics]: this new event has 5664 ancestors and is cut-off event [2025-04-30 10:28:35,886 INFO L289 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-04-30 10:28:35,886 INFO L289 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-04-30 10:28:35,886 INFO L289 olderBase$Statistics]: existing Event has 5637 ancestors and is cut-off event [2025-04-30 10:28:38,699 INFO L116 PetriNetUnfolderBase]: 526/11255 cut-off events. [2025-04-30 10:28:38,699 INFO L117 PetriNetUnfolderBase]: For 15320/15438 co-relation queries the response was YES. [2025-04-30 10:28:38,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15502 conditions, 11255 events. 526/11255 cut-off events. For 15320/15438 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 24633 event pairs, 115 based on Foata normal form. 81/11005 useless extension candidates. Maximal degree in co-relation 12189. Up to 318 conditions per place. [2025-04-30 10:28:38,731 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 92 selfloop transitions, 270 changer transitions 0/802 dead transitions. [2025-04-30 10:28:38,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 802 transitions, 5858 flow [2025-04-30 10:28:38,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-04-30 10:28:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-04-30 10:28:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 31377 transitions. [2025-04-30 10:28:38,742 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9577838827838828 [2025-04-30 10:28:38,743 INFO L175 Difference]: Start difference. First operand has 499 places, 596 transitions, 2948 flow. Second operand 90 states and 31377 transitions. [2025-04-30 10:28:38,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 802 transitions, 5858 flow [2025-04-30 10:28:38,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 802 transitions, 5858 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:38,772 INFO L231 Difference]: Finished difference. Result has 604 places, 734 transitions, 4940 flow [2025-04-30 10:28:38,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=2948, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4940, PETRI_PLACES=604, PETRI_TRANSITIONS=734} [2025-04-30 10:28:38,773 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, 243 predicate places. [2025-04-30 10:28:38,773 INFO L485 AbstractCegarLoop]: Abstraction has has 604 places, 734 transitions, 4940 flow [2025-04-30 10:28:38,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 349.14285714285717) internal successors, (21996), 63 states have internal predecessors, (21996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:38,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:38,778 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:38,805 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:38,979 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:38,980 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:28:38,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1439718080, now seen corresponding path program 2 times [2025-04-30 10:28:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:38,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547885555] [2025-04-30 10:28:38,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:39,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5582 statements into 2 equivalence classes. [2025-04-30 10:28:39,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 124 of 5582 statements. [2025-04-30 10:28:39,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:39,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 195451 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195451 trivial. 0 not checked. [2025-04-30 10:28:39,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:39,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547885555] [2025-04-30 10:28:39,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547885555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:39,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:39,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415938405] [2025-04-30 10:28:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:39,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:39,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:39,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:40,042 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 364 [2025-04-30 10:28:40,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 734 transitions, 4940 flow. Second operand has 6 states, 6 states have (on average 309.6666666666667) internal successors, (1858), 6 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:40,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:40,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 364 [2025-04-30 10:28:40,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15