./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --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/weaver/popl20-queue-add-3.wvr.c -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 d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:53,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:53,907 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:33:53,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:53,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:53,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:53,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:53,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:53,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:53,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:53,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:53,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:53,948 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:53,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:53,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:53,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:53,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:53,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:53,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:53,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:53,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:53,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:53,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:53,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:53,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:53,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:53,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:53,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:53,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:53,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:53,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:53,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:53,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:53,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:53,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:53,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:53,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:53,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:53,953 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 -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2025-01-09 21:33:54,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:54,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:54,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:54,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:54,279 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:54,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-01-09 21:33:55,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6648a131a/0b3934244fa748d687b75c40de4c53d3/FLAG73427ce4b [2025-01-09 21:33:55,902 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:55,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-01-09 21:33:55,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6648a131a/0b3934244fa748d687b75c40de4c53d3/FLAG73427ce4b [2025-01-09 21:33:55,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6648a131a/0b3934244fa748d687b75c40de4c53d3 [2025-01-09 21:33:55,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:55,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:55,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:55,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:55,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:55,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:55" (1/1) ... [2025-01-09 21:33:55,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af641cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:55, skipping insertion in model container [2025-01-09 21:33:55,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:55" (1/1) ... [2025-01-09 21:33:55,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:56,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:56,173 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:56,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:56,236 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:56,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56 WrapperNode [2025-01-09 21:33:56,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:56,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:56,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:56,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:56,245 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:33:56" (1/1) ... [2025-01-09 21:33:56,255 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:33:56" (1/1) ... [2025-01-09 21:33:56,294 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 447 [2025-01-09 21:33:56,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:56,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:56,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:56,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:56,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:56,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:56,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:56,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:56,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (1/1) ... [2025-01-09 21:33:56,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:56,410 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:33:56,413 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:33:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:56,439 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:33:56,558 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:56,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:57,280 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:57,280 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:57,700 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:57,700 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:57,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:57 BoogieIcfgContainer [2025-01-09 21:33:57,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:57,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:57,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:57,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:57,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:55" (1/3) ... [2025-01-09 21:33:57,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e93ae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:57, skipping insertion in model container [2025-01-09 21:33:57,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:56" (2/3) ... [2025-01-09 21:33:57,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e93ae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:57, skipping insertion in model container [2025-01-09 21:33:57,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:57" (3/3) ... [2025-01-09 21:33:57,715 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-01-09 21:33:57,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:57,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 336 locations, 1 initial locations, 5 loop locations, and 67 error locations. [2025-01-09 21:33:57,732 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:57,886 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:57,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 345 places, 349 transitions, 719 flow [2025-01-09 21:33:58,026 INFO L124 PetriNetUnfolderBase]: 14/346 cut-off events. [2025-01-09 21:33:58,029 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:58,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 346 events. 14/346 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 513 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 295. Up to 2 conditions per place. [2025-01-09 21:33:58,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 345 places, 349 transitions, 719 flow [2025-01-09 21:33:58,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 329 transitions, 676 flow [2025-01-09 21:33:58,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:58,079 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;@5a9d24e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:58,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2025-01-09 21:33:58,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:58,090 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-01-09 21:33:58,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:58,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,091 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] [2025-01-09 21:33:58,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:58,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash 997521166, now seen corresponding path program 1 times [2025-01-09 21:33:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839077037] [2025-01-09 21:33:58,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:33:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:33:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,287 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:33:58,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839077037] [2025-01-09 21:33:58,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839077037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337827856] [2025-01-09 21:33:58,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:58,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:58,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 349 [2025-01-09 21:33:58,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 329 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:33:58,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 349 [2025-01-09 21:33:58,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,621 INFO L124 PetriNetUnfolderBase]: 78/595 cut-off events. [2025-01-09 21:33:58,622 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-09 21:33:58,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 595 events. 78/595 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2242 event pairs, 51 based on Foata normal form. 5/513 useless extension candidates. Maximal degree in co-relation 498. Up to 128 conditions per place. [2025-01-09 21:33:58,632 INFO L140 encePairwiseOnDemand]: 294/349 looper letters, 17 selfloop transitions, 2 changer transitions 5/276 dead transitions. [2025-01-09 21:33:58,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 276 transitions, 608 flow [2025-01-09 21:33:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2025-01-09 21:33:58,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8538681948424068 [2025-01-09 21:33:58,656 INFO L175 Difference]: Start difference. First operand has 326 places, 329 transitions, 676 flow. Second operand 3 states and 894 transitions. [2025-01-09 21:33:58,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 276 transitions, 608 flow [2025-01-09 21:33:58,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 276 transitions, 596 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:58,673 INFO L231 Difference]: Finished difference. Result has 277 places, 271 transitions, 552 flow [2025-01-09 21:33:58,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=277, PETRI_TRANSITIONS=271} [2025-01-09 21:33:58,680 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -49 predicate places. [2025-01-09 21:33:58,682 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 271 transitions, 552 flow [2025-01-09 21:33:58,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:33:58,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,684 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] [2025-01-09 21:33:58,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:58,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:58,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash 829183485, now seen corresponding path program 1 times [2025-01-09 21:33:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902428489] [2025-01-09 21:33:58,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:33:58,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:33:58,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,759 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:33:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902428489] [2025-01-09 21:33:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902428489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152271834] [2025-01-09 21:33:58,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:58,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:58,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:58,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:58,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-01-09 21:33:58,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:58,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:58,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-01-09 21:33:58,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,915 INFO L124 PetriNetUnfolderBase]: 72/540 cut-off events. [2025-01-09 21:33:58,915 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:58,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 540 events. 72/540 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1875 event pairs, 38 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 632. Up to 109 conditions per place. [2025-01-09 21:33:58,922 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 15 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-01-09 21:33:58,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 270 transitions, 584 flow [2025-01-09 21:33:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-01-09 21:33:58,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8080229226361032 [2025-01-09 21:33:58,925 INFO L175 Difference]: Start difference. First operand has 277 places, 271 transitions, 552 flow. Second operand 3 states and 846 transitions. [2025-01-09 21:33:58,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 270 transitions, 584 flow [2025-01-09 21:33:58,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 270 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:58,935 INFO L231 Difference]: Finished difference. Result has 271 places, 270 transitions, 550 flow [2025-01-09 21:33:58,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=271, PETRI_TRANSITIONS=270} [2025-01-09 21:33:58,936 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -55 predicate places. [2025-01-09 21:33:58,937 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 550 flow [2025-01-09 21:33:58,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:58,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:58,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:58,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:58,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:58,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash 607947087, now seen corresponding path program 1 times [2025-01-09 21:33:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710025148] [2025-01-09 21:33:58,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:58,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:33:58,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:33:58,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:58,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:58,999 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:33:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710025148] [2025-01-09 21:33:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710025148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58006532] [2025-01-09 21:33:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-01-09 21:33:59,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 270 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:59,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-01-09 21:33:59,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,164 INFO L124 PetriNetUnfolderBase]: 72/539 cut-off events. [2025-01-09 21:33:59,164 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:59,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 539 events. 72/539 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1867 event pairs, 38 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 623. Up to 109 conditions per place. [2025-01-09 21:33:59,168 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 15 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-01-09 21:33:59,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 269 transitions, 582 flow [2025-01-09 21:33:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-01-09 21:33:59,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8080229226361032 [2025-01-09 21:33:59,188 INFO L175 Difference]: Start difference. First operand has 271 places, 270 transitions, 550 flow. Second operand 3 states and 846 transitions. [2025-01-09 21:33:59,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 269 transitions, 582 flow [2025-01-09 21:33:59,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 269 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:59,192 INFO L231 Difference]: Finished difference. Result has 270 places, 269 transitions, 548 flow [2025-01-09 21:33:59,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=270, PETRI_TRANSITIONS=269} [2025-01-09 21:33:59,193 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -56 predicate places. [2025-01-09 21:33:59,194 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 269 transitions, 548 flow [2025-01-09 21:33:59,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:59,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,195 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] [2025-01-09 21:33:59,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:59,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:59,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2059078676, now seen corresponding path program 1 times [2025-01-09 21:33:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37514528] [2025-01-09 21:33:59,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:33:59,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:33:59,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,273 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:33:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37514528] [2025-01-09 21:33:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37514528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062544342] [2025-01-09 21:33:59,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-01-09 21:33:59,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 269 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:59,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-01-09 21:33:59,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,412 INFO L124 PetriNetUnfolderBase]: 72/538 cut-off events. [2025-01-09 21:33:59,412 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:59,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 538 events. 72/538 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1882 event pairs, 38 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 614. Up to 109 conditions per place. [2025-01-09 21:33:59,416 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 15 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-01-09 21:33:59,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 268 transitions, 580 flow [2025-01-09 21:33:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-01-09 21:33:59,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8080229226361032 [2025-01-09 21:33:59,420 INFO L175 Difference]: Start difference. First operand has 270 places, 269 transitions, 548 flow. Second operand 3 states and 846 transitions. [2025-01-09 21:33:59,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 268 transitions, 580 flow [2025-01-09 21:33:59,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 268 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:59,425 INFO L231 Difference]: Finished difference. Result has 269 places, 268 transitions, 546 flow [2025-01-09 21:33:59,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=269, PETRI_TRANSITIONS=268} [2025-01-09 21:33:59,426 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -57 predicate places. [2025-01-09 21:33:59,426 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 268 transitions, 546 flow [2025-01-09 21:33:59,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:59,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,427 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] [2025-01-09 21:33:59,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:59,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:59,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1288542166, now seen corresponding path program 1 times [2025-01-09 21:33:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461989030] [2025-01-09 21:33:59,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:33:59,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:33:59,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,502 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:33:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461989030] [2025-01-09 21:33:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461989030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227702336] [2025-01-09 21:33:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:33:59,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 268 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:59,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:33:59,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,622 INFO L124 PetriNetUnfolderBase]: 72/543 cut-off events. [2025-01-09 21:33:59,622 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:33:59,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 543 events. 72/543 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1866 event pairs, 7 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 610. Up to 81 conditions per place. [2025-01-09 21:33:59,627 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 18 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-01-09 21:33:59,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 273 transitions, 598 flow [2025-01-09 21:33:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-01-09 21:33:59,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8223495702005731 [2025-01-09 21:33:59,632 INFO L175 Difference]: Start difference. First operand has 269 places, 268 transitions, 546 flow. Second operand 3 states and 861 transitions. [2025-01-09 21:33:59,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 273 transitions, 598 flow [2025-01-09 21:33:59,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 273 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:59,639 INFO L231 Difference]: Finished difference. Result has 269 places, 268 transitions, 550 flow [2025-01-09 21:33:59,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=269, PETRI_TRANSITIONS=268} [2025-01-09 21:33:59,640 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -57 predicate places. [2025-01-09 21:33:59,640 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 268 transitions, 550 flow [2025-01-09 21:33:59,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:33:59,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,641 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] [2025-01-09 21:33:59,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:59,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:59,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2004227503, now seen corresponding path program 1 times [2025-01-09 21:33:59,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229701052] [2025-01-09 21:33:59,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:33:59,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:33:59,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,721 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:33:59,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229701052] [2025-01-09 21:33:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229701052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886848606] [2025-01-09 21:33:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:33:59,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 268 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:33:59,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:33:59,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:59,862 INFO L124 PetriNetUnfolderBase]: 72/538 cut-off events. [2025-01-09 21:33:59,863 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2025-01-09 21:33:59,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 538 events. 72/538 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1908 event pairs, 38 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 298. Up to 110 conditions per place. [2025-01-09 21:33:59,867 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 15 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-01-09 21:33:59,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 267 transitions, 582 flow [2025-01-09 21:33:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-01-09 21:33:59,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-01-09 21:33:59,870 INFO L175 Difference]: Start difference. First operand has 269 places, 268 transitions, 550 flow. Second operand 3 states and 848 transitions. [2025-01-09 21:33:59,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 267 transitions, 582 flow [2025-01-09 21:33:59,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 267 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:59,876 INFO L231 Difference]: Finished difference. Result has 269 places, 267 transitions, 550 flow [2025-01-09 21:33:59,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=269, PETRI_TRANSITIONS=267} [2025-01-09 21:33:59,879 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -57 predicate places. [2025-01-09 21:33:59,880 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 267 transitions, 550 flow [2025-01-09 21:33:59,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:33:59,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,881 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] [2025-01-09 21:33:59,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:59,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:33:59,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1431931874, now seen corresponding path program 1 times [2025-01-09 21:33:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733321502] [2025-01-09 21:33:59,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:33:59,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:33:59,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,956 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:33:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733321502] [2025-01-09 21:33:59,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733321502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550957783] [2025-01-09 21:33:59,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-01-09 21:33:59,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 267 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:33:59,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-01-09 21:33:59,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,074 INFO L124 PetriNetUnfolderBase]: 72/537 cut-off events. [2025-01-09 21:34:00,075 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-01-09 21:34:00,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 537 events. 72/537 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1894 event pairs, 38 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 622. Up to 111 conditions per place. [2025-01-09 21:34:00,080 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 16 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-01-09 21:34:00,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 266 transitions, 584 flow [2025-01-09 21:34:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-01-09 21:34:00,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8080229226361032 [2025-01-09 21:34:00,096 INFO L175 Difference]: Start difference. First operand has 269 places, 267 transitions, 550 flow. Second operand 3 states and 846 transitions. [2025-01-09 21:34:00,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 266 transitions, 584 flow [2025-01-09 21:34:00,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 266 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:00,100 INFO L231 Difference]: Finished difference. Result has 268 places, 266 transitions, 548 flow [2025-01-09 21:34:00,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=268, PETRI_TRANSITIONS=266} [2025-01-09 21:34:00,102 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -58 predicate places. [2025-01-09 21:34:00,102 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 266 transitions, 548 flow [2025-01-09 21:34:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:34:00,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,103 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] [2025-01-09 21:34:00,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:34:00,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:00,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1311370654, now seen corresponding path program 1 times [2025-01-09 21:34:00,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724104351] [2025-01-09 21:34:00,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:34:00,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:34:00,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,160 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:34:00,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724104351] [2025-01-09 21:34:00,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724104351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734258934] [2025-01-09 21:34:00,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:34:00,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 266 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:34:00,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:34:00,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,290 INFO L124 PetriNetUnfolderBase]: 83/631 cut-off events. [2025-01-09 21:34:00,290 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:34:00,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 631 events. 83/631 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2614 event pairs, 20 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 718. Up to 66 conditions per place. [2025-01-09 21:34:00,296 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 21 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-01-09 21:34:00,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 273 transitions, 614 flow [2025-01-09 21:34:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2025-01-09 21:34:00,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8233046800382043 [2025-01-09 21:34:00,299 INFO L175 Difference]: Start difference. First operand has 268 places, 266 transitions, 548 flow. Second operand 3 states and 862 transitions. [2025-01-09 21:34:00,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 273 transitions, 614 flow [2025-01-09 21:34:00,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 273 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:00,306 INFO L231 Difference]: Finished difference. Result has 268 places, 266 transitions, 552 flow [2025-01-09 21:34:00,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=268, PETRI_TRANSITIONS=266} [2025-01-09 21:34:00,308 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -58 predicate places. [2025-01-09 21:34:00,309 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 266 transitions, 552 flow [2025-01-09 21:34:00,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:34:00,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,310 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] [2025-01-09 21:34:00,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:34:00,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:00,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,311 INFO L85 PathProgramCache]: Analyzing trace with hash 680241520, now seen corresponding path program 1 times [2025-01-09 21:34:00,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448852344] [2025-01-09 21:34:00,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:34:00,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:34:00,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,367 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:34:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448852344] [2025-01-09 21:34:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448852344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538340096] [2025-01-09 21:34:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:34:00,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 266 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:34:00,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:34:00,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,477 INFO L124 PetriNetUnfolderBase]: 83/548 cut-off events. [2025-01-09 21:34:00,477 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2025-01-09 21:34:00,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 548 events. 83/548 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1928 event pairs, 38 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 439. Up to 123 conditions per place. [2025-01-09 21:34:00,481 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 16 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-01-09 21:34:00,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 265 transitions, 586 flow [2025-01-09 21:34:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-01-09 21:34:00,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-01-09 21:34:00,483 INFO L175 Difference]: Start difference. First operand has 268 places, 266 transitions, 552 flow. Second operand 3 states and 848 transitions. [2025-01-09 21:34:00,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 265 transitions, 586 flow [2025-01-09 21:34:00,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 265 transitions, 584 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:00,488 INFO L231 Difference]: Finished difference. Result has 268 places, 265 transitions, 552 flow [2025-01-09 21:34:00,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=268, PETRI_TRANSITIONS=265} [2025-01-09 21:34:00,489 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -58 predicate places. [2025-01-09 21:34:00,489 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 265 transitions, 552 flow [2025-01-09 21:34:00,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:34:00,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,490 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] [2025-01-09 21:34:00,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:34:00,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:00,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1420733843, now seen corresponding path program 1 times [2025-01-09 21:34:00,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001557702] [2025-01-09 21:34:00,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:34:00,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:34:00,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,518 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:34:00,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001557702] [2025-01-09 21:34:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001557702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026250580] [2025-01-09 21:34:00,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:34:00,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 265 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:34:00,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:34:00,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,624 INFO L124 PetriNetUnfolderBase]: 83/547 cut-off events. [2025-01-09 21:34:00,624 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:34:00,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 547 events. 83/547 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1924 event pairs, 38 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 653. Up to 121 conditions per place. [2025-01-09 21:34:00,628 INFO L140 encePairwiseOnDemand]: 347/349 looper letters, 15 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2025-01-09 21:34:00,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 264 transitions, 582 flow [2025-01-09 21:34:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:34:00,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166189111747851 [2025-01-09 21:34:00,630 INFO L175 Difference]: Start difference. First operand has 268 places, 265 transitions, 552 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:34:00,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 264 transitions, 582 flow [2025-01-09 21:34:00,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 264 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:00,635 INFO L231 Difference]: Finished difference. Result has 267 places, 264 transitions, 548 flow [2025-01-09 21:34:00,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=267, PETRI_TRANSITIONS=264} [2025-01-09 21:34:00,637 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -59 predicate places. [2025-01-09 21:34:00,637 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 264 transitions, 548 flow [2025-01-09 21:34:00,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:34:00,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:00,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:34:00,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:00,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1202927368, now seen corresponding path program 1 times [2025-01-09 21:34:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597429163] [2025-01-09 21:34:00,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:34:00,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:34:00,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,686 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:34:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597429163] [2025-01-09 21:34:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597429163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858423753] [2025-01-09 21:34:00,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:34:00,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:34:00,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:34:00,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,795 INFO L124 PetriNetUnfolderBase]: 83/546 cut-off events. [2025-01-09 21:34:00,796 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:34:00,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 546 events. 83/546 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1920 event pairs, 38 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 653. Up to 123 conditions per place. [2025-01-09 21:34:00,800 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 16 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2025-01-09 21:34:00,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 263 transitions, 582 flow [2025-01-09 21:34:00,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-01-09 21:34:00,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-01-09 21:34:00,803 INFO L175 Difference]: Start difference. First operand has 267 places, 264 transitions, 548 flow. Second operand 3 states and 848 transitions. [2025-01-09 21:34:00,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 263 transitions, 582 flow [2025-01-09 21:34:00,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 263 transitions, 581 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:00,808 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 549 flow [2025-01-09 21:34:00,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2025-01-09 21:34:00,809 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -59 predicate places. [2025-01-09 21:34:00,810 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 549 flow [2025-01-09 21:34:00,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:34:00,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:00,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:34:00,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:00,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash 307830896, now seen corresponding path program 1 times [2025-01-09 21:34:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867064601] [2025-01-09 21:34:00,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:34:00,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:34:00,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,394 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:34:01,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867064601] [2025-01-09 21:34:01,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867064601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:01,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265413171] [2025-01-09 21:34:01,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:01,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:01,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:01,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 349 [2025-01-09 21:34:01,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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:34:01,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 349 [2025-01-09 21:34:01,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,666 INFO L124 PetriNetUnfolderBase]: 83/544 cut-off events. [2025-01-09 21:34:01,667 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:34:01,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 544 events. 83/544 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1909 event pairs, 38 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 675. Up to 136 conditions per place. [2025-01-09 21:34:01,671 INFO L140 encePairwiseOnDemand]: 337/349 looper letters, 29 selfloop transitions, 10 changer transitions 0/261 dead transitions. [2025-01-09 21:34:01,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 261 transitions, 623 flow [2025-01-09 21:34:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1575 transitions. [2025-01-09 21:34:01,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521489971346705 [2025-01-09 21:34:01,676 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 549 flow. Second operand 6 states and 1575 transitions. [2025-01-09 21:34:01,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 261 transitions, 623 flow [2025-01-09 21:34:01,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 261 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:01,682 INFO L231 Difference]: Finished difference. Result has 268 places, 261 transitions, 561 flow [2025-01-09 21:34:01,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=561, PETRI_PLACES=268, PETRI_TRANSITIONS=261} [2025-01-09 21:34:01,685 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -58 predicate places. [2025-01-09 21:34:01,685 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 261 transitions, 561 flow [2025-01-09 21:34:01,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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:34:01,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,686 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] [2025-01-09 21:34:01,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:34:01,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:01,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1072554662, now seen corresponding path program 1 times [2025-01-09 21:34:01,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340766837] [2025-01-09 21:34:01,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:34:01,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:34:01,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,736 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:34:01,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340766837] [2025-01-09 21:34:01,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340766837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269376607] [2025-01-09 21:34:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:34:01,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 261 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:34:01,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:34:01,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,834 INFO L124 PetriNetUnfolderBase]: 83/543 cut-off events. [2025-01-09 21:34:01,834 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:34:01,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 543 events. 83/543 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1905 event pairs, 38 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 709. Up to 121 conditions per place. [2025-01-09 21:34:01,838 INFO L140 encePairwiseOnDemand]: 347/349 looper letters, 15 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-01-09 21:34:01,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 260 transitions, 591 flow [2025-01-09 21:34:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:34:01,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166189111747851 [2025-01-09 21:34:01,841 INFO L175 Difference]: Start difference. First operand has 268 places, 261 transitions, 561 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:34:01,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 260 transitions, 591 flow [2025-01-09 21:34:01,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 260 transitions, 571 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:01,845 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 541 flow [2025-01-09 21:34:01,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2025-01-09 21:34:01,847 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -62 predicate places. [2025-01-09 21:34:01,847 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 541 flow [2025-01-09 21:34:01,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:34:01,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,848 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] [2025-01-09 21:34:01,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:34:01,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:01,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1657468355, now seen corresponding path program 1 times [2025-01-09 21:34:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66008178] [2025-01-09 21:34:01,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:34:01,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:34:01,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,902 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:34:01,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66008178] [2025-01-09 21:34:01,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66008178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11337894] [2025-01-09 21:34:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:34:01,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:34:01,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:34:01,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,025 INFO L124 PetriNetUnfolderBase]: 83/542 cut-off events. [2025-01-09 21:34:02,025 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:34:02,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 542 events. 83/542 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1897 event pairs, 38 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 650. Up to 123 conditions per place. [2025-01-09 21:34:02,029 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 16 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-01-09 21:34:02,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 259 transitions, 575 flow [2025-01-09 21:34:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-01-09 21:34:02,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-01-09 21:34:02,032 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 541 flow. Second operand 3 states and 848 transitions. [2025-01-09 21:34:02,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 259 transitions, 575 flow [2025-01-09 21:34:02,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 259 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:02,037 INFO L231 Difference]: Finished difference. Result has 264 places, 259 transitions, 542 flow [2025-01-09 21:34:02,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=264, PETRI_TRANSITIONS=259} [2025-01-09 21:34:02,038 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -62 predicate places. [2025-01-09 21:34:02,038 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 259 transitions, 542 flow [2025-01-09 21:34:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:34:02,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,039 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] [2025-01-09 21:34:02,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:34:02,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:02,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1918471236, now seen corresponding path program 1 times [2025-01-09 21:34:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394857652] [2025-01-09 21:34:02,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 21:34:02,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 21:34:02,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,095 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:34:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394857652] [2025-01-09 21:34:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394857652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075692628] [2025-01-09 21:34:02,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:02,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:02,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 349 [2025-01-09 21:34:02,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 259 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 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:34:02,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:02,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 349 [2025-01-09 21:34:02,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,216 INFO L124 PetriNetUnfolderBase]: 112/649 cut-off events. [2025-01-09 21:34:02,216 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-09 21:34:02,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 649 events. 112/649 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2721 event pairs, 64 based on Foata normal form. 1/568 useless extension candidates. Maximal degree in co-relation 839. Up to 171 conditions per place. [2025-01-09 21:34:02,222 INFO L140 encePairwiseOnDemand]: 345/349 looper letters, 17 selfloop transitions, 1 changer transitions 2/256 dead transitions. [2025-01-09 21:34:02,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 256 transitions, 574 flow [2025-01-09 21:34:02,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-01-09 21:34:02,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8042024832855779 [2025-01-09 21:34:02,224 INFO L175 Difference]: Start difference. First operand has 264 places, 259 transitions, 542 flow. Second operand 3 states and 842 transitions. [2025-01-09 21:34:02,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 256 transitions, 574 flow [2025-01-09 21:34:02,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 256 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:02,231 INFO L231 Difference]: Finished difference. Result has 261 places, 254 transitions, 530 flow [2025-01-09 21:34:02,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=261, PETRI_TRANSITIONS=254} [2025-01-09 21:34:02,232 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -65 predicate places. [2025-01-09 21:34:02,232 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 254 transitions, 530 flow [2025-01-09 21:34:02,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 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:34:02,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:02,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:34:02,233 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:02,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1060341913, now seen corresponding path program 1 times [2025-01-09 21:34:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860942268] [2025-01-09 21:34:02,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:34:02,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:34:02,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,318 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:34:02,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860942268] [2025-01-09 21:34:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860942268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702002041] [2025-01-09 21:34:02,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:02,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:02,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 349 [2025-01-09 21:34:02,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 254 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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:34:02,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:02,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 349 [2025-01-09 21:34:02,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,454 INFO L124 PetriNetUnfolderBase]: 158/603 cut-off events. [2025-01-09 21:34:02,454 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2025-01-09 21:34:02,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 603 events. 158/603 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2188 event pairs, 53 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 849. Up to 156 conditions per place. [2025-01-09 21:34:02,458 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 20 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-01-09 21:34:02,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 590 flow [2025-01-09 21:34:02,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2025-01-09 21:34:02,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8213944603629417 [2025-01-09 21:34:02,461 INFO L175 Difference]: Start difference. First operand has 261 places, 254 transitions, 530 flow. Second operand 3 states and 860 transitions. [2025-01-09 21:34:02,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 590 flow [2025-01-09 21:34:02,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 259 transitions, 589 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:02,466 INFO L231 Difference]: Finished difference. Result has 259 places, 253 transitions, 531 flow [2025-01-09 21:34:02,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=259, PETRI_TRANSITIONS=253} [2025-01-09 21:34:02,468 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -67 predicate places. [2025-01-09 21:34:02,469 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 253 transitions, 531 flow [2025-01-09 21:34:02,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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:34:02,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,470 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] [2025-01-09 21:34:02,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:34:02,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:02,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash -175799012, now seen corresponding path program 1 times [2025-01-09 21:34:02,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393866010] [2025-01-09 21:34:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:34:02,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:34:02,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,553 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:34:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393866010] [2025-01-09 21:34:02,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393866010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532725805] [2025-01-09 21:34:02,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:02,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:02,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 349 [2025-01-09 21:34:02,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 253 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 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:34:02,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:02,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 349 [2025-01-09 21:34:02,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,698 INFO L124 PetriNetUnfolderBase]: 208/643 cut-off events. [2025-01-09 21:34:02,698 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-01-09 21:34:02,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 643 events. 208/643 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2383 event pairs, 83 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1005. Up to 228 conditions per place. [2025-01-09 21:34:02,703 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 22 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2025-01-09 21:34:02,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 258 transitions, 595 flow [2025-01-09 21:34:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2025-01-09 21:34:02,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175740210124164 [2025-01-09 21:34:02,706 INFO L175 Difference]: Start difference. First operand has 259 places, 253 transitions, 531 flow. Second operand 3 states and 856 transitions. [2025-01-09 21:34:02,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 258 transitions, 595 flow [2025-01-09 21:34:02,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 258 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:02,711 INFO L231 Difference]: Finished difference. Result has 258 places, 252 transitions, 529 flow [2025-01-09 21:34:02,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=258, PETRI_TRANSITIONS=252} [2025-01-09 21:34:02,712 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -68 predicate places. [2025-01-09 21:34:02,712 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 252 transitions, 529 flow [2025-01-09 21:34:02,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 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:34:02,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:02,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:34:02,713 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash 329838033, now seen corresponding path program 1 times [2025-01-09 21:34:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385060739] [2025-01-09 21:34:02,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:34:02,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:34:02,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,782 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:34:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385060739] [2025-01-09 21:34:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385060739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687248639] [2025-01-09 21:34:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:02,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:02,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:34:02,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 252 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:34:02,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:02,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:34:02,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,932 INFO L124 PetriNetUnfolderBase]: 167/705 cut-off events. [2025-01-09 21:34:02,932 INFO L125 PetriNetUnfolderBase]: For 93/105 co-relation queries the response was YES. [2025-01-09 21:34:02,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 705 events. 167/705 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3030 event pairs, 56 based on Foata normal form. 1/632 useless extension candidates. Maximal degree in co-relation 978. Up to 161 conditions per place. [2025-01-09 21:34:02,936 INFO L140 encePairwiseOnDemand]: 344/349 looper letters, 20 selfloop transitions, 2 changer transitions 2/257 dead transitions. [2025-01-09 21:34:02,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 257 transitions, 593 flow [2025-01-09 21:34:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2025-01-09 21:34:02,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8156638013371538 [2025-01-09 21:34:02,939 INFO L175 Difference]: Start difference. First operand has 258 places, 252 transitions, 529 flow. Second operand 3 states and 854 transitions. [2025-01-09 21:34:02,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 257 transitions, 593 flow [2025-01-09 21:34:02,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 257 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:02,943 INFO L231 Difference]: Finished difference. Result has 256 places, 248 transitions, 520 flow [2025-01-09 21:34:02,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=256, PETRI_TRANSITIONS=248} [2025-01-09 21:34:02,944 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -70 predicate places. [2025-01-09 21:34:02,944 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 248 transitions, 520 flow [2025-01-09 21:34:02,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:34:02,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,945 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] [2025-01-09 21:34:02,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:34:02,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-01-09 21:34:02,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash 434257172, now seen corresponding path program 1 times [2025-01-09 21:34:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242715137] [2025-01-09 21:34:02,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:34:02,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:34:02,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,008 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:34:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242715137] [2025-01-09 21:34:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242715137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133730014] [2025-01-09 21:34:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-01-09 21:34:03,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 248 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 279.6666666666667) internal successors, (839), 3 states have internal predecessors, (839), 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:34:03,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-01-09 21:34:03,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,150 INFO L124 PetriNetUnfolderBase]: 223/743 cut-off events. [2025-01-09 21:34:03,150 INFO L125 PetriNetUnfolderBase]: For 130/156 co-relation queries the response was YES. [2025-01-09 21:34:03,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 743 events. 223/743 cut-off events. For 130/156 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3166 event pairs, 92 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 1118. Up to 242 conditions per place. [2025-01-09 21:34:03,153 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 0 selfloop transitions, 0 changer transitions 254/254 dead transitions. [2025-01-09 21:34:03,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 586 flow [2025-01-09 21:34:03,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-01-09 21:34:03,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8147086914995224 [2025-01-09 21:34:03,155 INFO L175 Difference]: Start difference. First operand has 256 places, 248 transitions, 520 flow. Second operand 3 states and 853 transitions. [2025-01-09 21:34:03,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 586 flow [2025-01-09 21:34:03,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:03,158 INFO L231 Difference]: Finished difference. Result has 253 places, 0 transitions, 0 flow [2025-01-09 21:34:03,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=253, PETRI_TRANSITIONS=0} [2025-01-09 21:34:03,159 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -73 predicate places. [2025-01-09 21:34:03,159 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 0 transitions, 0 flow [2025-01-09 21:34:03,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.6666666666667) internal successors, (839), 3 states have internal predecessors, (839), 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:34:03,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2025-01-09 21:34:03,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2025-01-09 21:34:03,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2025-01-09 21:34:03,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2025-01-09 21:34:03,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2025-01-09 21:34:03,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2025-01-09 21:34:03,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2025-01-09 21:34:03,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2025-01-09 21:34:03,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2025-01-09 21:34:03,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2025-01-09 21:34:03,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2025-01-09 21:34:03,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2025-01-09 21:34:03,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2025-01-09 21:34:03,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2025-01-09 21:34:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:34:03,172 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:03,177 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:34:03,178 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:34:03,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:34:03 BasicIcfg [2025-01-09 21:34:03,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:34:03,184 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:34:03,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:34:03,184 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:34:03,184 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:57" (3/4) ... [2025-01-09 21:34:03,186 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:34:03,189 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:34:03,189 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:34:03,189 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:34:03,196 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-09 21:34:03,196 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:34:03,197 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:34:03,197 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:03,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:03,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:03,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:03,287 INFO L158 Benchmark]: Toolchain (without parser) took 7346.10ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 112.9MB in the beginning and 92.1MB in the end (delta: 20.8MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. [2025-01-09 21:34:03,288 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:03,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.99ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.5MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:03,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.87ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:03,289 INFO L158 Benchmark]: Boogie Preprocessor took 69.53ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:03,289 INFO L158 Benchmark]: RCFGBuilder took 1334.88ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 44.7MB in the end (delta: 48.8MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2025-01-09 21:34:03,289 INFO L158 Benchmark]: TraceAbstraction took 5478.10ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 44.0MB in the beginning and 100.5MB in the end (delta: -56.5MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2025-01-09 21:34:03,289 INFO L158 Benchmark]: Witness Printer took 102.40ms. Allocated memory is still 268.4MB. Free memory was 100.5MB in the beginning and 92.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:03,291 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.99ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.5MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.87ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.53ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1334.88ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 44.7MB in the end (delta: 48.8MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5478.10ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 44.0MB in the beginning and 100.5MB in the end (delta: -56.5MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * Witness Printer took 102.40ms. Allocated memory is still 268.4MB. Free memory was 100.5MB in the beginning and 92.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 431 locations, 119 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 701 IncrementalHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 29 mSDtfsCounter, 701 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1854 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:03,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE