./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.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-more-buffer-series2.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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:20,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:20,944 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:20,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:20,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:20,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:20,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:20,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:20,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:20,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:20,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:20,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:20,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:20,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:20,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:20,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:20,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:20,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:20,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:20,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:20,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:20,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:20,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:20,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:20,977 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2025-01-09 21:33:21,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:21,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:21,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:21,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:21,159 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:21,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-01-09 21:33:22,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61c94a94d/ae431d06d5a049dab9f0425783cff024/FLAG554cf5ea9 [2025-01-09 21:33:22,557 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:22,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2025-01-09 21:33:22,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61c94a94d/ae431d06d5a049dab9f0425783cff024/FLAG554cf5ea9 [2025-01-09 21:33:22,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61c94a94d/ae431d06d5a049dab9f0425783cff024 [2025-01-09 21:33:22,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:22,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:22,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:22,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:22,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:22,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bee783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22, skipping insertion in model container [2025-01-09 21:33:22,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:23,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:23,075 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:23,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:23,165 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:23,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:23 WrapperNode [2025-01-09 21:33:23,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:23,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:23,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:23,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:23,176 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:23" (1/1) ... [2025-01-09 21:33:23,199 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:23" (1/1) ... [2025-01-09 21:33:23,266 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 627 [2025-01-09 21:33:23,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:23,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:23,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:23,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:23,281 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:23" (1/1) ... [2025-01-09 21:33:23,281 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:23" (1/1) ... [2025-01-09 21:33:23,290 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:23" (1/1) ... [2025-01-09 21:33:23,290 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:23" (1/1) ... [2025-01-09 21:33:23,324 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:23" (1/1) ... [2025-01-09 21:33:23,332 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:23" (1/1) ... [2025-01-09 21:33:23,345 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:23" (1/1) ... [2025-01-09 21:33:23,353 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:23" (1/1) ... [2025-01-09 21:33:23,359 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:23" (1/1) ... [2025-01-09 21:33:23,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:23,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:23,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:23,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:23,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:23" (1/1) ... [2025-01-09 21:33:23,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:23,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:23,414 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:23,425 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:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:33:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:33:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:23,445 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:23,549 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:23,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:24,264 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:24,264 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:24,849 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:24,849 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:33:24,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:24 BoogieIcfgContainer [2025-01-09 21:33:24,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:24,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:24,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:24,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:24,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:22" (1/3) ... [2025-01-09 21:33:24,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ca8d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:24, skipping insertion in model container [2025-01-09 21:33:24,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:23" (2/3) ... [2025-01-09 21:33:24,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ca8d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:24, skipping insertion in model container [2025-01-09 21:33:24,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:24" (3/3) ... [2025-01-09 21:33:24,856 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-01-09 21:33:24,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:24,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 415 locations, 1 initial locations, 7 loop locations, and 99 error locations. [2025-01-09 21:33:24,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:25,009 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:33:25,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 427 places, 429 transitions, 886 flow [2025-01-09 21:33:25,220 INFO L124 PetriNetUnfolderBase]: 15/425 cut-off events. [2025-01-09 21:33:25,225 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:25,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 425 events. 15/425 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 639 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 377. Up to 2 conditions per place. [2025-01-09 21:33:25,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 427 places, 429 transitions, 886 flow [2025-01-09 21:33:25,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 407 places, 408 transitions, 840 flow [2025-01-09 21:33:25,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:25,253 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;@2aa08ee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:25,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 182 error locations. [2025-01-09 21:33:25,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:25,257 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-01-09 21:33:25,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:25,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:25,258 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] [2025-01-09 21:33:25,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:25,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1746606322, now seen corresponding path program 1 times [2025-01-09 21:33:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276173911] [2025-01-09 21:33:25,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:25,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:25,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:25,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:25,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:25,385 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:25,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276173911] [2025-01-09 21:33:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276173911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:25,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:25,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191112111] [2025-01-09 21:33:25,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:25,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:25,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:25,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:25,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 429 [2025-01-09 21:33:25,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 408 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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:25,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:25,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 429 [2025-01-09 21:33:25,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:25,842 INFO L124 PetriNetUnfolderBase]: 451/1185 cut-off events. [2025-01-09 21:33:25,842 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-01-09 21:33:25,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 1185 events. 451/1185 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5159 event pairs, 272 based on Foata normal form. 7/1066 useless extension candidates. Maximal degree in co-relation 1525. Up to 614 conditions per place. [2025-01-09 21:33:25,851 INFO L140 encePairwiseOnDemand]: 340/429 looper letters, 25 selfloop transitions, 2 changer transitions 7/321 dead transitions. [2025-01-09 21:33:25,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 321 transitions, 720 flow [2025-01-09 21:33:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2025-01-09 21:33:25,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8158508158508159 [2025-01-09 21:33:25,863 INFO L175 Difference]: Start difference. First operand has 407 places, 408 transitions, 840 flow. Second operand 3 states and 1050 transitions. [2025-01-09 21:33:25,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 321 transitions, 720 flow [2025-01-09 21:33:25,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 321 transitions, 704 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:33:25,880 INFO L231 Difference]: Finished difference. Result has 321 places, 314 transitions, 640 flow [2025-01-09 21:33:25,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=321, PETRI_TRANSITIONS=314} [2025-01-09 21:33:25,892 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -86 predicate places. [2025-01-09 21:33:25,892 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 314 transitions, 640 flow [2025-01-09 21:33:25,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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:25,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:25,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:25,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:25,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:25,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1049207225, now seen corresponding path program 1 times [2025-01-09 21:33:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101551016] [2025-01-09 21:33:25,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:25,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:33:25,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:33:25,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:25,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:25,968 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:25,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101551016] [2025-01-09 21:33:25,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101551016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:25,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:25,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:25,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290109388] [2025-01-09 21:33:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:25,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:25,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:25,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:25,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 429 [2025-01-09 21:33:25,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 314 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:25,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:25,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 429 [2025-01-09 21:33:25,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:26,295 INFO L124 PetriNetUnfolderBase]: 451/1177 cut-off events. [2025-01-09 21:33:26,295 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 21:33:26,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 1177 events. 451/1177 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5128 event pairs, 272 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 1797. Up to 613 conditions per place. [2025-01-09 21:33:26,301 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 24 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-01-09 21:33:26,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 313 transitions, 690 flow [2025-01-09 21:33:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-01-09 21:33:26,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7505827505827506 [2025-01-09 21:33:26,304 INFO L175 Difference]: Start difference. First operand has 321 places, 314 transitions, 640 flow. Second operand 3 states and 966 transitions. [2025-01-09 21:33:26,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 313 transitions, 690 flow [2025-01-09 21:33:26,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 313 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:26,308 INFO L231 Difference]: Finished difference. Result has 313 places, 313 transitions, 638 flow [2025-01-09 21:33:26,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=313, PETRI_TRANSITIONS=313} [2025-01-09 21:33:26,308 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -94 predicate places. [2025-01-09 21:33:26,309 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 313 transitions, 638 flow [2025-01-09 21:33:26,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:26,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:26,309 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] [2025-01-09 21:33:26,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:26,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:26,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:26,310 INFO L85 PathProgramCache]: Analyzing trace with hash -92311464, now seen corresponding path program 1 times [2025-01-09 21:33:26,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:26,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290606846] [2025-01-09 21:33:26,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:26,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:33:26,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:33:26,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:26,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:26,340 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:26,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290606846] [2025-01-09 21:33:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290606846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66150383] [2025-01-09 21:33:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:26,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:26,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:26,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 429 [2025-01-09 21:33:26,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 313 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:26,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:26,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 429 [2025-01-09 21:33:26,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:26,564 INFO L124 PetriNetUnfolderBase]: 451/1176 cut-off events. [2025-01-09 21:33:26,564 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 21:33:26,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1176 events. 451/1176 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5149 event pairs, 272 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 1788. Up to 613 conditions per place. [2025-01-09 21:33:26,569 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 24 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2025-01-09 21:33:26,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 312 transitions, 688 flow [2025-01-09 21:33:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-01-09 21:33:26,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7505827505827506 [2025-01-09 21:33:26,571 INFO L175 Difference]: Start difference. First operand has 313 places, 313 transitions, 638 flow. Second operand 3 states and 966 transitions. [2025-01-09 21:33:26,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 312 transitions, 688 flow [2025-01-09 21:33:26,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 312 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:26,575 INFO L231 Difference]: Finished difference. Result has 312 places, 312 transitions, 636 flow [2025-01-09 21:33:26,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=312, PETRI_TRANSITIONS=312} [2025-01-09 21:33:26,576 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -95 predicate places. [2025-01-09 21:33:26,576 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 312 transitions, 636 flow [2025-01-09 21:33:26,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:26,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:26,577 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] [2025-01-09 21:33:26,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:26,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:26,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash -750825977, now seen corresponding path program 1 times [2025-01-09 21:33:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634885133] [2025-01-09 21:33:26,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:26,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:33:26,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:33:26,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:26,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:26,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634885133] [2025-01-09 21:33:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634885133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:26,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:26,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:26,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383195084] [2025-01-09 21:33:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:26,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:26,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:26,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:26,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:26,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 429 [2025-01-09 21:33:26,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 312 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:26,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:26,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 429 [2025-01-09 21:33:26,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:26,847 INFO L124 PetriNetUnfolderBase]: 451/1175 cut-off events. [2025-01-09 21:33:26,847 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 21:33:26,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1175 events. 451/1175 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5158 event pairs, 272 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 1779. Up to 613 conditions per place. [2025-01-09 21:33:26,852 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 24 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-01-09 21:33:26,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 311 transitions, 686 flow [2025-01-09 21:33:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-01-09 21:33:26,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7505827505827506 [2025-01-09 21:33:26,855 INFO L175 Difference]: Start difference. First operand has 312 places, 312 transitions, 636 flow. Second operand 3 states and 966 transitions. [2025-01-09 21:33:26,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 311 transitions, 686 flow [2025-01-09 21:33:26,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 311 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:26,858 INFO L231 Difference]: Finished difference. Result has 311 places, 311 transitions, 634 flow [2025-01-09 21:33:26,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=311, PETRI_TRANSITIONS=311} [2025-01-09 21:33:26,859 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -96 predicate places. [2025-01-09 21:33:26,859 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 311 transitions, 634 flow [2025-01-09 21:33:26,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:26,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:26,860 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] [2025-01-09 21:33:26,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:26,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:26,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1797173904, now seen corresponding path program 1 times [2025-01-09 21:33:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:26,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114371278] [2025-01-09 21:33:26,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:26,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:33:26,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:33:26,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:26,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:26,900 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:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114371278] [2025-01-09 21:33:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114371278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:26,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559046294] [2025-01-09 21:33:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:26,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:26,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:26,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:26,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 429 [2025-01-09 21:33:26,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 311 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:26,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:26,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 429 [2025-01-09 21:33:26,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:27,170 INFO L124 PetriNetUnfolderBase]: 595/1561 cut-off events. [2025-01-09 21:33:27,170 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 21:33:27,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2422 conditions, 1561 events. 595/1561 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8258 event pairs, 228 based on Foata normal form. 0/1404 useless extension candidates. Maximal degree in co-relation 2359. Up to 435 conditions per place. [2025-01-09 21:33:27,178 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 36 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2025-01-09 21:33:27,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 325 transitions, 743 flow [2025-01-09 21:33:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 990 transitions. [2025-01-09 21:33:27,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2025-01-09 21:33:27,181 INFO L175 Difference]: Start difference. First operand has 311 places, 311 transitions, 634 flow. Second operand 3 states and 990 transitions. [2025-01-09 21:33:27,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 325 transitions, 743 flow [2025-01-09 21:33:27,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 325 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:27,185 INFO L231 Difference]: Finished difference. Result has 311 places, 311 transitions, 638 flow [2025-01-09 21:33:27,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=311, PETRI_TRANSITIONS=311} [2025-01-09 21:33:27,186 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -96 predicate places. [2025-01-09 21:33:27,186 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 311 transitions, 638 flow [2025-01-09 21:33:27,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:27,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:27,187 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] [2025-01-09 21:33:27,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:27,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:27,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2075094392, now seen corresponding path program 1 times [2025-01-09 21:33:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:27,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942755787] [2025-01-09 21:33:27,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:27,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:27,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:33:27,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:33:27,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:27,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:27,243 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:27,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:27,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942755787] [2025-01-09 21:33:27,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942755787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:27,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:27,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982814439] [2025-01-09 21:33:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:27,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:27,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:27,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-01-09 21:33:27,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 311 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:27,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:27,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-01-09 21:33:27,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:27,865 INFO L124 PetriNetUnfolderBase]: 595/1563 cut-off events. [2025-01-09 21:33:27,866 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-01-09 21:33:27,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2570 conditions, 1563 events. 595/1563 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8374 event pairs, 375 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 1268. Up to 808 conditions per place. [2025-01-09 21:33:27,882 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 24 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-01-09 21:33:27,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 688 flow [2025-01-09 21:33:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:27,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-01-09 21:33:27,888 INFO L175 Difference]: Start difference. First operand has 311 places, 311 transitions, 638 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:27,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 688 flow [2025-01-09 21:33:27,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 310 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:27,895 INFO L231 Difference]: Finished difference. Result has 311 places, 310 transitions, 638 flow [2025-01-09 21:33:27,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=311, PETRI_TRANSITIONS=310} [2025-01-09 21:33:27,901 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -96 predicate places. [2025-01-09 21:33:27,901 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 310 transitions, 638 flow [2025-01-09 21:33:27,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:27,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:27,902 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] [2025-01-09 21:33:27,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:27,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:27,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1823238209, now seen corresponding path program 1 times [2025-01-09 21:33:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317294909] [2025-01-09 21:33:27,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:27,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:33:27,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:33:27,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:27,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:27,960 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:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317294909] [2025-01-09 21:33:27,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317294909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:27,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:27,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978867075] [2025-01-09 21:33:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:27,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:27,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:27,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:27,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 429 [2025-01-09 21:33:27,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 310 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:27,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:27,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 429 [2025-01-09 21:33:27,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:28,208 INFO L124 PetriNetUnfolderBase]: 595/1562 cut-off events. [2025-01-09 21:33:28,208 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-01-09 21:33:28,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 1562 events. 595/1562 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8357 event pairs, 375 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 2452. Up to 809 conditions per place. [2025-01-09 21:33:28,214 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 25 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-01-09 21:33:28,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 309 transitions, 690 flow [2025-01-09 21:33:28,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-01-09 21:33:28,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7505827505827506 [2025-01-09 21:33:28,217 INFO L175 Difference]: Start difference. First operand has 311 places, 310 transitions, 638 flow. Second operand 3 states and 966 transitions. [2025-01-09 21:33:28,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 309 transitions, 690 flow [2025-01-09 21:33:28,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 309 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:28,220 INFO L231 Difference]: Finished difference. Result has 310 places, 309 transitions, 636 flow [2025-01-09 21:33:28,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=310, PETRI_TRANSITIONS=309} [2025-01-09 21:33:28,221 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -97 predicate places. [2025-01-09 21:33:28,221 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 309 transitions, 636 flow [2025-01-09 21:33:28,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:28,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:28,222 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] [2025-01-09 21:33:28,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:28,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:28,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 272772034, now seen corresponding path program 1 times [2025-01-09 21:33:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:28,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578070830] [2025-01-09 21:33:28,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:28,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:28,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:33:28,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:33:28,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:28,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:28,261 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:28,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578070830] [2025-01-09 21:33:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578070830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:28,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:28,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:28,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836819301] [2025-01-09 21:33:28,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:28,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:28,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:28,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:28,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:28,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 429 [2025-01-09 21:33:28,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 309 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:28,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:28,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 429 [2025-01-09 21:33:28,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:28,493 INFO L124 PetriNetUnfolderBase]: 749/1867 cut-off events. [2025-01-09 21:33:28,494 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2025-01-09 21:33:28,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 1867 events. 749/1867 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10413 event pairs, 262 based on Foata normal form. 0/1687 useless extension candidates. Maximal degree in co-relation 2982. Up to 544 conditions per place. [2025-01-09 21:33:28,502 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 37 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-01-09 21:33:28,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 323 transitions, 750 flow [2025-01-09 21:33:28,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2025-01-09 21:33:28,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7684537684537684 [2025-01-09 21:33:28,504 INFO L175 Difference]: Start difference. First operand has 310 places, 309 transitions, 636 flow. Second operand 3 states and 989 transitions. [2025-01-09 21:33:28,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 323 transitions, 750 flow [2025-01-09 21:33:28,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 323 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:28,508 INFO L231 Difference]: Finished difference. Result has 310 places, 309 transitions, 640 flow [2025-01-09 21:33:28,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=310, PETRI_TRANSITIONS=309} [2025-01-09 21:33:28,509 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -97 predicate places. [2025-01-09 21:33:28,509 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 309 transitions, 640 flow [2025-01-09 21:33:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:28,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:28,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:28,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:28,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:28,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1953853022, now seen corresponding path program 1 times [2025-01-09 21:33:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:28,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268711083] [2025-01-09 21:33:28,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:28,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:33:28,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:33:28,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:28,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:28,532 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:28,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:28,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268711083] [2025-01-09 21:33:28,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268711083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:28,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:28,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430686460] [2025-01-09 21:33:28,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:28,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:28,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:28,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:28,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:28,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-01-09 21:33:28,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 309 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:28,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:28,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-01-09 21:33:28,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:28,761 INFO L124 PetriNetUnfolderBase]: 749/1990 cut-off events. [2025-01-09 21:33:28,762 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2025-01-09 21:33:28,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 1990 events. 749/1990 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12095 event pairs, 488 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 1766. Up to 1018 conditions per place. [2025-01-09 21:33:28,770 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 25 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-01-09 21:33:28,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 308 transitions, 692 flow [2025-01-09 21:33:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:28,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-01-09 21:33:28,772 INFO L175 Difference]: Start difference. First operand has 310 places, 309 transitions, 640 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:28,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 308 transitions, 692 flow [2025-01-09 21:33:28,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 308 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:28,776 INFO L231 Difference]: Finished difference. Result has 310 places, 308 transitions, 640 flow [2025-01-09 21:33:28,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=310, PETRI_TRANSITIONS=308} [2025-01-09 21:33:28,777 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -97 predicate places. [2025-01-09 21:33:28,777 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 308 transitions, 640 flow [2025-01-09 21:33:28,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:28,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:28,778 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] [2025-01-09 21:33:28,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:28,778 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1836510315, now seen corresponding path program 1 times [2025-01-09 21:33:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756044426] [2025-01-09 21:33:28,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:28,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:33:28,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:33:28,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:28,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:28,803 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:28,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756044426] [2025-01-09 21:33:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756044426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468600098] [2025-01-09 21:33:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:28,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:28,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:28,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 429 [2025-01-09 21:33:28,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 308 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:28,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:28,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 429 [2025-01-09 21:33:28,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,038 INFO L124 PetriNetUnfolderBase]: 749/1989 cut-off events. [2025-01-09 21:33:29,039 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 21:33:29,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 1989 events. 749/1989 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12115 event pairs, 488 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 3205. Up to 1016 conditions per place. [2025-01-09 21:33:29,046 INFO L140 encePairwiseOnDemand]: 427/429 looper letters, 24 selfloop transitions, 1 changer transitions 0/307 dead transitions. [2025-01-09 21:33:29,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 307 transitions, 688 flow [2025-01-09 21:33:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-01-09 21:33:29,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-01-09 21:33:29,048 INFO L175 Difference]: Start difference. First operand has 310 places, 308 transitions, 640 flow. Second operand 3 states and 975 transitions. [2025-01-09 21:33:29,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 307 transitions, 688 flow [2025-01-09 21:33:29,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 307 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:29,052 INFO L231 Difference]: Finished difference. Result has 309 places, 307 transitions, 636 flow [2025-01-09 21:33:29,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=309, PETRI_TRANSITIONS=307} [2025-01-09 21:33:29,053 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -98 predicate places. [2025-01-09 21:33:29,053 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 307 transitions, 636 flow [2025-01-09 21:33:29,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:29,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:29,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:29,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:29,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1796726052, now seen corresponding path program 1 times [2025-01-09 21:33:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557719290] [2025-01-09 21:33:29,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:33:29,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:33:29,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,093 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:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557719290] [2025-01-09 21:33:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557719290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079334819] [2025-01-09 21:33:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:29,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-01-09 21:33:29,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 307 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:29,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-01-09 21:33:29,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,395 INFO L124 PetriNetUnfolderBase]: 749/1988 cut-off events. [2025-01-09 21:33:29,395 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 21:33:29,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 1988 events. 749/1988 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12095 event pairs, 488 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 3205. Up to 1018 conditions per place. [2025-01-09 21:33:29,402 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 25 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2025-01-09 21:33:29,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 306 transitions, 688 flow [2025-01-09 21:33:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:29,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-01-09 21:33:29,404 INFO L175 Difference]: Start difference. First operand has 309 places, 307 transitions, 636 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:29,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 306 transitions, 688 flow [2025-01-09 21:33:29,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 306 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:29,409 INFO L231 Difference]: Finished difference. Result has 309 places, 306 transitions, 637 flow [2025-01-09 21:33:29,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=309, PETRI_TRANSITIONS=306} [2025-01-09 21:33:29,409 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -98 predicate places. [2025-01-09 21:33:29,410 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 637 flow [2025-01-09 21:33:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:29,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:29,411 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:29,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash 897716444, now seen corresponding path program 1 times [2025-01-09 21:33:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166635650] [2025-01-09 21:33:29,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:33:29,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:33:29,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,874 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:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166635650] [2025-01-09 21:33:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166635650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650219963] [2025-01-09 21:33:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:29,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:30,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 429 [2025-01-09 21:33:30,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 637 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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:30,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 429 [2025-01-09 21:33:30,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,361 INFO L124 PetriNetUnfolderBase]: 749/1985 cut-off events. [2025-01-09 21:33:30,361 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 21:33:30,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3327 conditions, 1985 events. 749/1985 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12085 event pairs, 488 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 3239. Up to 1039 conditions per place. [2025-01-09 21:33:30,369 INFO L140 encePairwiseOnDemand]: 411/429 looper letters, 46 selfloop transitions, 15 changer transitions 0/303 dead transitions. [2025-01-09 21:33:30,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 303 transitions, 753 flow [2025-01-09 21:33:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1736 transitions. [2025-01-09 21:33:30,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6744366744366744 [2025-01-09 21:33:30,373 INFO L175 Difference]: Start difference. First operand has 309 places, 306 transitions, 637 flow. Second operand 6 states and 1736 transitions. [2025-01-09 21:33:30,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 303 transitions, 753 flow [2025-01-09 21:33:30,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 303 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:30,377 INFO L231 Difference]: Finished difference. Result has 309 places, 303 transitions, 657 flow [2025-01-09 21:33:30,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=657, PETRI_PLACES=309, PETRI_TRANSITIONS=303} [2025-01-09 21:33:30,378 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -98 predicate places. [2025-01-09 21:33:30,378 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 303 transitions, 657 flow [2025-01-09 21:33:30,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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:30,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:30,379 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] [2025-01-09 21:33:30,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:30,379 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:30,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash -803443091, now seen corresponding path program 1 times [2025-01-09 21:33:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:30,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936202662] [2025-01-09 21:33:30,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:30,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:30,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:33:30,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:33:30,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,420 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:30,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936202662] [2025-01-09 21:33:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936202662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:30,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316086299] [2025-01-09 21:33:30,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:30,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:30,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 429 [2025-01-09 21:33:30,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 303 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:30,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 429 [2025-01-09 21:33:30,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,622 INFO L124 PetriNetUnfolderBase]: 749/1984 cut-off events. [2025-01-09 21:33:30,622 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 21:33:30,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 1984 events. 749/1984 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12092 event pairs, 488 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 3253. Up to 1016 conditions per place. [2025-01-09 21:33:30,629 INFO L140 encePairwiseOnDemand]: 427/429 looper letters, 24 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2025-01-09 21:33:30,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 302 transitions, 705 flow [2025-01-09 21:33:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-01-09 21:33:30,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-01-09 21:33:30,632 INFO L175 Difference]: Start difference. First operand has 309 places, 303 transitions, 657 flow. Second operand 3 states and 975 transitions. [2025-01-09 21:33:30,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 302 transitions, 705 flow [2025-01-09 21:33:30,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 302 transitions, 675 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:30,635 INFO L231 Difference]: Finished difference. Result has 305 places, 302 transitions, 627 flow [2025-01-09 21:33:30,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=305, PETRI_TRANSITIONS=302} [2025-01-09 21:33:30,636 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -102 predicate places. [2025-01-09 21:33:30,636 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 302 transitions, 627 flow [2025-01-09 21:33:30,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:30,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:30,637 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] [2025-01-09 21:33:30,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:30,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:30,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash 803785191, now seen corresponding path program 1 times [2025-01-09 21:33:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:30,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648841816] [2025-01-09 21:33:30,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:30,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 21:33:30,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 21:33:30,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,670 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:30,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648841816] [2025-01-09 21:33:30,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648841816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:30,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790359747] [2025-01-09 21:33:30,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:30,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:30,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:30,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-01-09 21:33:30,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 302 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:30,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-01-09 21:33:30,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,896 INFO L124 PetriNetUnfolderBase]: 749/1983 cut-off events. [2025-01-09 21:33:30,896 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 21:33:30,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1983 events. 749/1983 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12068 event pairs, 488 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 3201. Up to 1018 conditions per place. [2025-01-09 21:33:30,903 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 25 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-01-09 21:33:30,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 301 transitions, 679 flow [2025-01-09 21:33:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:30,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-01-09 21:33:30,906 INFO L175 Difference]: Start difference. First operand has 305 places, 302 transitions, 627 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:30,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 301 transitions, 679 flow [2025-01-09 21:33:30,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 301 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:30,951 INFO L231 Difference]: Finished difference. Result has 305 places, 301 transitions, 628 flow [2025-01-09 21:33:30,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2025-01-09 21:33:30,952 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -102 predicate places. [2025-01-09 21:33:30,952 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 628 flow [2025-01-09 21:33:30,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:30,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:30,953 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] [2025-01-09 21:33:30,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:30,953 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:30,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash 489257700, now seen corresponding path program 1 times [2025-01-09 21:33:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:30,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465268521] [2025-01-09 21:33:30,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:30,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:33:30,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:33:30,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,987 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:30,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465268521] [2025-01-09 21:33:30,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465268521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:30,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014988684] [2025-01-09 21:33:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:30,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:30,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:30,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-01-09 21:33:30,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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:30,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-01-09 21:33:30,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,202 INFO L124 PetriNetUnfolderBase]: 749/1981 cut-off events. [2025-01-09 21:33:31,203 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 21:33:31,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 1981 events. 749/1981 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12085 event pairs, 488 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 3201. Up to 1018 conditions per place. [2025-01-09 21:33:31,211 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 26 selfloop transitions, 1 changer transitions 0/299 dead transitions. [2025-01-09 21:33:31,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 299 transitions, 678 flow [2025-01-09 21:33:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2025-01-09 21:33:31,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752913752913753 [2025-01-09 21:33:31,213 INFO L175 Difference]: Start difference. First operand has 305 places, 301 transitions, 628 flow. Second operand 3 states and 969 transitions. [2025-01-09 21:33:31,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 299 transitions, 678 flow [2025-01-09 21:33:31,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 299 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:31,216 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 622 flow [2025-01-09 21:33:31,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2025-01-09 21:33:31,217 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -104 predicate places. [2025-01-09 21:33:31,217 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 622 flow [2025-01-09 21:33:31,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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:31,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:31,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:31,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:31,218 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1452778784, now seen corresponding path program 1 times [2025-01-09 21:33:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533654613] [2025-01-09 21:33:31,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:31,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:33:31,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:33:31,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:31,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:31,274 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:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533654613] [2025-01-09 21:33:31,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533654613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:31,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:31,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571233400] [2025-01-09 21:33:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:31,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:31,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:31,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:31,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-01-09 21:33:31,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:31,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:31,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-01-09 21:33:31,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,776 INFO L124 PetriNetUnfolderBase]: 749/1980 cut-off events. [2025-01-09 21:33:31,777 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 21:33:31,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 1980 events. 749/1980 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12081 event pairs, 488 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 3199. Up to 1018 conditions per place. [2025-01-09 21:33:31,789 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 25 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-01-09 21:33:31,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 298 transitions, 674 flow [2025-01-09 21:33:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:31,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-01-09 21:33:31,791 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 622 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:31,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 298 transitions, 674 flow [2025-01-09 21:33:31,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 298 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:31,798 INFO L231 Difference]: Finished difference. Result has 303 places, 298 transitions, 623 flow [2025-01-09 21:33:31,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=303, PETRI_TRANSITIONS=298} [2025-01-09 21:33:31,803 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -104 predicate places. [2025-01-09 21:33:31,803 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 298 transitions, 623 flow [2025-01-09 21:33:31,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:31,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:31,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:31,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:31,804 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 74024508, now seen corresponding path program 1 times [2025-01-09 21:33:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:31,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778852094] [2025-01-09 21:33:31,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:31,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 21:33:31,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 21:33:31,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:31,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:31,921 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:31,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:31,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778852094] [2025-01-09 21:33:31,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778852094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:31,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:31,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:31,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286149640] [2025-01-09 21:33:31,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:31,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:31,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:31,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:31,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 429 [2025-01-09 21:33:31,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 298 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 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:31,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:31,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 429 [2025-01-09 21:33:31,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:32,363 INFO L124 PetriNetUnfolderBase]: 749/1976 cut-off events. [2025-01-09 21:33:32,363 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 21:33:32,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 1976 events. 749/1976 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12022 event pairs, 488 based on Foata normal form. 4/1773 useless extension candidates. Maximal degree in co-relation 3197. Up to 1015 conditions per place. [2025-01-09 21:33:32,373 INFO L140 encePairwiseOnDemand]: 427/429 looper letters, 0 selfloop transitions, 0 changer transitions 297/297 dead transitions. [2025-01-09 21:33:32,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 297 transitions, 667 flow [2025-01-09 21:33:32,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2025-01-09 21:33:32,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583527583527584 [2025-01-09 21:33:32,378 INFO L175 Difference]: Start difference. First operand has 303 places, 298 transitions, 623 flow. Second operand 3 states and 976 transitions. [2025-01-09 21:33:32,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 297 transitions, 667 flow [2025-01-09 21:33:32,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 297 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:32,385 INFO L231 Difference]: Finished difference. Result has 302 places, 0 transitions, 0 flow [2025-01-09 21:33:32,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=302, PETRI_TRANSITIONS=0} [2025-01-09 21:33:32,386 INFO L279 CegarLoopForPetriNet]: 407 programPoint places, -105 predicate places. [2025-01-09 21:33:32,386 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 0 transitions, 0 flow [2025-01-09 21:33:32,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 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:32,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (181 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (180 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (179 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (178 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (177 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (176 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (175 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (174 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (173 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (172 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (171 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (170 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (169 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (168 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (167 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (166 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (165 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (164 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (163 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (162 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (161 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (160 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (159 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (158 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (157 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (156 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (155 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (154 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (153 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (152 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (151 of 182 remaining) [2025-01-09 21:33:32,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (150 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (149 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (148 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (147 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (146 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (145 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (144 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (143 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (142 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (141 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (140 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (139 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (138 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (137 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (136 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (135 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (134 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (133 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (132 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (131 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (130 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (129 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (128 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (127 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (126 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (125 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (124 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (123 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (122 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (121 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (120 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (119 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (118 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (117 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (116 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (115 of 182 remaining) [2025-01-09 21:33:32,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (114 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (113 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (112 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (111 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (110 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (109 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (108 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (107 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (106 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (105 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (104 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (103 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (98 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (97 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (96 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (94 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (93 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (92 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (91 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (90 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (89 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (88 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (87 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (86 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (85 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (83 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (82 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (81 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (80 of 182 remaining) [2025-01-09 21:33:32,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (79 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (60 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (58 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (51 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 182 remaining) [2025-01-09 21:33:32,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (49 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (46 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (45 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (44 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (42 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (40 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 182 remaining) [2025-01-09 21:33:32,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 182 remaining) [2025-01-09 21:33:32,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 182 remaining) [2025-01-09 21:33:32,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 182 remaining) [2025-01-09 21:33:32,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:32,401 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:32,406 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:32,406 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:32,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:32 BasicIcfg [2025-01-09 21:33:32,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:32,413 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:32,413 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:32,413 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:32,413 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:24" (3/4) ... [2025-01-09 21:33:32,414 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:32,416 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:32,417 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:32,417 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:32,417 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:33:32,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-01-09 21:33:32,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:32,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:33:32,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:32,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:32,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:32,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:32,497 INFO L158 Benchmark]: Toolchain (without parser) took 9627.17ms. Allocated memory was 142.6MB in the beginning and 713.0MB in the end (delta: 570.4MB). Free memory was 113.2MB in the beginning and 359.1MB in the end (delta: -245.9MB). Peak memory consumption was 319.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,497 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:32,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.67ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.43ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 94.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:32,499 INFO L158 Benchmark]: Boogie Preprocessor took 95.28ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:32,499 INFO L158 Benchmark]: RCFGBuilder took 1479.92ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 64.1MB in the end (delta: 27.4MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,500 INFO L158 Benchmark]: TraceAbstraction took 7561.45ms. Allocated memory was 142.6MB in the beginning and 713.0MB in the end (delta: 570.4MB). Free memory was 63.0MB in the beginning and 367.4MB in the end (delta: -304.4MB). Peak memory consumption was 266.0MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,500 INFO L158 Benchmark]: Witness Printer took 83.51ms. Allocated memory is still 713.0MB. Free memory was 367.4MB in the beginning and 359.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,502 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.67ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.43ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 94.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 95.28ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1479.92ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 64.1MB in the end (delta: 27.4MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7561.45ms. Allocated memory was 142.6MB in the beginning and 713.0MB in the end (delta: 570.4MB). Free memory was 63.0MB in the beginning and 367.4MB in the end (delta: -304.4MB). Peak memory consumption was 266.0MB. Max. memory is 16.1GB. * Witness Printer took 83.51ms. Allocated memory is still 713.0MB. Free memory was 367.4MB in the beginning and 359.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: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 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: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: 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: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: 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: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: 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: 108]: 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: 108]: 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: 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: 112]: 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: 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: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: 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 9 procedures, 530 locations, 182 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: 7.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1015 IncrementalHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 54 mSDtfsCounter, 1015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=840occurred in iteration=0, InterpolantAutomatonStates: 54, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 99 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:32,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE