./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.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 b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:24:11,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:24:11,264 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:24:11,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:24:11,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:24:11,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:24:11,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:24:11,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:24:11,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:24:11,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:24:11,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:24:11,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:24:11,287 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:24:11,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:24:11,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:24:11,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:24:11,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:24:11,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:24:11,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:24:11,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:11,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:11,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:11,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:24:11,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:11,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:11,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:11,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:24:11,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:24:11,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:24:11,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:24:11,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:24:11,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:24:11,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:24:11,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:24:11,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:24:11,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:24:11,290 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 -> b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b [2025-01-09 21:24:11,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:24:11,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:24:11,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:24:11,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:24:11,482 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:24:11,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-01-09 21:24:12,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d6a07e67/1ca12a3eaee44fd49dd04ffd189c7aca/FLAG63039bde4 [2025-01-09 21:24:12,934 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:24:12,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-01-09 21:24:12,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d6a07e67/1ca12a3eaee44fd49dd04ffd189c7aca/FLAG63039bde4 [2025-01-09 21:24:13,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d6a07e67/1ca12a3eaee44fd49dd04ffd189c7aca [2025-01-09 21:24:13,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:24:13,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:24:13,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:13,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:24:13,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:24:13,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1067fd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13, skipping insertion in model container [2025-01-09 21:24:13,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:24:13,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:13,655 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:24:13,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:13,783 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:24:13,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13 WrapperNode [2025-01-09 21:24:13,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:13,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:13,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:24:13,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:24:13,788 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:24:13" (1/1) ... [2025-01-09 21:24:13,803 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:24:13" (1/1) ... [2025-01-09 21:24:13,828 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 414 [2025-01-09 21:24:13,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:13,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:24:13,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:24:13,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:24:13,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:24:13,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:24:13,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:24:13,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:24:13,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (1/1) ... [2025-01-09 21:24:13,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:13,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:13,897 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:24:13,899 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:24:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:24:13,915 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:24:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:24:13,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:24:13,916 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:24:14,037 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:24:14,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:24:14,736 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:24:14,736 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:24:14,786 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:24:14,786 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:24:14,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:14 BoogieIcfgContainer [2025-01-09 21:24:14,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:24:14,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:24:14,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:24:14,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:24:14,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:24:13" (1/3) ... [2025-01-09 21:24:14,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287e0fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:14, skipping insertion in model container [2025-01-09 21:24:14,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:13" (2/3) ... [2025-01-09 21:24:14,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287e0fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:14, skipping insertion in model container [2025-01-09 21:24:14,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:14" (3/3) ... [2025-01-09 21:24:14,800 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-01-09 21:24:14,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:24:14,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.i that has 2 procedures, 485 locations, 1 initial locations, 1 loop locations, and 30 error locations. [2025-01-09 21:24:14,816 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:24:14,931 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:24:14,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 488 places, 488 transitions, 980 flow [2025-01-09 21:24:15,135 INFO L124 PetriNetUnfolderBase]: 4/487 cut-off events. [2025-01-09 21:24:15,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:15,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 487 events. 4/487 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 363 event pairs, 0 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 359. Up to 2 conditions per place. [2025-01-09 21:24:15,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 488 places, 488 transitions, 980 flow [2025-01-09 21:24:15,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 487 transitions, 977 flow [2025-01-09 21:24:15,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:24:15,172 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;@33f6078c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:24:15,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-09 21:24:15,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:24:15,196 INFO L124 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-01-09 21:24:15,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:15,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:15,197 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] [2025-01-09 21:24:15,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:15,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1684636376, now seen corresponding path program 1 times [2025-01-09 21:24:15,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:15,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938612643] [2025-01-09 21:24:15,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:15,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:24:15,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:24:15,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:15,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:16,038 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:24:16,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:16,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938612643] [2025-01-09 21:24:16,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938612643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:16,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007165987] [2025-01-09 21:24:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:16,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:16,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:16,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-01-09 21:24:16,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 487 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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:24:16,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:16,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-01-09 21:24:16,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:17,058 INFO L124 PetriNetUnfolderBase]: 365/1842 cut-off events. [2025-01-09 21:24:17,059 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:24:17,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2708 conditions, 1842 events. 365/1842 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9525 event pairs, 364 based on Foata normal form. 13/1717 useless extension candidates. Maximal degree in co-relation 2256. Up to 842 conditions per place. [2025-01-09 21:24:17,073 INFO L140 encePairwiseOnDemand]: 461/488 looper letters, 113 selfloop transitions, 20 changer transitions 2/480 dead transitions. [2025-01-09 21:24:17,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 480 transitions, 1229 flow [2025-01-09 21:24:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2228 transitions. [2025-01-09 21:24:17,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7609289617486339 [2025-01-09 21:24:17,092 INFO L175 Difference]: Start difference. First operand has 487 places, 487 transitions, 977 flow. Second operand 6 states and 2228 transitions. [2025-01-09 21:24:17,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 480 transitions, 1229 flow [2025-01-09 21:24:17,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 480 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:17,111 INFO L231 Difference]: Finished difference. Result has 487 places, 478 transitions, 998 flow [2025-01-09 21:24:17,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=998, PETRI_PLACES=487, PETRI_TRANSITIONS=478} [2025-01-09 21:24:17,117 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 0 predicate places. [2025-01-09 21:24:17,117 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 478 transitions, 998 flow [2025-01-09 21:24:17,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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:24:17,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:17,119 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] [2025-01-09 21:24:17,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:24:17,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:17,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash 105681652, now seen corresponding path program 1 times [2025-01-09 21:24:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:17,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641675291] [2025-01-09 21:24:17,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:17,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:24:17,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:24:17,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:17,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:17,540 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:24:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:17,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641675291] [2025-01-09 21:24:17,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641675291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:17,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971499352] [2025-01-09 21:24:17,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:17,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:17,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:17,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:18,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-01-09 21:24:18,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 478 transitions, 998 flow. Second operand has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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:24:18,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:18,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-01-09 21:24:18,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:18,605 INFO L124 PetriNetUnfolderBase]: 365/1836 cut-off events. [2025-01-09 21:24:18,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:18,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 1836 events. 365/1836 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9518 event pairs, 364 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2342. Up to 842 conditions per place. [2025-01-09 21:24:18,612 INFO L140 encePairwiseOnDemand]: 464/488 looper letters, 113 selfloop transitions, 20 changer transitions 0/474 dead transitions. [2025-01-09 21:24:18,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 474 transitions, 1256 flow [2025-01-09 21:24:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2225 transitions. [2025-01-09 21:24:18,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599043715846995 [2025-01-09 21:24:18,617 INFO L175 Difference]: Start difference. First operand has 487 places, 478 transitions, 998 flow. Second operand 6 states and 2225 transitions. [2025-01-09 21:24:18,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 474 transitions, 1256 flow [2025-01-09 21:24:18,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 474 transitions, 1216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:18,623 INFO L231 Difference]: Finished difference. Result has 481 places, 474 transitions, 990 flow [2025-01-09 21:24:18,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=481, PETRI_TRANSITIONS=474} [2025-01-09 21:24:18,624 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-01-09 21:24:18,624 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 474 transitions, 990 flow [2025-01-09 21:24:18,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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:24:18,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:18,626 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] [2025-01-09 21:24:18,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:24:18,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:18,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash -710489551, now seen corresponding path program 1 times [2025-01-09 21:24:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:18,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552592748] [2025-01-09 21:24:18,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:18,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:24:18,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:24:18,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:18,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:19,007 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:24:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:19,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552592748] [2025-01-09 21:24:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552592748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:19,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:19,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895207394] [2025-01-09 21:24:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:19,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:19,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:19,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:19,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:19,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 488 [2025-01-09 21:24:19,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 474 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 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:24:19,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:19,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 488 [2025-01-09 21:24:19,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:19,865 INFO L124 PetriNetUnfolderBase]: 391/1924 cut-off events. [2025-01-09 21:24:19,866 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:24:19,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2864 conditions, 1924 events. 391/1924 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10188 event pairs, 390 based on Foata normal form. 0/1787 useless extension candidates. Maximal degree in co-relation 2468. Up to 911 conditions per place. [2025-01-09 21:24:19,875 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 130 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-01-09 21:24:19,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 473 transitions, 1258 flow [2025-01-09 21:24:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2230 transitions. [2025-01-09 21:24:19,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616120218579235 [2025-01-09 21:24:19,881 INFO L175 Difference]: Start difference. First operand has 481 places, 474 transitions, 990 flow. Second operand 6 states and 2230 transitions. [2025-01-09 21:24:19,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 473 transitions, 1258 flow [2025-01-09 21:24:19,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 473 transitions, 1218 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:19,890 INFO L231 Difference]: Finished difference. Result has 480 places, 473 transitions, 958 flow [2025-01-09 21:24:19,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=958, PETRI_PLACES=480, PETRI_TRANSITIONS=473} [2025-01-09 21:24:19,891 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -7 predicate places. [2025-01-09 21:24:19,892 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 473 transitions, 958 flow [2025-01-09 21:24:19,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 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:24:19,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:19,893 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] [2025-01-09 21:24:19,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:24:19,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:19,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash -948055330, now seen corresponding path program 1 times [2025-01-09 21:24:19,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:19,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665752816] [2025-01-09 21:24:19,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:19,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:24:19,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:24:19,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:19,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:20,013 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:24:20,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:20,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665752816] [2025-01-09 21:24:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665752816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:24:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322003773] [2025-01-09 21:24:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:20,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:24:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:20,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:24:20,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:24:20,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 488 [2025-01-09 21:24:20,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 473 transitions, 958 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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:24:20,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:20,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 488 [2025-01-09 21:24:20,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:20,088 INFO L124 PetriNetUnfolderBase]: 7/658 cut-off events. [2025-01-09 21:24:20,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:20,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 658 events. 7/658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 633 event pairs, 6 based on Foata normal form. 1/623 useless extension candidates. Maximal degree in co-relation 496. Up to 24 conditions per place. [2025-01-09 21:24:20,090 INFO L140 encePairwiseOnDemand]: 485/488 looper letters, 10 selfloop transitions, 2 changer transitions 0/474 dead transitions. [2025-01-09 21:24:20,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 474 transitions, 984 flow [2025-01-09 21:24:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:24:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:24:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2025-01-09 21:24:20,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.980191256830601 [2025-01-09 21:24:20,093 INFO L175 Difference]: Start difference. First operand has 480 places, 473 transitions, 958 flow. Second operand 3 states and 1435 transitions. [2025-01-09 21:24:20,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 474 transitions, 984 flow [2025-01-09 21:24:20,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 474 transitions, 974 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:20,100 INFO L231 Difference]: Finished difference. Result has 478 places, 474 transitions, 960 flow [2025-01-09 21:24:20,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=478, PETRI_TRANSITIONS=474} [2025-01-09 21:24:20,101 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-01-09 21:24:20,101 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 474 transitions, 960 flow [2025-01-09 21:24:20,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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:24:20,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:20,102 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] [2025-01-09 21:24:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:24:20,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 177590593, now seen corresponding path program 1 times [2025-01-09 21:24:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:20,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128591202] [2025-01-09 21:24:20,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:20,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 21:24:20,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 21:24:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:20,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128591202] [2025-01-09 21:24:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128591202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939672863] [2025-01-09 21:24:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:20,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:20,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:20,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:21,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 488 [2025-01-09 21:24:21,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 474 transitions, 960 flow. Second operand has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 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:24:21,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:21,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 488 [2025-01-09 21:24:21,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:21,420 INFO L124 PetriNetUnfolderBase]: 55/899 cut-off events. [2025-01-09 21:24:21,420 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:24:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 899 events. 55/899 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2268 event pairs, 54 based on Foata normal form. 0/839 useless extension candidates. Maximal degree in co-relation 924. Up to 227 conditions per place. [2025-01-09 21:24:21,423 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 89 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-01-09 21:24:21,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 473 transitions, 1146 flow [2025-01-09 21:24:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2440 transitions. [2025-01-09 21:24:21,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-01-09 21:24:21,427 INFO L175 Difference]: Start difference. First operand has 478 places, 474 transitions, 960 flow. Second operand 6 states and 2440 transitions. [2025-01-09 21:24:21,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 473 transitions, 1146 flow [2025-01-09 21:24:21,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 473 transitions, 1144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:21,432 INFO L231 Difference]: Finished difference. Result has 481 places, 473 transitions, 966 flow [2025-01-09 21:24:21,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=966, PETRI_PLACES=481, PETRI_TRANSITIONS=473} [2025-01-09 21:24:21,433 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-01-09 21:24:21,433 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 473 transitions, 966 flow [2025-01-09 21:24:21,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 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:24:21,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:21,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:21,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:24:21,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:21,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash 351751304, now seen corresponding path program 1 times [2025-01-09 21:24:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439050392] [2025-01-09 21:24:21,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:21,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:24:21,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:24:21,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:21,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:21,763 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:24:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439050392] [2025-01-09 21:24:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439050392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981717570] [2025-01-09 21:24:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:21,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:21,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:22,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 488 [2025-01-09 21:24:22,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 473 transitions, 966 flow. Second operand has 6 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 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:24:22,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:22,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 488 [2025-01-09 21:24:22,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:22,624 INFO L124 PetriNetUnfolderBase]: 37/812 cut-off events. [2025-01-09 21:24:22,624 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:24:22,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 812 events. 37/812 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1739 event pairs, 36 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 792. Up to 198 conditions per place. [2025-01-09 21:24:22,627 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 93 selfloop transitions, 15 changer transitions 0/470 dead transitions. [2025-01-09 21:24:22,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 470 transitions, 1176 flow [2025-01-09 21:24:22,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2355 transitions. [2025-01-09 21:24:22,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8043032786885246 [2025-01-09 21:24:22,631 INFO L175 Difference]: Start difference. First operand has 481 places, 473 transitions, 966 flow. Second operand 6 states and 2355 transitions. [2025-01-09 21:24:22,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 470 transitions, 1176 flow [2025-01-09 21:24:22,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 470 transitions, 1166 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:22,638 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 980 flow [2025-01-09 21:24:22,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=478, PETRI_TRANSITIONS=470} [2025-01-09 21:24:22,641 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-01-09 21:24:22,641 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 980 flow [2025-01-09 21:24:22,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 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:24:22,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:22,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:22,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:24:22,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:22,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -25729275, now seen corresponding path program 1 times [2025-01-09 21:24:22,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:22,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255552507] [2025-01-09 21:24:22,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:22,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:24:22,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:24:22,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:22,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:23,105 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:24:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255552507] [2025-01-09 21:24:23,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255552507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:23,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:23,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996373595] [2025-01-09 21:24:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:23,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:23,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:23,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:23,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 488 [2025-01-09 21:24:23,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 470 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 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:24:23,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:23,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 488 [2025-01-09 21:24:23,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:24,009 INFO L124 PetriNetUnfolderBase]: 365/1934 cut-off events. [2025-01-09 21:24:24,010 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:24:24,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 1934 events. 365/1934 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9512 event pairs, 364 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2494. Up to 898 conditions per place. [2025-01-09 21:24:24,017 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 131 selfloop transitions, 15 changer transitions 0/467 dead transitions. [2025-01-09 21:24:24,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 467 transitions, 1266 flow [2025-01-09 21:24:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2165 transitions. [2025-01-09 21:24:24,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7394125683060109 [2025-01-09 21:24:24,022 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 980 flow. Second operand 6 states and 2165 transitions. [2025-01-09 21:24:24,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 467 transitions, 1266 flow [2025-01-09 21:24:24,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 467 transitions, 1236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:24,028 INFO L231 Difference]: Finished difference. Result has 475 places, 467 transitions, 974 flow [2025-01-09 21:24:24,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=974, PETRI_PLACES=475, PETRI_TRANSITIONS=467} [2025-01-09 21:24:24,031 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -12 predicate places. [2025-01-09 21:24:24,031 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 467 transitions, 974 flow [2025-01-09 21:24:24,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 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:24:24,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:24,032 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] [2025-01-09 21:24:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:24:24,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2014753825, now seen corresponding path program 1 times [2025-01-09 21:24:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693472811] [2025-01-09 21:24:24,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:24,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:24:24,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:24:24,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:24,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:24,416 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:24:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693472811] [2025-01-09 21:24:24,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693472811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:24,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:24,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260111266] [2025-01-09 21:24:24,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:24,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:24,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:24,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:24,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 488 [2025-01-09 21:24:24,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 467 transitions, 974 flow. Second operand has 6 states, 6 states have (on average 345.6666666666667) internal successors, (2074), 6 states have internal predecessors, (2074), 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:24:24,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:24,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 488 [2025-01-09 21:24:24,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:25,256 INFO L124 PetriNetUnfolderBase]: 365/1930 cut-off events. [2025-01-09 21:24:25,256 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:24:25,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 1930 events. 365/1930 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9500 event pairs, 364 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2490. Up to 894 conditions per place. [2025-01-09 21:24:25,261 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 128 selfloop transitions, 15 changer transitions 0/464 dead transitions. [2025-01-09 21:24:25,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 464 transitions, 1254 flow [2025-01-09 21:24:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2180 transitions. [2025-01-09 21:24:25,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.744535519125683 [2025-01-09 21:24:25,265 INFO L175 Difference]: Start difference. First operand has 475 places, 467 transitions, 974 flow. Second operand 6 states and 2180 transitions. [2025-01-09 21:24:25,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 464 transitions, 1254 flow [2025-01-09 21:24:25,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 464 transitions, 1224 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:25,272 INFO L231 Difference]: Finished difference. Result has 472 places, 464 transitions, 968 flow [2025-01-09 21:24:25,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=968, PETRI_PLACES=472, PETRI_TRANSITIONS=464} [2025-01-09 21:24:25,273 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -15 predicate places. [2025-01-09 21:24:25,273 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 464 transitions, 968 flow [2025-01-09 21:24:25,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 345.6666666666667) internal successors, (2074), 6 states have internal predecessors, (2074), 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:24:25,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:25,275 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] [2025-01-09 21:24:25,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:24:25,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:25,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1200167647, now seen corresponding path program 1 times [2025-01-09 21:24:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:25,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754079839] [2025-01-09 21:24:25,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:25,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 21:24:25,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 21:24:25,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:25,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754079839] [2025-01-09 21:24:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754079839] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599602463] [2025-01-09 21:24:25,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:25,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:25,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:25,454 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:24:25,457 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:24:25,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 21:24:25,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 21:24:25,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:25,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:25,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:24:25,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:25,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:24:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599602463] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:26,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:26,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:24:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489834687] [2025-01-09 21:24:26,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:26,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:24:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:26,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:24:26,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:24:26,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-01-09 21:24:26,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 464 transitions, 968 flow. Second operand has 10 states, 10 states have (on average 472.8) internal successors, (4728), 10 states have internal predecessors, (4728), 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:24:26,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:26,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-01-09 21:24:26,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:26,311 INFO L124 PetriNetUnfolderBase]: 7/752 cut-off events. [2025-01-09 21:24:26,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:26,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 752 events. 7/752 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 387 event pairs, 6 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 394. Up to 24 conditions per place. [2025-01-09 21:24:26,313 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 14 selfloop transitions, 9 changer transitions 0/472 dead transitions. [2025-01-09 21:24:26,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 472 transitions, 1032 flow [2025-01-09 21:24:26,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:24:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:24:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4264 transitions. [2025-01-09 21:24:26,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.970856102003643 [2025-01-09 21:24:26,319 INFO L175 Difference]: Start difference. First operand has 472 places, 464 transitions, 968 flow. Second operand 9 states and 4264 transitions. [2025-01-09 21:24:26,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 472 transitions, 1032 flow [2025-01-09 21:24:26,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 472 transitions, 1002 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:26,324 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 988 flow [2025-01-09 21:24:26,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=988, PETRI_PLACES=478, PETRI_TRANSITIONS=470} [2025-01-09 21:24:26,326 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-01-09 21:24:26,326 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 988 flow [2025-01-09 21:24:26,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 472.8) internal successors, (4728), 10 states have internal predecessors, (4728), 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:24:26,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:26,329 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, 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] [2025-01-09 21:24:26,339 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:24:26,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:26,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:26,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:26,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1820236185, now seen corresponding path program 2 times [2025-01-09 21:24:26,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:26,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170206703] [2025-01-09 21:24:26,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:26,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:26,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 446 statements into 2 equivalence classes. [2025-01-09 21:24:26,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 446 statements. [2025-01-09 21:24:26,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:26,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 21:24:26,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:26,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170206703] [2025-01-09 21:24:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170206703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:26,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:26,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809799981] [2025-01-09 21:24:26,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:26,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:26,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:26,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:27,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 488 [2025-01-09 21:24:27,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 470 transitions, 988 flow. Second operand has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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:24:27,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:27,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 488 [2025-01-09 21:24:27,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:27,974 INFO L124 PetriNetUnfolderBase]: 257/2078 cut-off events. [2025-01-09 21:24:27,974 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:24:27,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2078 events. 257/2078 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10232 event pairs, 36 based on Foata normal form. 0/1951 useless extension candidates. Maximal degree in co-relation 2279. Up to 523 conditions per place. [2025-01-09 21:24:27,980 INFO L140 encePairwiseOnDemand]: 459/488 looper letters, 99 selfloop transitions, 75 changer transitions 0/547 dead transitions. [2025-01-09 21:24:27,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 547 transitions, 1490 flow [2025-01-09 21:24:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2504 transitions. [2025-01-09 21:24:27,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.855191256830601 [2025-01-09 21:24:27,985 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 988 flow. Second operand 6 states and 2504 transitions. [2025-01-09 21:24:27,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 547 transitions, 1490 flow [2025-01-09 21:24:27,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 547 transitions, 1484 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:27,993 INFO L231 Difference]: Finished difference. Result has 486 places, 538 transitions, 1462 flow [2025-01-09 21:24:27,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=486, PETRI_TRANSITIONS=538} [2025-01-09 21:24:27,994 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -1 predicate places. [2025-01-09 21:24:27,994 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 538 transitions, 1462 flow [2025-01-09 21:24:27,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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:24:27,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:27,995 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, 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] [2025-01-09 21:24:27,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:24:27,995 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:27,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1970437980, now seen corresponding path program 1 times [2025-01-09 21:24:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:27,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716985694] [2025-01-09 21:24:27,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:28,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-01-09 21:24:28,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-01-09 21:24:28,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:28,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716985694] [2025-01-09 21:24:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716985694] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686424246] [2025-01-09 21:24:28,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:28,520 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:24:28,524 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:24:28,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-01-09 21:24:28,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-01-09 21:24:28,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:28,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:28,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:24:28,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:29,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:24:29,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686424246] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:29,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:29,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:24:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641150684] [2025-01-09 21:24:29,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:29,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:24:29,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:29,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:24:29,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:24:29,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-01-09 21:24:29,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 538 transitions, 1462 flow. Second operand has 18 states, 18 states have (on average 472.8888888888889) internal successors, (8512), 18 states have internal predecessors, (8512), 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:24:29,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:29,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-01-09 21:24:29,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:30,173 INFO L124 PetriNetUnfolderBase]: 120/2148 cut-off events. [2025-01-09 21:24:30,174 INFO L125 PetriNetUnfolderBase]: For 184/204 co-relation queries the response was YES. [2025-01-09 21:24:30,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2823 conditions, 2148 events. 120/2148 cut-off events. For 184/204 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7282 event pairs, 21 based on Foata normal form. 4/2064 useless extension candidates. Maximal degree in co-relation 1926. Up to 207 conditions per place. [2025-01-09 21:24:30,180 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 19 selfloop transitions, 21 changer transitions 0/556 dead transitions. [2025-01-09 21:24:30,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 556 transitions, 1630 flow [2025-01-09 21:24:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:24:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:24:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9934 transitions. [2025-01-09 21:24:30,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96935987509758 [2025-01-09 21:24:30,189 INFO L175 Difference]: Start difference. First operand has 486 places, 538 transitions, 1462 flow. Second operand 21 states and 9934 transitions. [2025-01-09 21:24:30,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 556 transitions, 1630 flow [2025-01-09 21:24:30,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 556 transitions, 1630 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:30,197 INFO L231 Difference]: Finished difference. Result has 511 places, 551 transitions, 1592 flow [2025-01-09 21:24:30,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1592, PETRI_PLACES=511, PETRI_TRANSITIONS=551} [2025-01-09 21:24:30,198 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 24 predicate places. [2025-01-09 21:24:30,198 INFO L471 AbstractCegarLoop]: Abstraction has has 511 places, 551 transitions, 1592 flow [2025-01-09 21:24:30,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 472.8888888888889) internal successors, (8512), 18 states have internal predecessors, (8512), 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:24:30,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:30,201 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:30,209 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:24:30,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:30,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:30,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1861836312, now seen corresponding path program 2 times [2025-01-09 21:24:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:30,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588941844] [2025-01-09 21:24:30,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:30,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:30,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 936 statements into 2 equivalence classes. [2025-01-09 21:24:30,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 194 of 936 statements. [2025-01-09 21:24:30,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:30,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2282 trivial. 0 not checked. [2025-01-09 21:24:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588941844] [2025-01-09 21:24:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588941844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:30,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:30,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:30,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50559812] [2025-01-09 21:24:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:30,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:30,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:30,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:31,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-01-09 21:24:31,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 551 transitions, 1592 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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:24:31,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:31,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-01-09 21:24:31,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:32,077 INFO L124 PetriNetUnfolderBase]: 182/2312 cut-off events. [2025-01-09 21:24:32,078 INFO L125 PetriNetUnfolderBase]: For 454/488 co-relation queries the response was YES. [2025-01-09 21:24:32,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 2312 events. 182/2312 cut-off events. For 454/488 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9089 event pairs, 54 based on Foata normal form. 0/2210 useless extension candidates. Maximal degree in co-relation 2480. Up to 572 conditions per place. [2025-01-09 21:24:32,087 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 150 selfloop transitions, 5 changer transitions 0/550 dead transitions. [2025-01-09 21:24:32,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 550 transitions, 1900 flow [2025-01-09 21:24:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2455 transitions. [2025-01-09 21:24:32,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384562841530054 [2025-01-09 21:24:32,090 INFO L175 Difference]: Start difference. First operand has 511 places, 551 transitions, 1592 flow. Second operand 6 states and 2455 transitions. [2025-01-09 21:24:32,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 550 transitions, 1900 flow [2025-01-09 21:24:32,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 550 transitions, 1876 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:24:32,099 INFO L231 Difference]: Finished difference. Result has 509 places, 550 transitions, 1576 flow [2025-01-09 21:24:32,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1576, PETRI_PLACES=509, PETRI_TRANSITIONS=550} [2025-01-09 21:24:32,100 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 22 predicate places. [2025-01-09 21:24:32,100 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 550 transitions, 1576 flow [2025-01-09 21:24:32,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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:24:32,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:32,101 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:32,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:24:32,101 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:32,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 42095620, now seen corresponding path program 1 times [2025-01-09 21:24:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936474845] [2025-01-09 21:24:32,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:32,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-01-09 21:24:32,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-01-09 21:24:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:33,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:33,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936474845] [2025-01-09 21:24:33,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936474845] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:33,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596596797] [2025-01-09 21:24:33,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:33,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:33,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:33,400 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:24:33,401 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:24:33,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-01-09 21:24:34,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-01-09 21:24:34,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:34,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:34,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 3788 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:24:34,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:34,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 21:24:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596596797] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:35,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:35,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:24:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169878263] [2025-01-09 21:24:35,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:35,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:24:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:35,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:24:35,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:24:35,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-01-09 21:24:35,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 550 transitions, 1576 flow. Second operand has 23 states, 23 states have (on average 473.0869565217391) internal successors, (10881), 23 states have internal predecessors, (10881), 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:24:35,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:35,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-01-09 21:24:35,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:36,519 INFO L124 PetriNetUnfolderBase]: 120/2465 cut-off events. [2025-01-09 21:24:36,519 INFO L125 PetriNetUnfolderBase]: For 301/321 co-relation queries the response was YES. [2025-01-09 21:24:36,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 2465 events. 120/2465 cut-off events. For 301/321 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7265 event pairs, 21 based on Foata normal form. 3/2381 useless extension candidates. Maximal degree in co-relation 1937. Up to 207 conditions per place. [2025-01-09 21:24:36,528 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 22 selfloop transitions, 30 changer transitions 0/567 dead transitions. [2025-01-09 21:24:36,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 567 transitions, 1802 flow [2025-01-09 21:24:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:24:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:24:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 14184 transitions. [2025-01-09 21:24:36,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688524590163935 [2025-01-09 21:24:36,538 INFO L175 Difference]: Start difference. First operand has 509 places, 550 transitions, 1576 flow. Second operand 30 states and 14184 transitions. [2025-01-09 21:24:36,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 567 transitions, 1802 flow [2025-01-09 21:24:36,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 567 transitions, 1792 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:36,548 INFO L231 Difference]: Finished difference. Result has 537 places, 560 transitions, 1718 flow [2025-01-09 21:24:36,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1718, PETRI_PLACES=537, PETRI_TRANSITIONS=560} [2025-01-09 21:24:36,550 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 50 predicate places. [2025-01-09 21:24:36,550 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 560 transitions, 1718 flow [2025-01-09 21:24:36,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 473.0869565217391) internal successors, (10881), 23 states have internal predecessors, (10881), 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:24:36,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:36,553 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:36,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:24:36,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:36,754 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:36,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1887765797, now seen corresponding path program 2 times [2025-01-09 21:24:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:36,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872782967] [2025-01-09 21:24:36,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:36,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1305 statements into 2 equivalence classes. [2025-01-09 21:24:36,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 245 of 1305 statements. [2025-01-09 21:24:36,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:36,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4880 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4880 trivial. 0 not checked. [2025-01-09 21:24:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:37,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872782967] [2025-01-09 21:24:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872782967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:37,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:37,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199170405] [2025-01-09 21:24:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:37,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:37,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:37,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:37,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:37,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-01-09 21:24:37,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 560 transitions, 1718 flow. Second operand has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 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:24:37,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:37,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-01-09 21:24:37,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:38,812 INFO L124 PetriNetUnfolderBase]: 500/3534 cut-off events. [2025-01-09 21:24:38,813 INFO L125 PetriNetUnfolderBase]: For 951/1034 co-relation queries the response was YES. [2025-01-09 21:24:38,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5992 conditions, 3534 events. 500/3534 cut-off events. For 951/1034 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16108 event pairs, 92 based on Foata normal form. 16/3393 useless extension candidates. Maximal degree in co-relation 4427. Up to 1097 conditions per place. [2025-01-09 21:24:38,825 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 163 selfloop transitions, 130 changer transitions 0/697 dead transitions. [2025-01-09 21:24:38,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 697 transitions, 2954 flow [2025-01-09 21:24:38,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2533 transitions. [2025-01-09 21:24:38,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650956284153005 [2025-01-09 21:24:38,827 INFO L175 Difference]: Start difference. First operand has 537 places, 560 transitions, 1718 flow. Second operand 6 states and 2533 transitions. [2025-01-09 21:24:38,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 697 transitions, 2954 flow [2025-01-09 21:24:38,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 697 transitions, 2908 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-01-09 21:24:38,837 INFO L231 Difference]: Finished difference. Result has 529 places, 689 transitions, 2900 flow [2025-01-09 21:24:38,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2900, PETRI_PLACES=529, PETRI_TRANSITIONS=689} [2025-01-09 21:24:38,838 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 42 predicate places. [2025-01-09 21:24:38,838 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 689 transitions, 2900 flow [2025-01-09 21:24:38,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 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:24:38,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:38,839 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:38,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:24:38,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:38,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash 585752533, now seen corresponding path program 1 times [2025-01-09 21:24:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:38,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799553191] [2025-01-09 21:24:38,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:38,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1315 statements into 1 equivalence classes. [2025-01-09 21:24:39,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1315 of 1315 statements. [2025-01-09 21:24:39,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:39,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 21:24:41,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799553191] [2025-01-09 21:24:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799553191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:41,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:41,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542981072] [2025-01-09 21:24:41,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:41,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:41,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:41,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:42,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 488 [2025-01-09 21:24:42,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 689 transitions, 2900 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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:24:42,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:42,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 488 [2025-01-09 21:24:42,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:43,856 INFO L124 PetriNetUnfolderBase]: 776/4305 cut-off events. [2025-01-09 21:24:43,856 INFO L125 PetriNetUnfolderBase]: For 3369/3576 co-relation queries the response was YES. [2025-01-09 21:24:43,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8856 conditions, 4305 events. 776/4305 cut-off events. For 3369/3576 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22163 event pairs, 65 based on Foata normal form. 52/4192 useless extension candidates. Maximal degree in co-relation 7308. Up to 1357 conditions per place. [2025-01-09 21:24:43,872 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 285 selfloop transitions, 131 changer transitions 5/827 dead transitions. [2025-01-09 21:24:43,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 827 transitions, 4642 flow [2025-01-09 21:24:43,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2524 transitions. [2025-01-09 21:24:43,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8620218579234973 [2025-01-09 21:24:43,875 INFO L175 Difference]: Start difference. First operand has 529 places, 689 transitions, 2900 flow. Second operand 6 states and 2524 transitions. [2025-01-09 21:24:43,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 827 transitions, 4642 flow [2025-01-09 21:24:43,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 827 transitions, 4642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:43,889 INFO L231 Difference]: Finished difference. Result has 539 places, 817 transitions, 4380 flow [2025-01-09 21:24:43,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=2900, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4380, PETRI_PLACES=539, PETRI_TRANSITIONS=817} [2025-01-09 21:24:43,891 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 52 predicate places. [2025-01-09 21:24:43,891 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 817 transitions, 4380 flow [2025-01-09 21:24:43,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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:24:43,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:43,892 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:43,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:24:43,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1292764922, now seen corresponding path program 1 times [2025-01-09 21:24:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:43,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371997175] [2025-01-09 21:24:43,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:44,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1316 statements into 1 equivalence classes. [2025-01-09 21:24:44,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1316 of 1316 statements. [2025-01-09 21:24:44,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:44,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 21:24:46,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:46,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371997175] [2025-01-09 21:24:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371997175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247110758] [2025-01-09 21:24:46,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:46,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:46,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:47,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 488 [2025-01-09 21:24:47,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 817 transitions, 4380 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:24:47,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:47,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 488 [2025-01-09 21:24:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:48,915 INFO L124 PetriNetUnfolderBase]: 1308/5703 cut-off events. [2025-01-09 21:24:48,915 INFO L125 PetriNetUnfolderBase]: For 4874/4931 co-relation queries the response was YES. [2025-01-09 21:24:48,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13640 conditions, 5703 events. 1308/5703 cut-off events. For 4874/4931 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33862 event pairs, 369 based on Foata normal form. 11/5469 useless extension candidates. Maximal degree in co-relation 12008. Up to 2597 conditions per place. [2025-01-09 21:24:48,940 INFO L140 encePairwiseOnDemand]: 469/488 looper letters, 364 selfloop transitions, 84 changer transitions 0/896 dead transitions. [2025-01-09 21:24:48,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 896 transitions, 5674 flow [2025-01-09 21:24:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2332 transitions. [2025-01-09 21:24:48,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796448087431694 [2025-01-09 21:24:48,944 INFO L175 Difference]: Start difference. First operand has 539 places, 817 transitions, 4380 flow. Second operand 6 states and 2332 transitions. [2025-01-09 21:24:48,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 896 transitions, 5674 flow [2025-01-09 21:24:48,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 896 transitions, 5420 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:48,964 INFO L231 Difference]: Finished difference. Result has 548 places, 888 transitions, 4916 flow [2025-01-09 21:24:48,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4916, PETRI_PLACES=548, PETRI_TRANSITIONS=888} [2025-01-09 21:24:48,965 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 61 predicate places. [2025-01-09 21:24:48,965 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 888 transitions, 4916 flow [2025-01-09 21:24:48,965 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:24:48,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:48,966 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:48,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:24:48,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:24:48,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash 710380626, now seen corresponding path program 1 times [2025-01-09 21:24:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378011482] [2025-01-09 21:24:48,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:49,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-01-09 21:24:52,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-01-09 21:24:52,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:52,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1 proven. 1585 refuted. 0 times theorem prover too weak. 3314 trivial. 0 not checked. [2025-01-09 21:25:07,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:07,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378011482] [2025-01-09 21:25:07,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378011482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:07,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939090183] [2025-01-09 21:25:07,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:07,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:07,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:07,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:25:07,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:25:08,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-01-09 21:25:08,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-01-09 21:25:08,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:08,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:08,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-01-09 21:25:08,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:09,090 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:25:09,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 21:25:09,241 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:25:09,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 21:25:09,503 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:25:09,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 21:25:09,633 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:25:09,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 21:25:09,863 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 21:25:09,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 21:25:10,261 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-01-09 21:25:10,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-01-09 21:25:11,301 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-01-09 21:25:11,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-01-09 21:25:12,128 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:12,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:13,569 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:13,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:14,356 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:14,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:15,632 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:15,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:16,370 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-01-09 21:25:16,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-01-09 21:25:17,999 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:18,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:18,774 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:18,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:20,177 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:20,820 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-01-09 21:25:20,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-01-09 21:25:23,105 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-01-09 21:25:23,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-01-09 21:25:24,246 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-01-09 21:25:24,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-01-09 21:25:26,490 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2025-01-09 21:25:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 46 [2025-01-09 21:25:27,808 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-01-09 21:25:27,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-01-09 21:25:30,828 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-01-09 21:25:30,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-01-09 21:25:32,994 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-01-09 21:25:32,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-01-09 21:25:35,595 INFO L349 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-01-09 21:25:35,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 39 [2025-01-09 21:25:35,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 21:25:35,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 21:25:35,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:25:35,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-01-09 21:25:35,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:25:35,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-01-09 21:25:35,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2025-01-09 21:25:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3689 proven. 172 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2025-01-09 21:25:35,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:35,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0)) 0)))) is different from false [2025-01-09 21:25:35,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ |c_~#slot~0.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1)) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) .cse2) 0)) (forall ((v_ArrVal_12033 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12033) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1)) 0)))))) is different from false