./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edbdacd2fc511db63719a3e7d2bd257b6310a833f5bcfcddcb6829e714260082 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:25:12,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:25:12,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:25:12,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:25:12,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:25:12,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:25:12,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:25:12,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:25:12,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:25:12,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:25:12,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:25:12,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:25:12,241 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:25:12,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:25:12,242 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:25:12,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:25:12,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:25:12,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:25:12,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:25:12,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:25:12,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:25:12,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:25:12,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:25:12,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:12,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:25:12,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:25:12,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:25:12,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:12,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:25:12,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:25:12,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:25:12,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:25:12,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:25:12,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:25:12,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:25:12,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:25:12,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:25:12,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:25:12,245 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edbdacd2fc511db63719a3e7d2bd257b6310a833f5bcfcddcb6829e714260082 [2025-01-09 21:25:12,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:25:12,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:25:12,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:25:12,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:25:12,461 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:25:12,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-01-09 21:25:13,617 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d372c1f80/f7b8001e61444ad3b71e68fb58a028da/FLAG91fbfc3ba [2025-01-09 21:25:13,938 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:25:13,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-01-09 21:25:13,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d372c1f80/f7b8001e61444ad3b71e68fb58a028da/FLAG91fbfc3ba [2025-01-09 21:25:14,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d372c1f80/f7b8001e61444ad3b71e68fb58a028da [2025-01-09 21:25:14,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:25:14,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:25:14,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:25:14,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:25:14,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:25:14,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b308765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14, skipping insertion in model container [2025-01-09 21:25:14,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:25:14,438 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,439 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,440 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,440 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:25:14,482 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:25:14,510 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,511 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,512 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,512 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:25:14,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:25:14,554 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:25:14,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14 WrapperNode [2025-01-09 21:25:14,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:25:14,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:25:14,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:25:14,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:25:14,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,595 INFO L138 Inliner]: procedures = 274, calls = 101, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 322 [2025-01-09 21:25:14,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:25:14,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:25:14,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:25:14,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:25:14,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:25:14,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:25:14,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:25:14,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:25:14,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (1/1) ... [2025-01-09 21:25:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:14,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:25:14,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-01-09 21:25:14,665 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-01-09 21:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:25:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:25:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:25:14,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:25:14,667 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:25:14,782 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:25:14,784 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:25:15,285 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:25:15,285 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:25:15,301 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:25:15,301 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:25:15,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:15 BoogieIcfgContainer [2025-01-09 21:25:15,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:25:15,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:25:15,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:25:15,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:25:15,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:25:14" (1/3) ... [2025-01-09 21:25:15,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac7543a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:15, skipping insertion in model container [2025-01-09 21:25:15,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:14" (2/3) ... [2025-01-09 21:25:15,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac7543a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:15, skipping insertion in model container [2025-01-09 21:25:15,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:15" (3/3) ... [2025-01-09 21:25:15,309 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_23-evilcollapse_rc.i [2025-01-09 21:25:15,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:25:15,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_23-evilcollapse_rc.i that has 2 procedures, 372 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-01-09 21:25:15,320 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:25:15,404 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:25:15,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 447 transitions, 902 flow [2025-01-09 21:25:15,573 INFO L124 PetriNetUnfolderBase]: 10/445 cut-off events. [2025-01-09 21:25:15,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:15,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 445 events. 10/445 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 642 event pairs, 0 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 372. Up to 2 conditions per place. [2025-01-09 21:25:15,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 447 transitions, 902 flow [2025-01-09 21:25:15,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 445 transitions, 896 flow [2025-01-09 21:25:15,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:25:15,614 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c812ddb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:25:15,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-09 21:25:15,638 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:25:15,638 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-01-09 21:25:15,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:15,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:15,639 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] [2025-01-09 21:25:15,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:15,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:15,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1701075395, now seen corresponding path program 1 times [2025-01-09 21:25:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201124172] [2025-01-09 21:25:15,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:15,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:25:15,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:25:15,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:15,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:16,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201124172] [2025-01-09 21:25:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201124172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:16,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:16,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828432698] [2025-01-09 21:25:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:16,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:16,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:16,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-01-09 21:25:16,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 445 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 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-01-09 21:25:16,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:16,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-01-09 21:25:16,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:17,429 INFO L124 PetriNetUnfolderBase]: 449/1922 cut-off events. [2025-01-09 21:25:17,429 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:25:17,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 1922 events. 449/1922 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 11001 event pairs, 342 based on Foata normal form. 36/1745 useless extension candidates. Maximal degree in co-relation 2477. Up to 862 conditions per place. [2025-01-09 21:25:17,443 INFO L140 encePairwiseOnDemand]: 431/447 looper letters, 88 selfloop transitions, 10 changer transitions 2/439 dead transitions. [2025-01-09 21:25:17,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 1080 flow [2025-01-09 21:25:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2162 transitions. [2025-01-09 21:25:17,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8061148396718867 [2025-01-09 21:25:17,459 INFO L175 Difference]: Start difference. First operand has 442 places, 445 transitions, 896 flow. Second operand 6 states and 2162 transitions. [2025-01-09 21:25:17,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 1080 flow [2025-01-09 21:25:17,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 439 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:25:17,472 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 898 flow [2025-01-09 21:25:17,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-01-09 21:25:17,477 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-01-09 21:25:17,477 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 898 flow [2025-01-09 21:25:17,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 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-01-09 21:25:17,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:17,478 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] [2025-01-09 21:25:17,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:25:17,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:17,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1433264803, now seen corresponding path program 1 times [2025-01-09 21:25:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:17,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694460392] [2025-01-09 21:25:17,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:17,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:25:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:25:17,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:17,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694460392] [2025-01-09 21:25:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694460392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:17,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:17,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:17,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464234529] [2025-01-09 21:25:17,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:17,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:17,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:17,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:17,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:18,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-01-09 21:25:18,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 898 flow. Second operand has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 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-01-09 21:25:18,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:18,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-01-09 21:25:18,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:18,489 INFO L124 PetriNetUnfolderBase]: 449/1918 cut-off events. [2025-01-09 21:25:18,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:18,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 1918 events. 449/1918 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 11045 event pairs, 342 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 2668. Up to 862 conditions per place. [2025-01-09 21:25:18,498 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 88 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-01-09 21:25:18,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 435 transitions, 1090 flow [2025-01-09 21:25:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2158 transitions. [2025-01-09 21:25:18,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046234153616704 [2025-01-09 21:25:18,502 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 898 flow. Second operand 6 states and 2158 transitions. [2025-01-09 21:25:18,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 435 transitions, 1090 flow [2025-01-09 21:25:18,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1070 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:18,507 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 894 flow [2025-01-09 21:25:18,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2025-01-09 21:25:18,509 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-01-09 21:25:18,509 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 894 flow [2025-01-09 21:25:18,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 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-01-09 21:25:18,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:18,510 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] [2025-01-09 21:25:18,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:25:18,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:18,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2126673297, now seen corresponding path program 1 times [2025-01-09 21:25:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:18,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292194549] [2025-01-09 21:25:18,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:18,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:25:18,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:25:18,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:18,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292194549] [2025-01-09 21:25:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292194549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:25:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177204501] [2025-01-09 21:25:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:18,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:25:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:18,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:25:18,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:25:18,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-01-09 21:25:18,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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-01-09 21:25:18,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:18,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-01-09 21:25:18,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:18,750 INFO L124 PetriNetUnfolderBase]: 29/737 cut-off events. [2025-01-09 21:25:18,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:18,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 737 events. 29/737 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2127 event pairs, 18 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 510. Up to 45 conditions per place. [2025-01-09 21:25:18,753 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-01-09 21:25:18,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 922 flow [2025-01-09 21:25:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-01-09 21:25:18,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-01-09 21:25:18,756 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 894 flow. Second operand 3 states and 1307 transitions. [2025-01-09 21:25:18,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 922 flow [2025-01-09 21:25:18,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 436 transitions, 902 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:18,763 INFO L231 Difference]: Finished difference. Result has 437 places, 436 transitions, 886 flow [2025-01-09 21:25:18,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=437, PETRI_TRANSITIONS=436} [2025-01-09 21:25:18,764 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-01-09 21:25:18,764 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 436 transitions, 886 flow [2025-01-09 21:25:18,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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-01-09 21:25:18,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:18,765 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] [2025-01-09 21:25:18,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:25:18,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2104900922, now seen corresponding path program 1 times [2025-01-09 21:25:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052606129] [2025-01-09 21:25:18,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:18,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:25:18,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:25:18,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:18,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:19,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052606129] [2025-01-09 21:25:19,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052606129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:19,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:19,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:19,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023906156] [2025-01-09 21:25:19,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:19,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:19,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:19,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:19,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-01-09 21:25:19,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 436 transitions, 886 flow. Second operand has 6 states, 6 states have (on average 344.6666666666667) internal successors, (2068), 6 states have internal predecessors, (2068), 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-01-09 21:25:19,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:19,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-01-09 21:25:19,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:19,840 INFO L124 PetriNetUnfolderBase]: 450/2040 cut-off events. [2025-01-09 21:25:19,840 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:25:19,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3008 conditions, 2040 events. 450/2040 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 11382 event pairs, 342 based on Foata normal form. 0/1827 useless extension candidates. Maximal degree in co-relation 2751. Up to 910 conditions per place. [2025-01-09 21:25:19,846 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-01-09 21:25:19,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 435 transitions, 1084 flow [2025-01-09 21:25:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-01-09 21:25:19,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-01-09 21:25:19,850 INFO L175 Difference]: Start difference. First operand has 437 places, 436 transitions, 886 flow. Second operand 6 states and 2153 transitions. [2025-01-09 21:25:19,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 435 transitions, 1084 flow [2025-01-09 21:25:19,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 435 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:19,855 INFO L231 Difference]: Finished difference. Result has 440 places, 435 transitions, 892 flow [2025-01-09 21:25:19,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=440, PETRI_TRANSITIONS=435} [2025-01-09 21:25:19,856 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-01-09 21:25:19,856 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 435 transitions, 892 flow [2025-01-09 21:25:19,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.6666666666667) internal successors, (2068), 6 states have internal predecessors, (2068), 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-01-09 21:25:19,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:19,857 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] [2025-01-09 21:25:19,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:25:19,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:19,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1065654093, now seen corresponding path program 1 times [2025-01-09 21:25:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142271904] [2025-01-09 21:25:19,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:19,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 21:25:19,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 21:25:19,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:19,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142271904] [2025-01-09 21:25:19,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142271904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:19,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:19,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:25:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305515] [2025-01-09 21:25:19,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:19,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:25:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:19,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:25:19,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:25:19,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-01-09 21:25:19,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 435 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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-01-09 21:25:19,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:19,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-01-09 21:25:19,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:20,000 INFO L124 PetriNetUnfolderBase]: 29/923 cut-off events. [2025-01-09 21:25:20,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:20,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 923 events. 29/923 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2412 event pairs, 18 based on Foata normal form. 2/863 useless extension candidates. Maximal degree in co-relation 588. Up to 49 conditions per place. [2025-01-09 21:25:20,003 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-01-09 21:25:20,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 436 transitions, 920 flow [2025-01-09 21:25:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:25:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:25:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-01-09 21:25:20,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-01-09 21:25:20,006 INFO L175 Difference]: Start difference. First operand has 440 places, 435 transitions, 892 flow. Second operand 3 states and 1307 transitions. [2025-01-09 21:25:20,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 436 transitions, 920 flow [2025-01-09 21:25:20,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 436 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:20,011 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 894 flow [2025-01-09 21:25:20,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=438, PETRI_TRANSITIONS=436} [2025-01-09 21:25:20,012 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-01-09 21:25:20,012 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 894 flow [2025-01-09 21:25:20,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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-01-09 21:25:20,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:20,013 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] [2025-01-09 21:25:20,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:25:20,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:20,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash -338266900, now seen corresponding path program 1 times [2025-01-09 21:25:20,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:20,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887885406] [2025-01-09 21:25:20,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:20,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:25:20,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:25:20,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:20,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887885406] [2025-01-09 21:25:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887885406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018277878] [2025-01-09 21:25:20,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:20,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:20,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:20,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-01-09 21:25:20,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 436 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 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-01-09 21:25:20,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:20,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-01-09 21:25:20,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:21,140 INFO L124 PetriNetUnfolderBase]: 75/1235 cut-off events. [2025-01-09 21:25:21,141 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:25:21,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1235 events. 75/1235 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4478 event pairs, 42 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 1032. Up to 267 conditions per place. [2025-01-09 21:25:21,145 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-01-09 21:25:21,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 435 transitions, 1018 flow [2025-01-09 21:25:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-01-09 21:25:21,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-01-09 21:25:21,148 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 894 flow. Second operand 6 states and 2338 transitions. [2025-01-09 21:25:21,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 435 transitions, 1018 flow [2025-01-09 21:25:21,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 435 transitions, 1016 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:21,153 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 900 flow [2025-01-09 21:25:21,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=441, PETRI_TRANSITIONS=435} [2025-01-09 21:25:21,154 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -1 predicate places. [2025-01-09 21:25:21,154 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 900 flow [2025-01-09 21:25:21,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 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-01-09 21:25:21,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:21,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:21,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:25:21,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash -824947504, now seen corresponding path program 1 times [2025-01-09 21:25:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:21,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876225495] [2025-01-09 21:25:21,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:21,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:25:21,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:25:21,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:21,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876225495] [2025-01-09 21:25:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876225495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:21,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712263265] [2025-01-09 21:25:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:21,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:21,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:21,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:21,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:21,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-01-09 21:25:21,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 435 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 347.3333333333333) internal successors, (2084), 6 states have internal predecessors, (2084), 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-01-09 21:25:21,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:21,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-01-09 21:25:21,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:22,209 INFO L124 PetriNetUnfolderBase]: 450/2220 cut-off events. [2025-01-09 21:25:22,209 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:22,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3292 conditions, 2220 events. 450/2220 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12136 event pairs, 342 based on Foata normal form. 0/2007 useless extension candidates. Maximal degree in co-relation 2794. Up to 976 conditions per place. [2025-01-09 21:25:22,216 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/434 dead transitions. [2025-01-09 21:25:22,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 434 transitions, 1098 flow [2025-01-09 21:25:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-01-09 21:25:22,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-01-09 21:25:22,220 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 900 flow. Second operand 6 states and 2153 transitions. [2025-01-09 21:25:22,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 434 transitions, 1098 flow [2025-01-09 21:25:22,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 434 transitions, 1088 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:22,225 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 898 flow [2025-01-09 21:25:22,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2025-01-09 21:25:22,226 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-01-09 21:25:22,226 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 898 flow [2025-01-09 21:25:22,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 347.3333333333333) internal successors, (2084), 6 states have internal predecessors, (2084), 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-01-09 21:25:22,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:22,227 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] [2025-01-09 21:25:22,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:25:22,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:22,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash 381013339, now seen corresponding path program 1 times [2025-01-09 21:25:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:22,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903011004] [2025-01-09 21:25:22,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:22,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:25:22,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:25:22,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:22,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:25:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903011004] [2025-01-09 21:25:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903011004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:22,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115450485] [2025-01-09 21:25:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:22,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:22,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:22,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:22,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-01-09 21:25:22,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 898 flow. Second operand has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 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-01-09 21:25:22,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:22,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-01-09 21:25:22,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:23,213 INFO L124 PetriNetUnfolderBase]: 450/2216 cut-off events. [2025-01-09 21:25:23,213 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:23,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3272 conditions, 2216 events. 450/2216 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12097 event pairs, 342 based on Foata normal form. 0/2007 useless extension candidates. Maximal degree in co-relation 2810. Up to 960 conditions per place. [2025-01-09 21:25:23,220 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/433 dead transitions. [2025-01-09 21:25:23,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 433 transitions, 1088 flow [2025-01-09 21:25:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-01-09 21:25:23,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-01-09 21:25:23,224 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 898 flow. Second operand 6 states and 2173 transitions. [2025-01-09 21:25:23,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 433 transitions, 1088 flow [2025-01-09 21:25:23,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 433 transitions, 1078 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:23,229 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 896 flow [2025-01-09 21:25:23,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=439, PETRI_TRANSITIONS=433} [2025-01-09 21:25:23,230 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-01-09 21:25:23,230 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 896 flow [2025-01-09 21:25:23,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 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-01-09 21:25:23,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:23,231 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] [2025-01-09 21:25:23,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:25:23,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:23,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1000923941, now seen corresponding path program 1 times [2025-01-09 21:25:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:23,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677931133] [2025-01-09 21:25:23,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:23,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:25:23,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:25:23,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:23,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:25:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677931133] [2025-01-09 21:25:23,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677931133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:23,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:23,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738805905] [2025-01-09 21:25:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:23,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:23,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:23,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:23,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:24,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-01-09 21:25:24,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 433 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 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-01-09 21:25:24,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:24,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-01-09 21:25:24,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:24,309 INFO L124 PetriNetUnfolderBase]: 450/2212 cut-off events. [2025-01-09 21:25:24,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:24,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 2212 events. 450/2212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12065 event pairs, 342 based on Foata normal form. 0/2007 useless extension candidates. Maximal degree in co-relation 2825. Up to 960 conditions per place. [2025-01-09 21:25:24,319 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/432 dead transitions. [2025-01-09 21:25:24,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 432 transitions, 1086 flow [2025-01-09 21:25:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-01-09 21:25:24,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-01-09 21:25:24,323 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 896 flow. Second operand 6 states and 2173 transitions. [2025-01-09 21:25:24,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 432 transitions, 1086 flow [2025-01-09 21:25:24,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 432 transitions, 1076 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:24,329 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 894 flow [2025-01-09 21:25:24,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=438, PETRI_TRANSITIONS=432} [2025-01-09 21:25:24,330 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-01-09 21:25:24,330 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 894 flow [2025-01-09 21:25:24,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 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-01-09 21:25:24,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:24,332 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] [2025-01-09 21:25:24,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:25:24,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:24,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash 876385933, now seen corresponding path program 1 times [2025-01-09 21:25:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:24,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817232199] [2025-01-09 21:25:24,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:24,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 21:25:24,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 21:25:24,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:24,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 21:25:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817232199] [2025-01-09 21:25:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817232199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:24,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882225527] [2025-01-09 21:25:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:24,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:24,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:25,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-01-09 21:25:25,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 432 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 348.5) internal successors, (2091), 6 states have internal predecessors, (2091), 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-01-09 21:25:25,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:25,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-01-09 21:25:25,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:25,354 INFO L124 PetriNetUnfolderBase]: 450/2208 cut-off events. [2025-01-09 21:25:25,354 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:25:25,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2208 events. 450/2208 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12060 event pairs, 342 based on Foata normal form. 0/2007 useless extension candidates. Maximal degree in co-relation 2838. Up to 980 conditions per place. [2025-01-09 21:25:25,360 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/431 dead transitions. [2025-01-09 21:25:25,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 431 transitions, 1094 flow [2025-01-09 21:25:25,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-01-09 21:25:25,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-01-09 21:25:25,363 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 894 flow. Second operand 6 states and 2148 transitions. [2025-01-09 21:25:25,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 431 transitions, 1094 flow [2025-01-09 21:25:25,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 431 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:25,368 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 892 flow [2025-01-09 21:25:25,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-01-09 21:25:25,369 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-01-09 21:25:25,370 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 892 flow [2025-01-09 21:25:25,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 348.5) internal successors, (2091), 6 states have internal predecessors, (2091), 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-01-09 21:25:25,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:25,371 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] [2025-01-09 21:25:25,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:25:25,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 394683344, now seen corresponding path program 1 times [2025-01-09 21:25:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030936962] [2025-01-09 21:25:25,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:25,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:25:25,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:25:25,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:25,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 21:25:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030936962] [2025-01-09 21:25:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030936962] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893698895] [2025-01-09 21:25:25,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:25,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:25,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:25,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:25,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:25:25,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:25:25,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:25:25,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:25,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:25,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:25:25,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 21:25:25,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 21:25:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893698895] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:25,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:25:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842820785] [2025-01-09 21:25:25,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:25,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:25:25,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:25,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:25:25,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:25:25,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-01-09 21:25:25,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 892 flow. Second operand has 10 states, 10 states have (on average 429.8) internal successors, (4298), 10 states have internal predecessors, (4298), 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-01-09 21:25:25,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:25,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-01-09 21:25:25,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:26,076 INFO L124 PetriNetUnfolderBase]: 29/1087 cut-off events. [2025-01-09 21:25:26,077 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:25:26,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1087 events. 29/1087 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1966 event pairs, 18 based on Foata normal form. 4/1049 useless extension candidates. Maximal degree in co-relation 581. Up to 49 conditions per place. [2025-01-09 21:25:26,079 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 15 selfloop transitions, 9 changer transitions 0/439 dead transitions. [2025-01-09 21:25:26,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 958 flow [2025-01-09 21:25:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:25:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:25:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3878 transitions. [2025-01-09 21:25:26,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639572458364405 [2025-01-09 21:25:26,084 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 892 flow. Second operand 9 states and 3878 transitions. [2025-01-09 21:25:26,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 958 flow [2025-01-09 21:25:26,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 439 transitions, 948 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:26,089 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 932 flow [2025-01-09 21:25:26,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=932, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-01-09 21:25:26,090 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-01-09 21:25:26,090 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 932 flow [2025-01-09 21:25:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 429.8) internal successors, (4298), 10 states have internal predecessors, (4298), 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-01-09 21:25:26,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:26,092 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] [2025-01-09 21:25:26,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:25:26,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 21:25:26,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:26,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2070537034, now seen corresponding path program 2 times [2025-01-09 21:25:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:26,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864291744] [2025-01-09 21:25:26,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:26,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-01-09 21:25:26,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 403 statements. [2025-01-09 21:25:26,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:26,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-01-09 21:25:26,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:26,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864291744] [2025-01-09 21:25:26,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864291744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:26,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:26,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658349871] [2025-01-09 21:25:26,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:26,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:26,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:26,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:27,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 447 [2025-01-09 21:25:27,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 377.3333333333333) internal successors, (2264), 6 states have internal predecessors, (2264), 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-01-09 21:25:27,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:27,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 447 [2025-01-09 21:25:27,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:27,601 INFO L124 PetriNetUnfolderBase]: 75/1401 cut-off events. [2025-01-09 21:25:27,601 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:25:27,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 1401 events. 75/1401 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4024 event pairs, 42 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 1161. Up to 314 conditions per place. [2025-01-09 21:25:27,607 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 61 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-01-09 21:25:27,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 435 transitions, 1070 flow [2025-01-09 21:25:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2293 transitions. [2025-01-09 21:25:27,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854958985831469 [2025-01-09 21:25:27,611 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 932 flow. Second operand 6 states and 2293 transitions. [2025-01-09 21:25:27,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 435 transitions, 1070 flow [2025-01-09 21:25:27,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 435 transitions, 1064 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:25:27,616 INFO L231 Difference]: Finished difference. Result has 445 places, 435 transitions, 942 flow [2025-01-09 21:25:27,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=445, PETRI_TRANSITIONS=435} [2025-01-09 21:25:27,617 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 3 predicate places. [2025-01-09 21:25:27,618 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 435 transitions, 942 flow [2025-01-09 21:25:27,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.3333333333333) internal successors, (2264), 6 states have internal predecessors, (2264), 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-01-09 21:25:27,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:27,619 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:27,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:25:27,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:27,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1975290345, now seen corresponding path program 1 times [2025-01-09 21:25:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:27,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036020929] [2025-01-09 21:25:27,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:27,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 21:25:27,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 21:25:27,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:27,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-01-09 21:25:27,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:27,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036020929] [2025-01-09 21:25:27,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036020929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:27,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289806272] [2025-01-09 21:25:27,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:27,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:27,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:27,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:27,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:25:28,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 21:25:28,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 21:25:28,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:28,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:28,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:25:28,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 21:25:28,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 21:25:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289806272] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:28,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:28,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-09 21:25:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252197439] [2025-01-09 21:25:28,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:28,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 21:25:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:28,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 21:25:28,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 21:25:28,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 447 [2025-01-09 21:25:28,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 435 transitions, 942 flow. Second operand has 19 states, 19 states have (on average 424.5263157894737) internal successors, (8066), 19 states have internal predecessors, (8066), 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-01-09 21:25:28,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:28,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 447 [2025-01-09 21:25:28,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:30,110 INFO L124 PetriNetUnfolderBase]: 30/2465 cut-off events. [2025-01-09 21:25:30,110 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-01-09 21:25:30,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2465 events. 30/2465 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1967 event pairs, 18 based on Foata normal form. 13/2438 useless extension candidates. Maximal degree in co-relation 2329. Up to 51 conditions per place. [2025-01-09 21:25:30,114 INFO L140 encePairwiseOnDemand]: 436/447 looper letters, 47 selfloop transitions, 68 changer transitions 0/521 dead transitions. [2025-01-09 21:25:30,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 521 transitions, 1582 flow [2025-01-09 21:25:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 21:25:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-01-09 21:25:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 26714 transitions. [2025-01-09 21:25:30,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486168815027876 [2025-01-09 21:25:30,133 INFO L175 Difference]: Start difference. First operand has 445 places, 435 transitions, 942 flow. Second operand 63 states and 26714 transitions. [2025-01-09 21:25:30,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 521 transitions, 1582 flow [2025-01-09 21:25:30,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 521 transitions, 1562 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:30,140 INFO L231 Difference]: Finished difference. Result has 518 places, 497 transitions, 1442 flow [2025-01-09 21:25:30,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1442, PETRI_PLACES=518, PETRI_TRANSITIONS=497} [2025-01-09 21:25:30,140 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 76 predicate places. [2025-01-09 21:25:30,141 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 497 transitions, 1442 flow [2025-01-09 21:25:30,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 424.5263157894737) internal successors, (8066), 19 states have internal predecessors, (8066), 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-01-09 21:25:30,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:30,143 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:30,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:25:30,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:30,344 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:30,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1739038258, now seen corresponding path program 2 times [2025-01-09 21:25:30,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:30,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526125094] [2025-01-09 21:25:30,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:30,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:30,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1465 statements into 2 equivalence classes. [2025-01-09 21:25:30,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 147 of 1465 statements. [2025-01-09 21:25:30,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:30,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15305 trivial. 0 not checked. [2025-01-09 21:25:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526125094] [2025-01-09 21:25:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526125094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383590669] [2025-01-09 21:25:30,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:30,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:30,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:30,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:30,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:31,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-01-09 21:25:31,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 497 transitions, 1442 flow. Second operand has 6 states, 6 states have (on average 386.3333333333333) internal successors, (2318), 6 states have internal predecessors, (2318), 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-01-09 21:25:31,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:31,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-01-09 21:25:31,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:32,010 INFO L124 PetriNetUnfolderBase]: 188/3246 cut-off events. [2025-01-09 21:25:32,011 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-01-09 21:25:32,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 3246 events. 188/3246 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8018 event pairs, 126 based on Foata normal form. 0/3087 useless extension candidates. Maximal degree in co-relation 2458. Up to 899 conditions per place. [2025-01-09 21:25:32,019 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/496 dead transitions. [2025-01-09 21:25:32,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 496 transitions, 1566 flow [2025-01-09 21:25:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-01-09 21:25:32,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-01-09 21:25:32,021 INFO L175 Difference]: Start difference. First operand has 518 places, 497 transitions, 1442 flow. Second operand 6 states and 2338 transitions. [2025-01-09 21:25:32,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 496 transitions, 1566 flow [2025-01-09 21:25:32,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 496 transitions, 1490 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-01-09 21:25:32,029 INFO L231 Difference]: Finished difference. Result has 515 places, 496 transitions, 1374 flow [2025-01-09 21:25:32,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1374, PETRI_PLACES=515, PETRI_TRANSITIONS=496} [2025-01-09 21:25:32,030 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 73 predicate places. [2025-01-09 21:25:32,030 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 496 transitions, 1374 flow [2025-01-09 21:25:32,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 386.3333333333333) internal successors, (2318), 6 states have internal predecessors, (2318), 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-01-09 21:25:32,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:32,031 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:32,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:25:32,031 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:32,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1166294265, now seen corresponding path program 1 times [2025-01-09 21:25:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:32,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575238309] [2025-01-09 21:25:32,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:32,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:32,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-01-09 21:25:32,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-01-09 21:25:32,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:32,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-01-09 21:25:34,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575238309] [2025-01-09 21:25:34,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575238309] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075967844] [2025-01-09 21:25:34,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:34,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:34,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:34,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:25:34,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-01-09 21:25:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-01-09 21:25:35,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:35,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:35,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 5753 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:25:35,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-01-09 21:25:36,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-01-09 21:25:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075967844] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:36,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:36,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-09 21:25:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350708793] [2025-01-09 21:25:36,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:36,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 21:25:36,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:36,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 21:25:36,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 21:25:36,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-01-09 21:25:36,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 496 transitions, 1374 flow. Second operand has 34 states, 34 states have (on average 430.11764705882354) internal successors, (14624), 34 states have internal predecessors, (14624), 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-01-09 21:25:36,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:36,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-01-09 21:25:36,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:38,639 INFO L124 PetriNetUnfolderBase]: 30/4624 cut-off events. [2025-01-09 21:25:38,639 INFO L125 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-01-09 21:25:38,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 4624 events. 30/4624 cut-off events. For 3207/3207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1966 event pairs, 18 based on Foata normal form. 24/4609 useless extension candidates. Maximal degree in co-relation 5016. Up to 78 conditions per place. [2025-01-09 21:25:38,647 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 47 selfloop transitions, 135 changer transitions 0/597 dead transitions. [2025-01-09 21:25:38,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 597 transitions, 2502 flow [2025-01-09 21:25:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 21:25:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 21:25:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19340 transitions. [2025-01-09 21:25:38,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9614715386527467 [2025-01-09 21:25:38,656 INFO L175 Difference]: Start difference. First operand has 515 places, 496 transitions, 1374 flow. Second operand 45 states and 19340 transitions. [2025-01-09 21:25:38,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 597 transitions, 2502 flow [2025-01-09 21:25:38,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 597 transitions, 2492 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:25:38,668 INFO L231 Difference]: Finished difference. Result has 563 places, 571 transitions, 2238 flow [2025-01-09 21:25:38,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2238, PETRI_PLACES=563, PETRI_TRANSITIONS=571} [2025-01-09 21:25:38,669 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 121 predicate places. [2025-01-09 21:25:38,669 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 571 transitions, 2238 flow [2025-01-09 21:25:38,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 430.11764705882354) internal successors, (14624), 34 states have internal predecessors, (14624), 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-01-09 21:25:38,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:38,673 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:25:38,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:25:38,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:38,874 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:38,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:38,879 INFO L85 PathProgramCache]: Analyzing trace with hash 840522233, now seen corresponding path program 2 times [2025-01-09 21:25:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:38,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544564230] [2025-01-09 21:25:38,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:25:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:39,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2912 statements into 2 equivalence classes. [2025-01-09 21:25:39,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 154 of 2912 statements. [2025-01-09 21:25:39,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:25:39,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71641 trivial. 0 not checked. [2025-01-09 21:25:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544564230] [2025-01-09 21:25:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544564230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:25:39,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:25:39,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:25:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373091798] [2025-01-09 21:25:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:25:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:25:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:39,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:25:39,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:25:39,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-01-09 21:25:39,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 571 transitions, 2238 flow. Second operand has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 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-01-09 21:25:39,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:25:39,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-01-09 21:25:39,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:25:43,895 INFO L124 PetriNetUnfolderBase]: 1238/7764 cut-off events. [2025-01-09 21:25:43,895 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-01-09 21:25:43,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12031 conditions, 7764 events. 1238/7764 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 28017 event pairs, 1026 based on Foata normal form. 0/7379 useless extension candidates. Maximal degree in co-relation 7672. Up to 3430 conditions per place. [2025-01-09 21:25:43,932 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/570 dead transitions. [2025-01-09 21:25:43,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 570 transitions, 2438 flow [2025-01-09 21:25:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:25:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:25:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-01-09 21:25:43,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-01-09 21:25:43,935 INFO L175 Difference]: Start difference. First operand has 563 places, 571 transitions, 2238 flow. Second operand 6 states and 2148 transitions. [2025-01-09 21:25:43,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 570 transitions, 2438 flow [2025-01-09 21:25:43,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 570 transitions, 2330 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-01-09 21:25:43,967 INFO L231 Difference]: Finished difference. Result has 549 places, 570 transitions, 2138 flow [2025-01-09 21:25:43,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2138, PETRI_PLACES=549, PETRI_TRANSITIONS=570} [2025-01-09 21:25:43,968 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 107 predicate places. [2025-01-09 21:25:43,968 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 570 transitions, 2138 flow [2025-01-09 21:25:43,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 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-01-09 21:25:43,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:43,969 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:25:43,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:25:43,973 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:25:43,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 101117145, now seen corresponding path program 1 times [2025-01-09 21:25:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448460906] [2025-01-09 21:25:43,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:44,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-01-09 21:25:44,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-01-09 21:25:44,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:44,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-01-09 21:25:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448460906] [2025-01-09 21:25:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448460906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33755862] [2025-01-09 21:25:54,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:54,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:54,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:54,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:54,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:25:56,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-01-09 21:25:57,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-01-09 21:25:57,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:57,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:57,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 11716 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:25:57,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-01-09 21:25:58,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-01-09 21:25:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33755862] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:25:59,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:25:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-01-09 21:25:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816989675] [2025-01-09 21:25:59,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:25:59,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 21:25:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:25:59,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 21:25:59,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 21:26:00,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-01-09 21:26:00,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 570 transitions, 2138 flow. Second operand has 63 states, 63 states have (on average 430.12698412698415) internal successors, (27098), 63 states have internal predecessors, (27098), 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-01-09 21:26:00,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:00,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-01-09 21:26:00,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:07,586 INFO L124 PetriNetUnfolderBase]: 30/8673 cut-off events. [2025-01-09 21:26:07,587 INFO L125 PetriNetUnfolderBase]: For 13371/13371 co-relation queries the response was YES. [2025-01-09 21:26:07,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10603 conditions, 8673 events. 30/8673 cut-off events. For 13371/13371 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1957 event pairs, 18 based on Foata normal form. 45/8680 useless extension candidates. Maximal degree in co-relation 10183. Up to 168 conditions per place. [2025-01-09 21:26:07,599 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 92 selfloop transitions, 270 changer transitions 0/776 dead transitions. [2025-01-09 21:26:07,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 776 transitions, 5048 flow [2025-01-09 21:26:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-01-09 21:26:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-01-09 21:26:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 38667 transitions. [2025-01-09 21:26:07,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611483967188665 [2025-01-09 21:26:07,614 INFO L175 Difference]: Start difference. First operand has 549 places, 570 transitions, 2138 flow. Second operand 90 states and 38667 transitions. [2025-01-09 21:26:07,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 776 transitions, 5048 flow [2025-01-09 21:26:07,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 776 transitions, 5038 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:26:07,636 INFO L231 Difference]: Finished difference. Result has 649 places, 708 transitions, 4120 flow [2025-01-09 21:26:07,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4120, PETRI_PLACES=649, PETRI_TRANSITIONS=708} [2025-01-09 21:26:07,637 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 207 predicate places. [2025-01-09 21:26:07,637 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 708 transitions, 4120 flow [2025-01-09 21:26:07,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 430.12698412698415) internal successors, (27098), 63 states have internal predecessors, (27098), 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-01-09 21:26:07,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:07,643 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:26:07,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:26:07,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 21:26:07,847 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:26:07,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:07,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1575587385, now seen corresponding path program 2 times [2025-01-09 21:26:07,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:07,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806627017] [2025-01-09 21:26:07,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:26:07,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:08,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5641 statements into 2 equivalence classes. [2025-01-09 21:26:08,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 5641 statements. [2025-01-09 21:26:08,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:26:08,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 290132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290132 trivial. 0 not checked. [2025-01-09 21:26:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806627017] [2025-01-09 21:26:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806627017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:08,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:08,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720580632] [2025-01-09 21:26:08,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:08,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:08,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:08,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:09,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 447 [2025-01-09 21:26:09,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 708 transitions, 4120 flow. Second operand has 6 states, 6 states have (on average 388.1666666666667) internal successors, (2329), 6 states have internal predecessors, (2329), 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-01-09 21:26:09,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:09,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 447 [2025-01-09 21:26:09,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:16,331 INFO L124 PetriNetUnfolderBase]: 200/9574 cut-off events. [2025-01-09 21:26:16,331 INFO L125 PetriNetUnfolderBase]: For 3537/3537 co-relation queries the response was YES. [2025-01-09 21:26:16,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14432 conditions, 9574 events. 200/9574 cut-off events. For 3537/3537 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8913 event pairs, 54 based on Foata normal form. 0/9431 useless extension candidates. Maximal degree in co-relation 8410. Up to 2812 conditions per place. [2025-01-09 21:26:16,348 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 75 selfloop transitions, 23 changer transitions 0/743 dead transitions. [2025-01-09 21:26:16,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 743 transitions, 4394 flow [2025-01-09 21:26:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2379 transitions. [2025-01-09 21:26:16,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870246085011185 [2025-01-09 21:26:16,351 INFO L175 Difference]: Start difference. First operand has 649 places, 708 transitions, 4120 flow. Second operand 6 states and 2379 transitions. [2025-01-09 21:26:16,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 743 transitions, 4394 flow [2025-01-09 21:26:16,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 743 transitions, 4040 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-01-09 21:26:16,383 INFO L231 Difference]: Finished difference. Result has 617 places, 730 transitions, 3924 flow [2025-01-09 21:26:16,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3924, PETRI_PLACES=617, PETRI_TRANSITIONS=730} [2025-01-09 21:26:16,384 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 175 predicate places. [2025-01-09 21:26:16,384 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 730 transitions, 3924 flow [2025-01-09 21:26:16,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 388.1666666666667) internal successors, (2329), 6 states have internal predecessors, (2329), 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-01-09 21:26:16,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:16,386 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:26:16,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:26:16,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:26:16,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash 145591854, now seen corresponding path program 1 times [2025-01-09 21:26:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452203710] [2025-01-09 21:26:16,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:17,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5647 statements into 1 equivalence classes. [2025-01-09 21:26:17,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5647 of 5647 statements. [2025-01-09 21:26:17,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:17,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 290674 backedges. 1620 proven. 145891 refuted. 0 times theorem prover too weak. 143163 trivial. 0 not checked. [2025-01-09 21:26:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452203710] [2025-01-09 21:26:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452203710] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:26:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854347413] [2025-01-09 21:26:30,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:30,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:26:30,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:26:30,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:26:30,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:26:33,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5647 statements into 1 equivalence classes.