./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.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/28-race_reach_92-evilcollapse_racing.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 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:03,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:03,182 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:29:03,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:03,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:03,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:03,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:03,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:03,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:03,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:03,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:03,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:03,206 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:03,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:03,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:03,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:03,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:03,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:03,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:03,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:03,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:03,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:03,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:03,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:03,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:03,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:03,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:03,210 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 -> 6efa0097353392a416215c2535cfc6cdc34364d9b0eb2844e37da9edef467642 [2025-01-09 21:29:03,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:03,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:03,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:03,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:03,437 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:03,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-01-09 21:29:04,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1176530f5/be084afafaba460c9f575337d9703c93/FLAG0b49f768f [2025-01-09 21:29:04,867 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:04,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_92-evilcollapse_racing.i [2025-01-09 21:29:04,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1176530f5/be084afafaba460c9f575337d9703c93/FLAG0b49f768f [2025-01-09 21:29:05,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1176530f5/be084afafaba460c9f575337d9703c93 [2025-01-09 21:29:05,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:05,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:05,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:05,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:05,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:05,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c33d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05, skipping insertion in model container [2025-01-09 21:29:05,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:05,542 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:05,544 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:05,545 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:05,547 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:05,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:05,618 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:05,667 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:05,667 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:05,668 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:05,668 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-09 21:29:05,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:05,726 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:05,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05 WrapperNode [2025-01-09 21:29:05,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:05,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:05,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:05,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:05,732 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:29:05" (1/1) ... [2025-01-09 21:29:05,745 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:29:05" (1/1) ... [2025-01-09 21:29:05,777 INFO L138 Inliner]: procedures = 280, calls = 136, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 433 [2025-01-09 21:29:05,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:05,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:05,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:05,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:05,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:05,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:05,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:05,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:05,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (1/1) ... [2025-01-09 21:29:05,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:05,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:05,871 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:29:05,881 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:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:29:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:29:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:29:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:05,899 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:29:06,041 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:06,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:06,624 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:06,624 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:06,676 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:06,676 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 21:29:06,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:06 BoogieIcfgContainer [2025-01-09 21:29:06,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:06,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:06,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:06,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:06,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:05" (1/3) ... [2025-01-09 21:29:06,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a41407b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:06, skipping insertion in model container [2025-01-09 21:29:06,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:05" (2/3) ... [2025-01-09 21:29:06,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a41407b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:06, skipping insertion in model container [2025-01-09 21:29:06,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:06" (3/3) ... [2025-01-09 21:29:06,686 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_92-evilcollapse_racing.i [2025-01-09 21:29:06,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:06,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_92-evilcollapse_racing.i that has 2 procedures, 474 locations, 1 initial locations, 11 loop locations, and 23 error locations. [2025-01-09 21:29:06,699 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:06,793 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:29:06,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 477 places, 495 transitions, 997 flow [2025-01-09 21:29:06,983 INFO L124 PetriNetUnfolderBase]: 21/525 cut-off events. [2025-01-09 21:29:06,989 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:06,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 525 events. 21/525 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 928 event pairs, 0 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 344. Up to 4 conditions per place. [2025-01-09 21:29:06,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 477 places, 495 transitions, 997 flow [2025-01-09 21:29:07,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 477 places, 495 transitions, 997 flow [2025-01-09 21:29:07,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:07,025 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;@43bc70b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:07,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-09 21:29:07,043 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:07,044 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-01-09 21:29:07,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:07,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:07,045 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] [2025-01-09 21:29:07,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:07,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2128260812, now seen corresponding path program 1 times [2025-01-09 21:29:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3027217] [2025-01-09 21:29:07,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:07,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:29:07,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:29:07,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:07,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:08,080 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:29:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3027217] [2025-01-09 21:29:08,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3027217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:08,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:08,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338182762] [2025-01-09 21:29:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:08,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:08,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:08,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:08,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:08,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 495 [2025-01-09 21:29:08,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 495 transitions, 997 flow. Second operand has 6 states, 6 states have (on average 372.3333333333333) internal successors, (2234), 6 states have internal predecessors, (2234), 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:29:08,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:08,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 495 [2025-01-09 21:29:08,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:09,064 INFO L124 PetriNetUnfolderBase]: 319/1693 cut-off events. [2025-01-09 21:29:09,065 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-01-09 21:29:09,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 1693 events. 319/1693 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9589 event pairs, 288 based on Foata normal form. 88/1645 useless extension candidates. Maximal degree in co-relation 1972. Up to 690 conditions per place. [2025-01-09 21:29:09,096 INFO L140 encePairwiseOnDemand]: 468/495 looper letters, 96 selfloop transitions, 10 changer transitions 2/476 dead transitions. [2025-01-09 21:29:09,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 476 transitions, 1171 flow [2025-01-09 21:29:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2349 transitions. [2025-01-09 21:29:09,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7909090909090909 [2025-01-09 21:29:09,124 INFO L175 Difference]: Start difference. First operand has 477 places, 495 transitions, 997 flow. Second operand 6 states and 2349 transitions. [2025-01-09 21:29:09,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 476 transitions, 1171 flow [2025-01-09 21:29:09,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 476 transitions, 1171 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:09,141 INFO L231 Difference]: Finished difference. Result has 478 places, 474 transitions, 975 flow [2025-01-09 21:29:09,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=975, PETRI_PLACES=478, PETRI_TRANSITIONS=474} [2025-01-09 21:29:09,147 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 1 predicate places. [2025-01-09 21:29:09,147 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 474 transitions, 975 flow [2025-01-09 21:29:09,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.3333333333333) internal successors, (2234), 6 states have internal predecessors, (2234), 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:29:09,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:09,149 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] [2025-01-09 21:29:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:09,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1629333163, now seen corresponding path program 1 times [2025-01-09 21:29:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:09,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513397451] [2025-01-09 21:29:09,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:09,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:29:09,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:29:09,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:09,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:09,680 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:29:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513397451] [2025-01-09 21:29:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513397451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079983690] [2025-01-09 21:29:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:09,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:09,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:09,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:10,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 495 [2025-01-09 21:29:10,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 474 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 372.3333333333333) internal successors, (2234), 6 states have internal predecessors, (2234), 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:29:10,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:10,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 495 [2025-01-09 21:29:10,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:10,370 INFO L124 PetriNetUnfolderBase]: 319/1689 cut-off events. [2025-01-09 21:29:10,370 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-01-09 21:29:10,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 1689 events. 319/1689 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9552 event pairs, 288 based on Foata normal form. 0/1557 useless extension candidates. Maximal degree in co-relation 2231. Up to 690 conditions per place. [2025-01-09 21:29:10,376 INFO L140 encePairwiseOnDemand]: 483/495 looper letters, 96 selfloop transitions, 10 changer transitions 0/472 dead transitions. [2025-01-09 21:29:10,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 472 transitions, 1183 flow [2025-01-09 21:29:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2334 transitions. [2025-01-09 21:29:10,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7858585858585858 [2025-01-09 21:29:10,380 INFO L175 Difference]: Start difference. First operand has 478 places, 474 transitions, 975 flow. Second operand 6 states and 2334 transitions. [2025-01-09 21:29:10,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 472 transitions, 1183 flow [2025-01-09 21:29:10,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 472 transitions, 1163 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:10,385 INFO L231 Difference]: Finished difference. Result has 474 places, 472 transitions, 971 flow [2025-01-09 21:29:10,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=971, PETRI_PLACES=474, PETRI_TRANSITIONS=472} [2025-01-09 21:29:10,386 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -3 predicate places. [2025-01-09 21:29:10,387 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 472 transitions, 971 flow [2025-01-09 21:29:10,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.3333333333333) internal successors, (2234), 6 states have internal predecessors, (2234), 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:29:10,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:10,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:10,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:10,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -639394483, now seen corresponding path program 1 times [2025-01-09 21:29:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273500253] [2025-01-09 21:29:10,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:10,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:29:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:29:10,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:10,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:10,449 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:29:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:10,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273500253] [2025-01-09 21:29:10,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273500253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:10,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:10,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:29:10,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239598395] [2025-01-09 21:29:10,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:10,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:10,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:10,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:10,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:10,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 495 [2025-01-09 21:29:10,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 472 transitions, 971 flow. Second operand has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 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:29:10,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:10,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 495 [2025-01-09 21:29:10,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:10,528 INFO L124 PetriNetUnfolderBase]: 15/650 cut-off events. [2025-01-09 21:29:10,529 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-01-09 21:29:10,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 650 events. 15/650 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1436 event pairs, 8 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 487. Up to 34 conditions per place. [2025-01-09 21:29:10,531 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 15 selfloop transitions, 2 changer transitions 0/473 dead transitions. [2025-01-09 21:29:10,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 473 transitions, 1007 flow [2025-01-09 21:29:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2025-01-09 21:29:10,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474747474747475 [2025-01-09 21:29:10,534 INFO L175 Difference]: Start difference. First operand has 474 places, 472 transitions, 971 flow. Second operand 3 states and 1407 transitions. [2025-01-09 21:29:10,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 473 transitions, 1007 flow [2025-01-09 21:29:10,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 473 transitions, 987 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:10,542 INFO L231 Difference]: Finished difference. Result has 472 places, 473 transitions, 963 flow [2025-01-09 21:29:10,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=963, PETRI_PLACES=472, PETRI_TRANSITIONS=473} [2025-01-09 21:29:10,544 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -5 predicate places. [2025-01-09 21:29:10,544 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 473 transitions, 963 flow [2025-01-09 21:29:10,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 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:29:10,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:10,545 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] [2025-01-09 21:29:10,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:10,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:10,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash 766600808, now seen corresponding path program 1 times [2025-01-09 21:29:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:10,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071006589] [2025-01-09 21:29:10,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:10,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:29:10,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:29:10,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:10,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:10,993 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:29:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071006589] [2025-01-09 21:29:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071006589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:10,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:10,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:10,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134828428] [2025-01-09 21:29:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:10,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:10,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:11,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 495 [2025-01-09 21:29:11,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 473 transitions, 963 flow. Second operand has 6 states, 6 states have (on average 372.6666666666667) internal successors, (2236), 6 states have internal predecessors, (2236), 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:29:11,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:11,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 495 [2025-01-09 21:29:11,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:11,691 INFO L124 PetriNetUnfolderBase]: 320/1811 cut-off events. [2025-01-09 21:29:11,691 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-01-09 21:29:11,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 1811 events. 320/1811 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9966 event pairs, 288 based on Foata normal form. 0/1675 useless extension candidates. Maximal degree in co-relation 2295. Up to 738 conditions per place. [2025-01-09 21:29:11,699 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 103 selfloop transitions, 5 changer transitions 0/472 dead transitions. [2025-01-09 21:29:11,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 472 transitions, 1177 flow [2025-01-09 21:29:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2329 transitions. [2025-01-09 21:29:11,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841750841750842 [2025-01-09 21:29:11,706 INFO L175 Difference]: Start difference. First operand has 472 places, 473 transitions, 963 flow. Second operand 6 states and 2329 transitions. [2025-01-09 21:29:11,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 472 transitions, 1177 flow [2025-01-09 21:29:11,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 472 transitions, 1175 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:11,714 INFO L231 Difference]: Finished difference. Result has 475 places, 472 transitions, 969 flow [2025-01-09 21:29:11,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=969, PETRI_PLACES=475, PETRI_TRANSITIONS=472} [2025-01-09 21:29:11,716 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -2 predicate places. [2025-01-09 21:29:11,716 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 472 transitions, 969 flow [2025-01-09 21:29:11,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.6666666666667) internal successors, (2236), 6 states have internal predecessors, (2236), 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:29:11,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:11,717 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] [2025-01-09 21:29:11,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:11,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:11,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1647771271, now seen corresponding path program 1 times [2025-01-09 21:29:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:11,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441210384] [2025-01-09 21:29:11,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:11,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:29:11,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:29:11,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:11,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:11,804 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:29:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441210384] [2025-01-09 21:29:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441210384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:11,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:11,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:29:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284507325] [2025-01-09 21:29:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:11,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:11,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:11,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:11,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 495 [2025-01-09 21:29:11,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 472 transitions, 969 flow. Second operand has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 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:29:11,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:11,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 495 [2025-01-09 21:29:11,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:11,916 INFO L124 PetriNetUnfolderBase]: 15/836 cut-off events. [2025-01-09 21:29:11,917 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-01-09 21:29:11,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 836 events. 15/836 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1646 event pairs, 8 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 682. Up to 38 conditions per place. [2025-01-09 21:29:11,919 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 15 selfloop transitions, 2 changer transitions 0/473 dead transitions. [2025-01-09 21:29:11,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 473 transitions, 1005 flow [2025-01-09 21:29:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2025-01-09 21:29:11,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474747474747475 [2025-01-09 21:29:11,925 INFO L175 Difference]: Start difference. First operand has 475 places, 472 transitions, 969 flow. Second operand 3 states and 1407 transitions. [2025-01-09 21:29:11,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 473 transitions, 1005 flow [2025-01-09 21:29:11,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 473 transitions, 995 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:11,931 INFO L231 Difference]: Finished difference. Result has 473 places, 473 transitions, 971 flow [2025-01-09 21:29:11,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=971, PETRI_PLACES=473, PETRI_TRANSITIONS=473} [2025-01-09 21:29:11,935 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -4 predicate places. [2025-01-09 21:29:11,935 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 473 transitions, 971 flow [2025-01-09 21:29:11,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 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:29:11,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:11,937 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] [2025-01-09 21:29:11,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:11,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:11,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1886697230, now seen corresponding path program 1 times [2025-01-09 21:29:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336200648] [2025-01-09 21:29:11,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:11,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 21:29:11,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 21:29:11,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:11,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:12,384 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:29:12,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:12,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336200648] [2025-01-09 21:29:12,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336200648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:12,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:12,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:12,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924961472] [2025-01-09 21:29:12,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:12,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:12,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:12,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:13,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 495 [2025-01-09 21:29:13,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 473 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 411.5) internal successors, (2469), 6 states have internal predecessors, (2469), 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:29:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:13,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 495 [2025-01-09 21:29:13,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:13,242 INFO L124 PetriNetUnfolderBase]: 83/1150 cut-off events. [2025-01-09 21:29:13,243 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-01-09 21:29:13,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1150 events. 83/1150 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3572 event pairs, 64 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 963. Up to 315 conditions per place. [2025-01-09 21:29:13,247 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 66 selfloop transitions, 5 changer transitions 0/472 dead transitions. [2025-01-09 21:29:13,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 472 transitions, 1111 flow [2025-01-09 21:29:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2514 transitions. [2025-01-09 21:29:13,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464646464646465 [2025-01-09 21:29:13,252 INFO L175 Difference]: Start difference. First operand has 473 places, 473 transitions, 971 flow. Second operand 6 states and 2514 transitions. [2025-01-09 21:29:13,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 472 transitions, 1111 flow [2025-01-09 21:29:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 472 transitions, 1109 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:13,258 INFO L231 Difference]: Finished difference. Result has 476 places, 472 transitions, 977 flow [2025-01-09 21:29:13,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=977, PETRI_PLACES=476, PETRI_TRANSITIONS=472} [2025-01-09 21:29:13,260 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -1 predicate places. [2025-01-09 21:29:13,260 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 472 transitions, 977 flow [2025-01-09 21:29:13,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 411.5) internal successors, (2469), 6 states have internal predecessors, (2469), 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:29:13,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:13,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:13,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:13,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:13,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1056480967, now seen corresponding path program 1 times [2025-01-09 21:29:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:13,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999714634] [2025-01-09 21:29:13,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:13,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:29:13,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:29:13,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:29:13,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999714634] [2025-01-09 21:29:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999714634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:13,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788876140] [2025-01-09 21:29:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:13,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:13,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:13,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:14,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 495 [2025-01-09 21:29:14,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 472 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 375.3333333333333) internal successors, (2252), 6 states have internal predecessors, (2252), 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:29:14,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:14,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 495 [2025-01-09 21:29:14,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:14,439 INFO L124 PetriNetUnfolderBase]: 320/1991 cut-off events. [2025-01-09 21:29:14,439 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-01-09 21:29:14,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 1991 events. 320/1991 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10555 event pairs, 288 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 2338. Up to 804 conditions per place. [2025-01-09 21:29:14,449 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 103 selfloop transitions, 5 changer transitions 0/471 dead transitions. [2025-01-09 21:29:14,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 471 transitions, 1191 flow [2025-01-09 21:29:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2329 transitions. [2025-01-09 21:29:14,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841750841750842 [2025-01-09 21:29:14,454 INFO L175 Difference]: Start difference. First operand has 476 places, 472 transitions, 977 flow. Second operand 6 states and 2329 transitions. [2025-01-09 21:29:14,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 471 transitions, 1191 flow [2025-01-09 21:29:14,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1181 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:14,463 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 975 flow [2025-01-09 21:29:14,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=975, PETRI_PLACES=475, PETRI_TRANSITIONS=471} [2025-01-09 21:29:14,466 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -2 predicate places. [2025-01-09 21:29:14,466 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 975 flow [2025-01-09 21:29:14,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.3333333333333) internal successors, (2252), 6 states have internal predecessors, (2252), 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:29:14,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:14,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:14,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:14,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash -313374372, now seen corresponding path program 1 times [2025-01-09 21:29:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:14,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408288121] [2025-01-09 21:29:14,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:14,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 21:29:14,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 21:29:14,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:14,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:29:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408288121] [2025-01-09 21:29:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408288121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:14,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891388014] [2025-01-09 21:29:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:14,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:14,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:14,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:15,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 495 [2025-01-09 21:29:15,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 471 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 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:29:15,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:15,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 495 [2025-01-09 21:29:15,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:15,710 INFO L124 PetriNetUnfolderBase]: 320/1987 cut-off events. [2025-01-09 21:29:15,710 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-01-09 21:29:15,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 1987 events. 320/1987 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10522 event pairs, 288 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 2354. Up to 788 conditions per place. [2025-01-09 21:29:15,715 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 99 selfloop transitions, 5 changer transitions 0/470 dead transitions. [2025-01-09 21:29:15,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 470 transitions, 1181 flow [2025-01-09 21:29:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2349 transitions. [2025-01-09 21:29:15,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7909090909090909 [2025-01-09 21:29:15,720 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 975 flow. Second operand 6 states and 2349 transitions. [2025-01-09 21:29:15,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 470 transitions, 1181 flow [2025-01-09 21:29:15,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 470 transitions, 1171 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:15,725 INFO L231 Difference]: Finished difference. Result has 474 places, 470 transitions, 973 flow [2025-01-09 21:29:15,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=973, PETRI_PLACES=474, PETRI_TRANSITIONS=470} [2025-01-09 21:29:15,726 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -3 predicate places. [2025-01-09 21:29:15,728 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 470 transitions, 973 flow [2025-01-09 21:29:15,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 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:29:15,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:15,729 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] [2025-01-09 21:29:15,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:15,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:15,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1724348903, now seen corresponding path program 1 times [2025-01-09 21:29:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:15,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975277394] [2025-01-09 21:29:15,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:15,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 21:29:15,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 21:29:15,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:15,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:16,142 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:29:16,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:16,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975277394] [2025-01-09 21:29:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975277394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:16,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:16,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059122977] [2025-01-09 21:29:16,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:16,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:16,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:16,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:16,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 495 [2025-01-09 21:29:16,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 470 transitions, 973 flow. Second operand has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 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:29:16,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:16,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 495 [2025-01-09 21:29:16,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:16,687 INFO L124 PetriNetUnfolderBase]: 320/1983 cut-off events. [2025-01-09 21:29:16,688 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-01-09 21:29:16,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1983 events. 320/1983 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10547 event pairs, 288 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 2369. Up to 788 conditions per place. [2025-01-09 21:29:16,695 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 99 selfloop transitions, 5 changer transitions 0/469 dead transitions. [2025-01-09 21:29:16,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 469 transitions, 1179 flow [2025-01-09 21:29:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2349 transitions. [2025-01-09 21:29:16,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7909090909090909 [2025-01-09 21:29:16,700 INFO L175 Difference]: Start difference. First operand has 474 places, 470 transitions, 973 flow. Second operand 6 states and 2349 transitions. [2025-01-09 21:29:16,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 469 transitions, 1179 flow [2025-01-09 21:29:16,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 469 transitions, 1169 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:16,705 INFO L231 Difference]: Finished difference. Result has 473 places, 469 transitions, 971 flow [2025-01-09 21:29:16,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=971, PETRI_PLACES=473, PETRI_TRANSITIONS=469} [2025-01-09 21:29:16,707 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -4 predicate places. [2025-01-09 21:29:16,707 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 469 transitions, 971 flow [2025-01-09 21:29:16,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 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:29:16,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:16,709 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] [2025-01-09 21:29:16,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:29:16,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:16,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash -850456530, now seen corresponding path program 1 times [2025-01-09 21:29:16,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:16,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664264667] [2025-01-09 21:29:16,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:16,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 21:29:16,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 21:29:16,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:16,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:17,116 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:29:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664264667] [2025-01-09 21:29:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664264667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270492484] [2025-01-09 21:29:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:17,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:17,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:17,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:17,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:17,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 495 [2025-01-09 21:29:17,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 469 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 376.5) internal successors, (2259), 6 states have internal predecessors, (2259), 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:29:17,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:17,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 495 [2025-01-09 21:29:17,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:17,788 INFO L124 PetriNetUnfolderBase]: 320/1979 cut-off events. [2025-01-09 21:29:17,789 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-01-09 21:29:17,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1979 events. 320/1979 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10489 event pairs, 288 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 2382. Up to 808 conditions per place. [2025-01-09 21:29:17,796 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 104 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-01-09 21:29:17,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 468 transitions, 1187 flow [2025-01-09 21:29:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2324 transitions. [2025-01-09 21:29:17,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7824915824915825 [2025-01-09 21:29:17,801 INFO L175 Difference]: Start difference. First operand has 473 places, 469 transitions, 971 flow. Second operand 6 states and 2324 transitions. [2025-01-09 21:29:17,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 468 transitions, 1187 flow [2025-01-09 21:29:17,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 468 transitions, 1177 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:17,806 INFO L231 Difference]: Finished difference. Result has 472 places, 468 transitions, 969 flow [2025-01-09 21:29:17,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=969, PETRI_PLACES=472, PETRI_TRANSITIONS=468} [2025-01-09 21:29:17,808 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, -5 predicate places. [2025-01-09 21:29:17,808 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 468 transitions, 969 flow [2025-01-09 21:29:17,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 376.5) internal successors, (2259), 6 states have internal predecessors, (2259), 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:29:17,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:17,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:17,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:29:17,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:17,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash -232702918, now seen corresponding path program 1 times [2025-01-09 21:29:17,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:17,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128027704] [2025-01-09 21:29:17,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:17,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-09 21:29:17,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-09 21:29:17,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:17,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 21:29:17,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:17,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128027704] [2025-01-09 21:29:17,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128027704] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:17,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93967600] [2025-01-09 21:29:17,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:17,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:17,984 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:29:17,985 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:29:18,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-09 21:29:18,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-09 21:29:18,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:18,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:18,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:29:18,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 21:29:18,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 21:29:18,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93967600] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:18,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:18,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:29:18,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494518343] [2025-01-09 21:29:18,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:18,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:29:18,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:18,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:29:18,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:29:18,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 495 [2025-01-09 21:29:18,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 468 transitions, 969 flow. Second operand has 10 states, 10 states have (on average 461.8) internal successors, (4618), 10 states have internal predecessors, (4618), 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:29:18,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:18,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 495 [2025-01-09 21:29:18,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:18,663 INFO L124 PetriNetUnfolderBase]: 15/1000 cut-off events. [2025-01-09 21:29:18,663 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-01-09 21:29:18,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 1000 events. 15/1000 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1203 event pairs, 8 based on Foata normal form. 4/974 useless extension candidates. Maximal degree in co-relation 888. Up to 38 conditions per place. [2025-01-09 21:29:18,666 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 19 selfloop transitions, 9 changer transitions 0/476 dead transitions. [2025-01-09 21:29:18,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 476 transitions, 1043 flow [2025-01-09 21:29:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:29:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:29:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4170 transitions. [2025-01-09 21:29:18,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936026936026936 [2025-01-09 21:29:18,673 INFO L175 Difference]: Start difference. First operand has 472 places, 468 transitions, 969 flow. Second operand 9 states and 4170 transitions. [2025-01-09 21:29:18,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 476 transitions, 1043 flow [2025-01-09 21:29:18,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 476 transitions, 1033 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:18,682 INFO L231 Difference]: Finished difference. Result has 478 places, 474 transitions, 1009 flow [2025-01-09 21:29:18,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1009, PETRI_PLACES=478, PETRI_TRANSITIONS=474} [2025-01-09 21:29:18,683 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 1 predicate places. [2025-01-09 21:29:18,683 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 474 transitions, 1009 flow [2025-01-09 21:29:18,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 461.8) internal successors, (4618), 10 states have internal predecessors, (4618), 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:29:18,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:18,685 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] [2025-01-09 21:29:18,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:29:18,886 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:29:18,886 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:18,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2037874080, now seen corresponding path program 2 times [2025-01-09 21:29:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:18,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152164942] [2025-01-09 21:29:18,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:18,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 2 equivalence classes. [2025-01-09 21:29:18,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 123 of 422 statements. [2025-01-09 21:29:18,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:18,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:19,145 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:29:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152164942] [2025-01-09 21:29:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152164942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:19,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039398471] [2025-01-09 21:29:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:19,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:19,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:19,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:19,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:19,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 495 [2025-01-09 21:29:19,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 474 transitions, 1009 flow. Second operand has 6 states, 6 states have (on average 405.3333333333333) internal successors, (2432), 6 states have internal predecessors, (2432), 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:29:19,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:19,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 495 [2025-01-09 21:29:19,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:20,228 INFO L124 PetriNetUnfolderBase]: 83/1316 cut-off events. [2025-01-09 21:29:20,228 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2025-01-09 21:29:20,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 1316 events. 83/1316 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3112 event pairs, 64 based on Foata normal form. 0/1243 useless extension candidates. Maximal degree in co-relation 1092. Up to 362 conditions per place. [2025-01-09 21:29:20,232 INFO L140 encePairwiseOnDemand]: 483/495 looper letters, 69 selfloop transitions, 10 changer transitions 0/472 dead transitions. [2025-01-09 21:29:20,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 472 transitions, 1163 flow [2025-01-09 21:29:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2469 transitions. [2025-01-09 21:29:20,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8313131313131313 [2025-01-09 21:29:20,236 INFO L175 Difference]: Start difference. First operand has 478 places, 474 transitions, 1009 flow. Second operand 6 states and 2469 transitions. [2025-01-09 21:29:20,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 472 transitions, 1163 flow [2025-01-09 21:29:20,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 472 transitions, 1157 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:20,241 INFO L231 Difference]: Finished difference. Result has 480 places, 472 transitions, 1019 flow [2025-01-09 21:29:20,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1019, PETRI_PLACES=480, PETRI_TRANSITIONS=472} [2025-01-09 21:29:20,243 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 3 predicate places. [2025-01-09 21:29:20,243 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 472 transitions, 1019 flow [2025-01-09 21:29:20,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.3333333333333) internal successors, (2432), 6 states have internal predecessors, (2432), 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:29:20,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:20,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:20,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:29:20,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1167689526, now seen corresponding path program 1 times [2025-01-09 21:29:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663864253] [2025-01-09 21:29:20,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:20,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 21:29:20,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 21:29:20,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:20,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-01-09 21:29:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:20,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663864253] [2025-01-09 21:29:20,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663864253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:20,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399276788] [2025-01-09 21:29:20,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:20,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:20,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:20,562 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:29:20,564 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:29:20,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 21:29:20,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 21:29:20,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:20,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:20,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:29:20,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 1 proven. 399 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 21:29:21,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 1 proven. 399 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 21:29:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399276788] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:21,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-09 21:29:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612380123] [2025-01-09 21:29:21,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:21,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 21:29:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:21,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 21:29:21,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 21:29:21,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 495 [2025-01-09 21:29:21,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 472 transitions, 1019 flow. Second operand has 19 states, 19 states have (on average 456.5263157894737) internal successors, (8674), 19 states have internal predecessors, (8674), 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:29:21,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:21,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 495 [2025-01-09 21:29:21,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:22,656 INFO L124 PetriNetUnfolderBase]: 16/2378 cut-off events. [2025-01-09 21:29:22,657 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-01-09 21:29:22,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 2378 events. 16/2378 cut-off events. For 81/82 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1198 event pairs, 8 based on Foata normal form. 13/2363 useless extension candidates. Maximal degree in co-relation 2450. Up to 40 conditions per place. [2025-01-09 21:29:22,663 INFO L140 encePairwiseOnDemand]: 484/495 looper letters, 51 selfloop transitions, 68 changer transitions 0/558 dead transitions. [2025-01-09 21:29:22,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 558 transitions, 1667 flow [2025-01-09 21:29:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 21:29:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-01-09 21:29:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 28734 transitions. [2025-01-09 21:29:22,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214045214045214 [2025-01-09 21:29:22,694 INFO L175 Difference]: Start difference. First operand has 480 places, 472 transitions, 1019 flow. Second operand 63 states and 28734 transitions. [2025-01-09 21:29:22,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 558 transitions, 1667 flow [2025-01-09 21:29:22,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 558 transitions, 1647 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:22,703 INFO L231 Difference]: Finished difference. Result has 553 places, 534 transitions, 1519 flow [2025-01-09 21:29:22,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1519, PETRI_PLACES=553, PETRI_TRANSITIONS=534} [2025-01-09 21:29:22,704 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 76 predicate places. [2025-01-09 21:29:22,704 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 534 transitions, 1519 flow [2025-01-09 21:29:22,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 456.5263157894737) internal successors, (8674), 19 states have internal predecessors, (8674), 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:29:22,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:22,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:22,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:29:22,913 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:29:22,913 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 769505417, now seen corresponding path program 2 times [2025-01-09 21:29:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:22,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145497980] [2025-01-09 21:29:22,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:23,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1484 statements into 2 equivalence classes. [2025-01-09 21:29:23,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 166 of 1484 statements. [2025-01-09 21:29:23,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:23,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12365 trivial. 0 not checked. [2025-01-09 21:29:23,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:23,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145497980] [2025-01-09 21:29:23,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145497980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:23,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:23,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594498297] [2025-01-09 21:29:23,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:23,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:23,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:23,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:23,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 495 [2025-01-09 21:29:23,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 534 transitions, 1519 flow. Second operand has 6 states, 6 states have (on average 414.3333333333333) internal successors, (2486), 6 states have internal predecessors, (2486), 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:29:23,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:23,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 495 [2025-01-09 21:29:23,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:24,548 INFO L124 PetriNetUnfolderBase]: 103/2782 cut-off events. [2025-01-09 21:29:24,549 INFO L125 PetriNetUnfolderBase]: For 441/446 co-relation queries the response was YES. [2025-01-09 21:29:24,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 2782 events. 103/2782 cut-off events. For 441/446 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4052 event pairs, 80 based on Foata normal form. 0/2700 useless extension candidates. Maximal degree in co-relation 3132. Up to 823 conditions per place. [2025-01-09 21:29:24,555 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 66 selfloop transitions, 5 changer transitions 0/533 dead transitions. [2025-01-09 21:29:24,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 533 transitions, 1659 flow [2025-01-09 21:29:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2514 transitions. [2025-01-09 21:29:24,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464646464646465 [2025-01-09 21:29:24,560 INFO L175 Difference]: Start difference. First operand has 553 places, 534 transitions, 1519 flow. Second operand 6 states and 2514 transitions. [2025-01-09 21:29:24,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 533 transitions, 1659 flow [2025-01-09 21:29:24,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 533 transitions, 1583 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-01-09 21:29:24,571 INFO L231 Difference]: Finished difference. Result has 550 places, 533 transitions, 1451 flow [2025-01-09 21:29:24,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1451, PETRI_PLACES=550, PETRI_TRANSITIONS=533} [2025-01-09 21:29:24,572 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 73 predicate places. [2025-01-09 21:29:24,572 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 533 transitions, 1451 flow [2025-01-09 21:29:24,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 414.3333333333333) internal successors, (2486), 6 states have internal predecessors, (2486), 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:29:24,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:24,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:24,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:29:24,574 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:24,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1354463615, now seen corresponding path program 1 times [2025-01-09 21:29:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:24,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263975784] [2025-01-09 21:29:24,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:24,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-01-09 21:29:24,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-01-09 21:29:24,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:24,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-01-09 21:29:26,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:26,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263975784] [2025-01-09 21:29:26,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263975784] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:26,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183935438] [2025-01-09 21:29:26,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:26,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:26,738 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:29:26,739 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:29:27,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-01-09 21:29:27,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-01-09 21:29:27,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:27,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:27,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 5801 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:29:27,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-01-09 21:29:28,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12365 backedges. 6508 proven. 2779 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2025-01-09 21:29:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183935438] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:29,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:29,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-09 21:29:29,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033210264] [2025-01-09 21:29:29,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:29,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 21:29:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:29,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 21:29:29,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 21:29:29,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 495 [2025-01-09 21:29:29,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 533 transitions, 1451 flow. Second operand has 34 states, 34 states have (on average 462.11764705882354) internal successors, (15712), 34 states have internal predecessors, (15712), 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:29:29,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:29,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 495 [2025-01-09 21:29:29,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:30,995 INFO L124 PetriNetUnfolderBase]: 16/4537 cut-off events. [2025-01-09 21:29:30,995 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-01-09 21:29:30,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 4537 events. 16/4537 cut-off events. For 3212/3213 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1193 event pairs, 8 based on Foata normal form. 24/4534 useless extension candidates. Maximal degree in co-relation 5088. Up to 78 conditions per place. [2025-01-09 21:29:31,005 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 51 selfloop transitions, 135 changer transitions 0/634 dead transitions. [2025-01-09 21:29:31,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 634 transitions, 2587 flow [2025-01-09 21:29:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 21:29:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 21:29:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20784 transitions. [2025-01-09 21:29:31,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.933063973063973 [2025-01-09 21:29:31,014 INFO L175 Difference]: Start difference. First operand has 550 places, 533 transitions, 1451 flow. Second operand 45 states and 20784 transitions. [2025-01-09 21:29:31,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 634 transitions, 2587 flow [2025-01-09 21:29:31,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 634 transitions, 2577 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:31,025 INFO L231 Difference]: Finished difference. Result has 598 places, 608 transitions, 2315 flow [2025-01-09 21:29:31,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2315, PETRI_PLACES=598, PETRI_TRANSITIONS=608} [2025-01-09 21:29:31,026 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 121 predicate places. [2025-01-09 21:29:31,026 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 608 transitions, 2315 flow [2025-01-09 21:29:31,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 462.11764705882354) internal successors, (15712), 34 states have internal predecessors, (15712), 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:29:31,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:31,030 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] [2025-01-09 21:29:31,048 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:29:31,231 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:29:31,231 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:31,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash 641549697, now seen corresponding path program 2 times [2025-01-09 21:29:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:31,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106063545] [2025-01-09 21:29:31,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:31,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2931 statements into 2 equivalence classes. [2025-01-09 21:29:31,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 173 of 2931 statements. [2025-01-09 21:29:31,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:31,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 58141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58141 trivial. 0 not checked. [2025-01-09 21:29:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106063545] [2025-01-09 21:29:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106063545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:31,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:31,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140941742] [2025-01-09 21:29:31,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:31,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:31,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:31,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:31,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:32,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 495 [2025-01-09 21:29:32,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 608 transitions, 2315 flow. Second operand has 6 states, 6 states have (on average 379.1666666666667) internal successors, (2275), 6 states have internal predecessors, (2275), 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:29:32,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:32,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 495 [2025-01-09 21:29:32,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:35,177 INFO L124 PetriNetUnfolderBase]: 360/5848 cut-off events. [2025-01-09 21:29:35,177 INFO L125 PetriNetUnfolderBase]: For 1234/1243 co-relation queries the response was YES. [2025-01-09 21:29:35,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8846 conditions, 5848 events. 360/5848 cut-off events. For 1234/1243 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 11958 event pairs, 324 based on Foata normal form. 0/5716 useless extension candidates. Maximal degree in co-relation 6602. Up to 2196 conditions per place. [2025-01-09 21:29:35,194 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 104 selfloop transitions, 5 changer transitions 0/607 dead transitions. [2025-01-09 21:29:35,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 607 transitions, 2531 flow [2025-01-09 21:29:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:29:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:29:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2324 transitions. [2025-01-09 21:29:35,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7824915824915825 [2025-01-09 21:29:35,197 INFO L175 Difference]: Start difference. First operand has 598 places, 608 transitions, 2315 flow. Second operand 6 states and 2324 transitions. [2025-01-09 21:29:35,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 607 transitions, 2531 flow [2025-01-09 21:29:35,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 607 transitions, 2423 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-01-09 21:29:35,214 INFO L231 Difference]: Finished difference. Result has 584 places, 607 transitions, 2215 flow [2025-01-09 21:29:35,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2215, PETRI_PLACES=584, PETRI_TRANSITIONS=607} [2025-01-09 21:29:35,215 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 107 predicate places. [2025-01-09 21:29:35,215 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 607 transitions, 2215 flow [2025-01-09 21:29:35,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.1666666666667) internal successors, (2275), 6 states have internal predecessors, (2275), 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:29:35,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:35,216 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, 1, 1, 1, 1] [2025-01-09 21:29:35,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:29:35,217 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:35,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:35,223 INFO L85 PathProgramCache]: Analyzing trace with hash -475466756, now seen corresponding path program 1 times [2025-01-09 21:29:35,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:35,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835318178] [2025-01-09 21:29:35,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:35,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:35,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-01-09 21:29:35,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-01-09 21:29:35,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:35,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 58351 backedges. 29861 proven. 13875 refuted. 0 times theorem prover too weak. 14615 trivial. 0 not checked. [2025-01-09 21:29:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835318178] [2025-01-09 21:29:44,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835318178] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:29:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459022190] [2025-01-09 21:29:44,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:44,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:29:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:44,878 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:29:44,879 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:29:45,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2945 statements into 1 equivalence classes. [2025-01-09 21:29:46,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2945 of 2945 statements. [2025-01-09 21:29:46,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:46,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 11747 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:29:46,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:29:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 58351 backedges. 29861 proven. 13875 refuted. 0 times theorem prover too weak. 14615 trivial. 0 not checked. [2025-01-09 21:29:47,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:29:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 58351 backedges. 29861 proven. 13875 refuted. 0 times theorem prover too weak. 14615 trivial. 0 not checked. [2025-01-09 21:29:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459022190] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:29:49,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:29:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-01-09 21:29:49,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591853187] [2025-01-09 21:29:49,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 21:29:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 21:29:49,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 21:29:49,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 495 [2025-01-09 21:29:49,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 607 transitions, 2215 flow. Second operand has 63 states, 63 states have (on average 462.0952380952381) internal successors, (29112), 63 states have internal predecessors, (29112), 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:29:49,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 495 [2025-01-09 21:29:49,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,338 INFO L124 PetriNetUnfolderBase]: 16/8586 cut-off events. [2025-01-09 21:29:58,338 INFO L125 PetriNetUnfolderBase]: For 13376/13377 co-relation queries the response was YES. [2025-01-09 21:29:58,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10501 conditions, 8586 events. 16/8586 cut-off events. For 13376/13377 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1196 event pairs, 8 based on Foata normal form. 45/8605 useless extension candidates. Maximal degree in co-relation 10247. Up to 168 conditions per place. [2025-01-09 21:29:58,350 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 96 selfloop transitions, 270 changer transitions 0/813 dead transitions. [2025-01-09 21:29:58,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 813 transitions, 5133 flow [2025-01-09 21:29:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-01-09 21:29:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-01-09 21:29:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 41551 transitions. [2025-01-09 21:29:58,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.932682379349046 [2025-01-09 21:29:58,368 INFO L175 Difference]: Start difference. First operand has 584 places, 607 transitions, 2215 flow. Second operand 90 states and 41551 transitions. [2025-01-09 21:29:58,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 813 transitions, 5133 flow [2025-01-09 21:29:58,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 813 transitions, 5123 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:29:58,390 INFO L231 Difference]: Finished difference. Result has 684 places, 745 transitions, 4197 flow [2025-01-09 21:29:58,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4197, PETRI_PLACES=684, PETRI_TRANSITIONS=745} [2025-01-09 21:29:58,391 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 207 predicate places. [2025-01-09 21:29:58,391 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 745 transitions, 4197 flow [2025-01-09 21:29:58,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 462.0952380952381) internal successors, (29112), 63 states have internal predecessors, (29112), 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:29:58,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,399 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] [2025-01-09 21:29:58,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:29:58,599 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:29:58,599 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:29:58,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1206966748, now seen corresponding path program 2 times [2025-01-09 21:29:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017162971] [2025-01-09 21:29:58,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:29:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:59,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5645 statements into 2 equivalence classes. [2025-01-09 21:29:59,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 187 of 5645 statements. [2025-01-09 21:29:59,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:29:59,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 235471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235471 trivial. 0 not checked. [2025-01-09 21:29:59,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017162971] [2025-01-09 21:29:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017162971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:59,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:59,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20177365] [2025-01-09 21:29:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:59,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:59,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:59,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:59,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 495 [2025-01-09 21:29:59,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 745 transitions, 4197 flow. Second operand has 6 states, 6 states have (on average 377.8333333333333) internal successors, (2267), 6 states have internal predecessors, (2267), 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:29:59,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:59,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 495 [2025-01-09 21:29:59,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:10,163 INFO L124 PetriNetUnfolderBase]: 740/11147 cut-off events. [2025-01-09 21:30:10,163 INFO L125 PetriNetUnfolderBase]: For 3557/3571 co-relation queries the response was YES. [2025-01-09 21:30:10,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17502 conditions, 11147 events. 740/11147 cut-off events. For 3557/3571 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 22612 event pairs, 317 based on Foata normal form. 4/10904 useless extension candidates. Maximal degree in co-relation 13220. Up to 4141 conditions per place. [2025-01-09 21:30:10,199 INFO L140 encePairwiseOnDemand]: 460/495 looper letters, 143 selfloop transitions, 118 changer transitions 0/894 dead transitions. [2025-01-09 21:30:10,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 894 transitions, 5017 flow [2025-01-09 21:30:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2464 transitions. [2025-01-09 21:30:10,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2025-01-09 21:30:10,202 INFO L175 Difference]: Start difference. First operand has 684 places, 745 transitions, 4197 flow. Second operand 6 states and 2464 transitions. [2025-01-09 21:30:10,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 894 transitions, 5017 flow [2025-01-09 21:30:10,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 894 transitions, 4663 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-01-09 21:30:10,243 INFO L231 Difference]: Finished difference. Result has 652 places, 862 transitions, 4617 flow [2025-01-09 21:30:10,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=3843, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4617, PETRI_PLACES=652, PETRI_TRANSITIONS=862} [2025-01-09 21:30:10,244 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 175 predicate places. [2025-01-09 21:30:10,244 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 862 transitions, 4617 flow [2025-01-09 21:30:10,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.8333333333333) internal successors, (2267), 6 states have internal predecessors, (2267), 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:30:10,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:10,246 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] [2025-01-09 21:30:10,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:10,247 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:30:10,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1512350192, now seen corresponding path program 1 times [2025-01-09 21:30:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:10,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846249653] [2025-01-09 21:30:10,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:10,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5645 statements into 1 equivalence classes. [2025-01-09 21:30:11,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5645 of 5645 statements. [2025-01-09 21:30:11,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:11,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 235892 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235892 trivial. 0 not checked. [2025-01-09 21:30:18,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846249653] [2025-01-09 21:30:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846249653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065094757] [2025-01-09 21:30:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 495 [2025-01-09 21:30:18,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 862 transitions, 4617 flow. Second operand has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 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:30:18,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 495 [2025-01-09 21:30:18,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,062 INFO L124 PetriNetUnfolderBase]: 229/9768 cut-off events. [2025-01-09 21:30:25,062 INFO L125 PetriNetUnfolderBase]: For 3879/3921 co-relation queries the response was YES. [2025-01-09 21:30:25,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12488 conditions, 9768 events. 229/9768 cut-off events. For 3879/3921 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11108 event pairs, 24 based on Foata normal form. 2/9643 useless extension candidates. Maximal degree in co-relation 10099. Up to 340 conditions per place. [2025-01-09 21:30:25,088 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 22 selfloop transitions, 3 changer transitions 0/870 dead transitions. [2025-01-09 21:30:25,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 870 transitions, 4683 flow [2025-01-09 21:30:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1414 transitions. [2025-01-09 21:30:25,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9521885521885521 [2025-01-09 21:30:25,089 INFO L175 Difference]: Start difference. First operand has 652 places, 862 transitions, 4617 flow. Second operand 3 states and 1414 transitions. [2025-01-09 21:30:25,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 870 transitions, 4683 flow [2025-01-09 21:30:25,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 870 transitions, 4683 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:25,120 INFO L231 Difference]: Finished difference. Result has 655 places, 862 transitions, 4628 flow [2025-01-09 21:30:25,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=4617, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4628, PETRI_PLACES=655, PETRI_TRANSITIONS=862} [2025-01-09 21:30:25,121 INFO L279 CegarLoopForPetriNet]: 477 programPoint places, 178 predicate places. [2025-01-09 21:30:25,121 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 862 transitions, 4628 flow [2025-01-09 21:30:25,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 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:30:25,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:25,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:25,123 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:30:25,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash 954246439, now seen corresponding path program 1 times [2025-01-09 21:30:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868001356] [2025-01-09 21:30:25,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5659 statements into 1 equivalence classes. [2025-01-09 21:30:25,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5659 of 5659 statements. [2025-01-09 21:30:25,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat