./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-dot-product.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-bad-dot-product.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 39e90898aa78f5642c5c7d6f9df6b2e15e069a046a9465d5d61576c4b07f46b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:49,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:49,807 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:32:49,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:49,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:49,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:49,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:49,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:49,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:49,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:49,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:49,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:49,827 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:49,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:49,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:49,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:49,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:49,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:49,828 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:49,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:49,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:49,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:49,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:49,829 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 -> 39e90898aa78f5642c5c7d6f9df6b2e15e069a046a9465d5d61576c4b07f46b8 [2025-01-09 21:32:50,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:50,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:50,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:50,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:50,085 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:50,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2025-01-09 21:32:51,187 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2106057a6/b5a2174699224ed3be68bd5125f70436/FLAG517cc0b9c [2025-01-09 21:32:51,467 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:51,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2025-01-09 21:32:51,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2106057a6/b5a2174699224ed3be68bd5125f70436/FLAG517cc0b9c [2025-01-09 21:32:51,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2106057a6/b5a2174699224ed3be68bd5125f70436 [2025-01-09 21:32:51,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:51,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:51,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:51,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:51,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:51,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51, skipping insertion in model container [2025-01-09 21:32:51,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:51,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:51,677 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:51,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:51,724 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:51,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51 WrapperNode [2025-01-09 21:32:51,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:51,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:51,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:51,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:51,730 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:32:51" (1/1) ... [2025-01-09 21:32:51,737 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:32:51" (1/1) ... [2025-01-09 21:32:51,766 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 409 [2025-01-09 21:32:51,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:51,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:51,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:51,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:51,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:51,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:51,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:51,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:51,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (1/1) ... [2025-01-09 21:32:51,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:51,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:51,837 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:32:51,839 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:32:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:51,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:51,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:51,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:51,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:32:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:32:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:32:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:32:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:51,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:32:51,857 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:32:51,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:51,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:52,451 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:52,451 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:52,737 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:52,738 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-09 21:32:52,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:52 BoogieIcfgContainer [2025-01-09 21:32:52,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:52,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:52,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:52,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:52,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:51" (1/3) ... [2025-01-09 21:32:52,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493075f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:52, skipping insertion in model container [2025-01-09 21:32:52,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:51" (2/3) ... [2025-01-09 21:32:52,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493075f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:52, skipping insertion in model container [2025-01-09 21:32:52,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:52" (3/3) ... [2025-01-09 21:32:52,754 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2025-01-09 21:32:52,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:52,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-dot-product.wvr.c that has 4 procedures, 388 locations, 1 initial locations, 8 loop locations, and 45 error locations. [2025-01-09 21:32:52,776 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:52,958 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:32:53,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 411 transitions, 843 flow [2025-01-09 21:32:53,124 INFO L124 PetriNetUnfolderBase]: 24/408 cut-off events. [2025-01-09 21:32:53,126 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:32:53,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 408 events. 24/408 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 814 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 320. Up to 2 conditions per place. [2025-01-09 21:32:53,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 411 transitions, 843 flow [2025-01-09 21:32:53,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 378 places, 391 transitions, 800 flow [2025-01-09 21:32:53,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:53,150 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;@5c593751, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:53,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-01-09 21:32:53,154 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:53,154 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:32:53,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:53,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:53,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:53,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:53,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2120597455, now seen corresponding path program 1 times [2025-01-09 21:32:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531105533] [2025-01-09 21:32:53,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:53,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:32:53,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:32:53,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:53,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:53,291 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:32:53,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:53,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531105533] [2025-01-09 21:32:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531105533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:53,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:53,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685058724] [2025-01-09 21:32:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:53,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:53,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:53,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:53,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 411 [2025-01-09 21:32:53,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 391 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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:32:53,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:53,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 411 [2025-01-09 21:32:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:53,615 INFO L124 PetriNetUnfolderBase]: 75/1119 cut-off events. [2025-01-09 21:32:53,615 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:32:53,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 1119 events. 75/1119 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6030 event pairs, 38 based on Foata normal form. 78/1013 useless extension candidates. Maximal degree in co-relation 712. Up to 92 conditions per place. [2025-01-09 21:32:53,628 INFO L140 encePairwiseOnDemand]: 382/411 looper letters, 16 selfloop transitions, 2 changer transitions 5/364 dead transitions. [2025-01-09 21:32:53,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 364 transitions, 782 flow [2025-01-09 21:32:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-01-09 21:32:53,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197080291970803 [2025-01-09 21:32:53,647 INFO L175 Difference]: Start difference. First operand has 378 places, 391 transitions, 800 flow. Second operand 3 states and 1134 transitions. [2025-01-09 21:32:53,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 364 transitions, 782 flow [2025-01-09 21:32:53,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 364 transitions, 770 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:32:53,663 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 728 flow [2025-01-09 21:32:53,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2025-01-09 21:32:53,668 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -17 predicate places. [2025-01-09 21:32:53,669 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 728 flow [2025-01-09 21:32:53,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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:32:53,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:53,670 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] [2025-01-09 21:32:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:53,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1304630968, now seen corresponding path program 1 times [2025-01-09 21:32:53,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:53,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438688333] [2025-01-09 21:32:53,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:53,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:32:53,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:32:53,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:53,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:53,710 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:32:53,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438688333] [2025-01-09 21:32:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438688333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:53,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:53,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798215591] [2025-01-09 21:32:53,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:53,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:53,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:53,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:53,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:53,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 411 [2025-01-09 21:32:53,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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:32:53,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:53,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 411 [2025-01-09 21:32:53,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:53,909 INFO L124 PetriNetUnfolderBase]: 62/847 cut-off events. [2025-01-09 21:32:53,910 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:32:53,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 847 events. 62/847 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3738 event pairs, 34 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 916. Up to 85 conditions per place. [2025-01-09 21:32:53,917 INFO L140 encePairwiseOnDemand]: 408/411 looper letters, 16 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-01-09 21:32:53,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 762 flow [2025-01-09 21:32:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2025-01-09 21:32:53,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986212489862125 [2025-01-09 21:32:53,920 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 728 flow. Second operand 3 states and 1108 transitions. [2025-01-09 21:32:53,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 762 flow [2025-01-09 21:32:53,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:53,925 INFO L231 Difference]: Finished difference. Result has 355 places, 358 transitions, 726 flow [2025-01-09 21:32:53,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=355, PETRI_TRANSITIONS=358} [2025-01-09 21:32:53,926 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -23 predicate places. [2025-01-09 21:32:53,926 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 358 transitions, 726 flow [2025-01-09 21:32:53,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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:32:53,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:53,927 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] [2025-01-09 21:32:53,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:53,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:53,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash 462912072, now seen corresponding path program 1 times [2025-01-09 21:32:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:53,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-01-09 21:32:53,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:53,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:32:53,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:32:53,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:53,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:53,986 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:32:53,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:53,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-01-09 21:32:53,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509785143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:53,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:53,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:53,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648858663] [2025-01-09 21:32:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:53,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:53,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:53,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:53,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:54,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 411 [2025-01-09 21:32:54,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 358 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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:32:54,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:54,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 411 [2025-01-09 21:32:54,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:54,162 INFO L124 PetriNetUnfolderBase]: 85/1023 cut-off events. [2025-01-09 21:32:54,162 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:32:54,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 1023 events. 85/1023 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5466 event pairs, 56 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1115. Up to 113 conditions per place. [2025-01-09 21:32:54,170 INFO L140 encePairwiseOnDemand]: 408/411 looper letters, 16 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-01-09 21:32:54,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 760 flow [2025-01-09 21:32:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2025-01-09 21:32:54,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986212489862125 [2025-01-09 21:32:54,173 INFO L175 Difference]: Start difference. First operand has 355 places, 358 transitions, 726 flow. Second operand 3 states and 1108 transitions. [2025-01-09 21:32:54,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 760 flow [2025-01-09 21:32:54,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 357 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:54,178 INFO L231 Difference]: Finished difference. Result has 354 places, 357 transitions, 724 flow [2025-01-09 21:32:54,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=354, PETRI_TRANSITIONS=357} [2025-01-09 21:32:54,180 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -24 predicate places. [2025-01-09 21:32:54,180 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 357 transitions, 724 flow [2025-01-09 21:32:54,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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:32:54,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:54,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:54,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:54,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 895737625, now seen corresponding path program 1 times [2025-01-09 21:32:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520256670] [2025-01-09 21:32:54,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:54,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:32:54,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:32:54,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:54,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:54,237 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:32:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520256670] [2025-01-09 21:32:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520256670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:54,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:54,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355264695] [2025-01-09 21:32:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:54,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:54,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:54,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:54,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 411 [2025-01-09 21:32:54,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 357 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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:32:54,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:54,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 411 [2025-01-09 21:32:54,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:54,410 INFO L124 PetriNetUnfolderBase]: 99/1075 cut-off events. [2025-01-09 21:32:54,410 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:32:54,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 1075 events. 99/1075 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5722 event pairs, 59 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1181. Up to 135 conditions per place. [2025-01-09 21:32:54,421 INFO L140 encePairwiseOnDemand]: 406/411 looper letters, 17 selfloop transitions, 1 changer transitions 0/353 dead transitions. [2025-01-09 21:32:54,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 353 transitions, 752 flow [2025-01-09 21:32:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2025-01-09 21:32:54,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8961881589618816 [2025-01-09 21:32:54,425 INFO L175 Difference]: Start difference. First operand has 354 places, 357 transitions, 724 flow. Second operand 3 states and 1105 transitions. [2025-01-09 21:32:54,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 353 transitions, 752 flow [2025-01-09 21:32:54,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 353 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:54,430 INFO L231 Difference]: Finished difference. Result has 350 places, 353 transitions, 714 flow [2025-01-09 21:32:54,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=350, PETRI_TRANSITIONS=353} [2025-01-09 21:32:54,432 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -28 predicate places. [2025-01-09 21:32:54,432 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 353 transitions, 714 flow [2025-01-09 21:32:54,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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:32:54,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:54,433 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:32:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:54,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:54,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash 825923281, now seen corresponding path program 1 times [2025-01-09 21:32:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025979376] [2025-01-09 21:32:54,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:54,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:32:54,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:32:54,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:54,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:54,510 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:32:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:54,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025979376] [2025-01-09 21:32:54,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025979376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:54,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:54,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692674396] [2025-01-09 21:32:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:54,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:54,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:54,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 411 [2025-01-09 21:32:54,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 353 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 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:32:54,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:54,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 411 [2025-01-09 21:32:54,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:54,729 INFO L124 PetriNetUnfolderBase]: 212/1657 cut-off events. [2025-01-09 21:32:54,729 INFO L125 PetriNetUnfolderBase]: For 32/35 co-relation queries the response was YES. [2025-01-09 21:32:54,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 1657 events. 212/1657 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10954 event pairs, 135 based on Foata normal form. 0/1417 useless extension candidates. Maximal degree in co-relation 1915. Up to 280 conditions per place. [2025-01-09 21:32:54,744 INFO L140 encePairwiseOnDemand]: 408/411 looper letters, 18 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2025-01-09 21:32:54,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 352 transitions, 752 flow [2025-01-09 21:32:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1104 transitions. [2025-01-09 21:32:54,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8953771289537713 [2025-01-09 21:32:54,749 INFO L175 Difference]: Start difference. First operand has 350 places, 353 transitions, 714 flow. Second operand 3 states and 1104 transitions. [2025-01-09 21:32:54,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 352 transitions, 752 flow [2025-01-09 21:32:54,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 352 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:54,754 INFO L231 Difference]: Finished difference. Result has 350 places, 352 transitions, 715 flow [2025-01-09 21:32:54,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=350, PETRI_TRANSITIONS=352} [2025-01-09 21:32:54,757 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -28 predicate places. [2025-01-09 21:32:54,757 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 352 transitions, 715 flow [2025-01-09 21:32:54,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 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:32:54,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:54,758 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:32:54,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:54,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:54,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1792768860, now seen corresponding path program 1 times [2025-01-09 21:32:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428280989] [2025-01-09 21:32:54,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:54,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:32:54,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:32:54,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:54,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:55,245 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:32:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:55,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428280989] [2025-01-09 21:32:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428280989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:55,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:55,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104369869] [2025-01-09 21:32:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:55,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:55,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:55,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:55,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 411 [2025-01-09 21:32:55,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 352 transitions, 715 flow. Second operand has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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:32:55,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:55,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 411 [2025-01-09 21:32:55,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:56,694 INFO L124 PetriNetUnfolderBase]: 2877/11744 cut-off events. [2025-01-09 21:32:56,695 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-01-09 21:32:56,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15903 conditions, 11744 events. 2877/11744 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 125384 event pairs, 2079 based on Foata normal form. 0/9821 useless extension candidates. Maximal degree in co-relation 15856. Up to 4033 conditions per place. [2025-01-09 21:32:56,778 INFO L140 encePairwiseOnDemand]: 399/411 looper letters, 49 selfloop transitions, 10 changer transitions 0/350 dead transitions. [2025-01-09 21:32:56,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 350 transitions, 829 flow [2025-01-09 21:32:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:32:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:32:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2025-01-09 21:32:56,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8081914030819141 [2025-01-09 21:32:56,782 INFO L175 Difference]: Start difference. First operand has 350 places, 352 transitions, 715 flow. Second operand 6 states and 1993 transitions. [2025-01-09 21:32:56,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 350 transitions, 829 flow [2025-01-09 21:32:56,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 350 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:56,790 INFO L231 Difference]: Finished difference. Result has 351 places, 350 transitions, 727 flow [2025-01-09 21:32:56,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=727, PETRI_PLACES=351, PETRI_TRANSITIONS=350} [2025-01-09 21:32:56,791 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -27 predicate places. [2025-01-09 21:32:56,791 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 350 transitions, 727 flow [2025-01-09 21:32:56,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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:32:56,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:56,792 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:32:56,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:56,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:56,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1394747519, now seen corresponding path program 1 times [2025-01-09 21:32:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163781394] [2025-01-09 21:32:56,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:56,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:32:56,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:32:56,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:56,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:56,828 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:32:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163781394] [2025-01-09 21:32:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163781394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:56,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:56,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028311695] [2025-01-09 21:32:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:56,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:56,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:56,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:56,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 411 [2025-01-09 21:32:56,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 350 transitions, 727 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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:32:56,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:56,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 411 [2025-01-09 21:32:56,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:57,153 INFO L124 PetriNetUnfolderBase]: 267/2525 cut-off events. [2025-01-09 21:32:57,153 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 21:32:57,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 2525 events. 267/2525 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 19497 event pairs, 135 based on Foata normal form. 0/2143 useless extension candidates. Maximal degree in co-relation 2850. Up to 322 conditions per place. [2025-01-09 21:32:57,277 INFO L140 encePairwiseOnDemand]: 406/411 looper letters, 17 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2025-01-09 21:32:57,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 346 transitions, 755 flow [2025-01-09 21:32:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2025-01-09 21:32:57,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8961881589618816 [2025-01-09 21:32:57,289 INFO L175 Difference]: Start difference. First operand has 351 places, 350 transitions, 727 flow. Second operand 3 states and 1105 transitions. [2025-01-09 21:32:57,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 346 transitions, 755 flow [2025-01-09 21:32:57,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 346 transitions, 735 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:57,294 INFO L231 Difference]: Finished difference. Result has 344 places, 346 transitions, 701 flow [2025-01-09 21:32:57,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=344, PETRI_TRANSITIONS=346} [2025-01-09 21:32:57,297 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -34 predicate places. [2025-01-09 21:32:57,297 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 346 transitions, 701 flow [2025-01-09 21:32:57,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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:32:57,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:57,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:57,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:57,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:57,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash 651708969, now seen corresponding path program 1 times [2025-01-09 21:32:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:57,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230212157] [2025-01-09 21:32:57,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:57,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:32:57,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:32:57,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:57,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:57,352 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:32:57,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:57,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230212157] [2025-01-09 21:32:57,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230212157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:57,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:57,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:57,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692815405] [2025-01-09 21:32:57,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:57,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:57,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:57,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:57,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 411 [2025-01-09 21:32:57,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 346 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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:32:57,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:57,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 411 [2025-01-09 21:32:57,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:57,419 INFO L124 PetriNetUnfolderBase]: 32/597 cut-off events. [2025-01-09 21:32:57,419 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:57,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 597 events. 32/597 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1966 event pairs, 15 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 602. Up to 40 conditions per place. [2025-01-09 21:32:57,421 INFO L140 encePairwiseOnDemand]: 408/411 looper letters, 12 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-01-09 21:32:57,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 345 transitions, 727 flow [2025-01-09 21:32:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1116 transitions. [2025-01-09 21:32:57,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051094890510949 [2025-01-09 21:32:57,424 INFO L175 Difference]: Start difference. First operand has 344 places, 346 transitions, 701 flow. Second operand 3 states and 1116 transitions. [2025-01-09 21:32:57,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 345 transitions, 727 flow [2025-01-09 21:32:57,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 345 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:57,428 INFO L231 Difference]: Finished difference. Result has 344 places, 345 transitions, 702 flow [2025-01-09 21:32:57,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=344, PETRI_TRANSITIONS=345} [2025-01-09 21:32:57,429 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -34 predicate places. [2025-01-09 21:32:57,430 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 345 transitions, 702 flow [2025-01-09 21:32:57,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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:32:57,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:57,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:57,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:57,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:57,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash 295421413, now seen corresponding path program 1 times [2025-01-09 21:32:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994644988] [2025-01-09 21:32:57,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:57,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:32:57,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:32:57,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:57,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:57,481 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:32:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994644988] [2025-01-09 21:32:57,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994644988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:57,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329400444] [2025-01-09 21:32:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:57,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:57,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:57,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:57,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 411 [2025-01-09 21:32:57,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 345 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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:32:57,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:57,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 411 [2025-01-09 21:32:57,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:57,597 INFO L124 PetriNetUnfolderBase]: 123/1366 cut-off events. [2025-01-09 21:32:57,597 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-09 21:32:57,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535 conditions, 1366 events. 123/1366 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8473 event pairs, 71 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 1487. Up to 150 conditions per place. [2025-01-09 21:32:57,606 INFO L140 encePairwiseOnDemand]: 406/411 looper letters, 17 selfloop transitions, 1 changer transitions 0/341 dead transitions. [2025-01-09 21:32:57,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 341 transitions, 730 flow [2025-01-09 21:32:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2025-01-09 21:32:57,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8961881589618816 [2025-01-09 21:32:57,609 INFO L175 Difference]: Start difference. First operand has 344 places, 345 transitions, 702 flow. Second operand 3 states and 1105 transitions. [2025-01-09 21:32:57,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 341 transitions, 730 flow [2025-01-09 21:32:57,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 341 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:57,613 INFO L231 Difference]: Finished difference. Result has 340 places, 341 transitions, 692 flow [2025-01-09 21:32:57,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=340, PETRI_TRANSITIONS=341} [2025-01-09 21:32:57,614 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -38 predicate places. [2025-01-09 21:32:57,614 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 341 transitions, 692 flow [2025-01-09 21:32:57,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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:32:57,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:57,616 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] [2025-01-09 21:32:57,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:57,616 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:57,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 91617786, now seen corresponding path program 1 times [2025-01-09 21:32:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636422369] [2025-01-09 21:32:57,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:57,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 21:32:57,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 21:32:57,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:57,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:57,678 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:32:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636422369] [2025-01-09 21:32:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636422369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001183320] [2025-01-09 21:32:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:57,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:57,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:57,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 411 [2025-01-09 21:32:57,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 341 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 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:32:57,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:57,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 411 [2025-01-09 21:32:57,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:58,152 INFO L124 PetriNetUnfolderBase]: 771/4413 cut-off events. [2025-01-09 21:32:58,152 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-09 21:32:58,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 4413 events. 771/4413 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 39576 event pairs, 325 based on Foata normal form. 0/3896 useless extension candidates. Maximal degree in co-relation 5448. Up to 1026 conditions per place. [2025-01-09 21:32:58,169 INFO L140 encePairwiseOnDemand]: 402/411 looper letters, 27 selfloop transitions, 3 changer transitions 0/343 dead transitions. [2025-01-09 21:32:58,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 343 transitions, 761 flow [2025-01-09 21:32:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2025-01-09 21:32:58,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8929440389294404 [2025-01-09 21:32:58,172 INFO L175 Difference]: Start difference. First operand has 340 places, 341 transitions, 692 flow. Second operand 3 states and 1101 transitions. [2025-01-09 21:32:58,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 343 transitions, 761 flow [2025-01-09 21:32:58,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 343 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:58,177 INFO L231 Difference]: Finished difference. Result has 336 places, 338 transitions, 700 flow [2025-01-09 21:32:58,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=336, PETRI_TRANSITIONS=338} [2025-01-09 21:32:58,179 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -42 predicate places. [2025-01-09 21:32:58,179 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 338 transitions, 700 flow [2025-01-09 21:32:58,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 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:32:58,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:58,180 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] [2025-01-09 21:32:58,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:58,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1137155842, now seen corresponding path program 1 times [2025-01-09 21:32:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285751699] [2025-01-09 21:32:58,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:58,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:32:58,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:32:58,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:58,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:58,310 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:32:58,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285751699] [2025-01-09 21:32:58,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285751699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:58,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:58,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:32:58,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449927632] [2025-01-09 21:32:58,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:58,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:32:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:58,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:32:58,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:32:58,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 411 [2025-01-09 21:32:58,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 338 transitions, 700 flow. Second operand has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 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:32:58,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:58,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 411 [2025-01-09 21:32:58,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:58,794 INFO L124 PetriNetUnfolderBase]: 217/2201 cut-off events. [2025-01-09 21:32:58,794 INFO L125 PetriNetUnfolderBase]: For 21/48 co-relation queries the response was YES. [2025-01-09 21:32:58,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 2201 events. 217/2201 cut-off events. For 21/48 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15508 event pairs, 79 based on Foata normal form. 9/2002 useless extension candidates. Maximal degree in co-relation 2562. Up to 188 conditions per place. [2025-01-09 21:32:58,812 INFO L140 encePairwiseOnDemand]: 398/411 looper letters, 47 selfloop transitions, 14 changer transitions 0/366 dead transitions. [2025-01-09 21:32:58,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 366 transitions, 886 flow [2025-01-09 21:32:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:32:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:32:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3562 transitions. [2025-01-09 21:32:58,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-01-09 21:32:58,818 INFO L175 Difference]: Start difference. First operand has 336 places, 338 transitions, 700 flow. Second operand 10 states and 3562 transitions. [2025-01-09 21:32:58,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 366 transitions, 886 flow [2025-01-09 21:32:58,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 366 transitions, 886 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:32:58,822 INFO L231 Difference]: Finished difference. Result has 349 places, 345 transitions, 766 flow [2025-01-09 21:32:58,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=766, PETRI_PLACES=349, PETRI_TRANSITIONS=345} [2025-01-09 21:32:58,823 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -29 predicate places. [2025-01-09 21:32:58,823 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 345 transitions, 766 flow [2025-01-09 21:32:58,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 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:32:58,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:58,825 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] [2025-01-09 21:32:58,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:58,825 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:58,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1896550259, now seen corresponding path program 1 times [2025-01-09 21:32:58,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128179675] [2025-01-09 21:32:58,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:58,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:32:58,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:32:58,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:58,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:58,940 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:32:58,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:58,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128179675] [2025-01-09 21:32:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128179675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:58,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:58,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392319114] [2025-01-09 21:32:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:32:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:58,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:32:58,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:32:58,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 411 [2025-01-09 21:32:58,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 345 transitions, 766 flow. Second operand has 5 states, 5 states have (on average 363.0) internal successors, (1815), 5 states have internal predecessors, (1815), 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:32:58,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:58,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 411 [2025-01-09 21:32:58,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:59,282 INFO L124 PetriNetUnfolderBase]: 337/2694 cut-off events. [2025-01-09 21:32:59,283 INFO L125 PetriNetUnfolderBase]: For 101/147 co-relation queries the response was YES. [2025-01-09 21:32:59,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 2694 events. 337/2694 cut-off events. For 101/147 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 19122 event pairs, 129 based on Foata normal form. 18/2423 useless extension candidates. Maximal degree in co-relation 3289. Up to 327 conditions per place. [2025-01-09 21:32:59,304 INFO L140 encePairwiseOnDemand]: 405/411 looper letters, 31 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2025-01-09 21:32:59,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 360 transitions, 876 flow [2025-01-09 21:32:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:32:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:32:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1842 transitions. [2025-01-09 21:32:59,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963503649635036 [2025-01-09 21:32:59,308 INFO L175 Difference]: Start difference. First operand has 349 places, 345 transitions, 766 flow. Second operand 5 states and 1842 transitions. [2025-01-09 21:32:59,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 360 transitions, 876 flow [2025-01-09 21:32:59,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 360 transitions, 872 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:59,313 INFO L231 Difference]: Finished difference. Result has 354 places, 347 transitions, 787 flow [2025-01-09 21:32:59,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=787, PETRI_PLACES=354, PETRI_TRANSITIONS=347} [2025-01-09 21:32:59,314 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -24 predicate places. [2025-01-09 21:32:59,314 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 347 transitions, 787 flow [2025-01-09 21:32:59,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 363.0) internal successors, (1815), 5 states have internal predecessors, (1815), 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:32:59,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:59,316 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:32:59,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:59,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:32:59,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1405326594, now seen corresponding path program 1 times [2025-01-09 21:32:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267163371] [2025-01-09 21:32:59,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:59,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:32:59,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:32:59,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:59,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:59,642 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:32:59,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:59,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267163371] [2025-01-09 21:32:59,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267163371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:59,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:59,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:32:59,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890635203] [2025-01-09 21:32:59,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:59,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:32:59,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:59,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:32:59,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:32:59,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 411 [2025-01-09 21:32:59,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 347 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 350.6666666666667) internal successors, (2104), 6 states have internal predecessors, (2104), 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:32:59,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:59,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 411 [2025-01-09 21:32:59,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:00,453 INFO L124 PetriNetUnfolderBase]: 511/2768 cut-off events. [2025-01-09 21:33:00,453 INFO L125 PetriNetUnfolderBase]: For 302/356 co-relation queries the response was YES. [2025-01-09 21:33:00,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 2768 events. 511/2768 cut-off events. For 302/356 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 21178 event pairs, 110 based on Foata normal form. 4/2460 useless extension candidates. Maximal degree in co-relation 3815. Up to 332 conditions per place. [2025-01-09 21:33:00,481 INFO L140 encePairwiseOnDemand]: 404/411 looper letters, 45 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2025-01-09 21:33:00,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 923 flow [2025-01-09 21:33:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2025-01-09 21:33:00,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8694241686942417 [2025-01-09 21:33:00,486 INFO L175 Difference]: Start difference. First operand has 354 places, 347 transitions, 787 flow. Second operand 6 states and 2144 transitions. [2025-01-09 21:33:00,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 923 flow [2025-01-09 21:33:00,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 361 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:00,492 INFO L231 Difference]: Finished difference. Result has 355 places, 345 transitions, 788 flow [2025-01-09 21:33:00,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=355, PETRI_TRANSITIONS=345} [2025-01-09 21:33:00,493 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -23 predicate places. [2025-01-09 21:33:00,493 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 345 transitions, 788 flow [2025-01-09 21:33:00,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 350.6666666666667) internal successors, (2104), 6 states have internal predecessors, (2104), 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:00,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:00,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:00,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:00,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:33:00,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash -24557747, now seen corresponding path program 1 times [2025-01-09 21:33:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435457247] [2025-01-09 21:33:00,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:00,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:33:00,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:33:00,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:00,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:00,851 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:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:00,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435457247] [2025-01-09 21:33:00,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435457247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:00,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:00,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680408214] [2025-01-09 21:33:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:00,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:00,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:00,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:01,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 411 [2025-01-09 21:33:01,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 345 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 350.8333333333333) internal successors, (2105), 6 states have internal predecessors, (2105), 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:01,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:01,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 411 [2025-01-09 21:33:01,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:01,609 INFO L124 PetriNetUnfolderBase]: 651/2941 cut-off events. [2025-01-09 21:33:01,610 INFO L125 PetriNetUnfolderBase]: For 311/432 co-relation queries the response was YES. [2025-01-09 21:33:01,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4165 conditions, 2941 events. 651/2941 cut-off events. For 311/432 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 22585 event pairs, 87 based on Foata normal form. 0/2675 useless extension candidates. Maximal degree in co-relation 4108. Up to 496 conditions per place. [2025-01-09 21:33:01,639 INFO L140 encePairwiseOnDemand]: 404/411 looper letters, 43 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-01-09 21:33:01,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 359 transitions, 920 flow [2025-01-09 21:33:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2025-01-09 21:33:01,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8694241686942417 [2025-01-09 21:33:01,645 INFO L175 Difference]: Start difference. First operand has 355 places, 345 transitions, 788 flow. Second operand 6 states and 2144 transitions. [2025-01-09 21:33:01,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 359 transitions, 920 flow [2025-01-09 21:33:01,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 359 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:01,651 INFO L231 Difference]: Finished difference. Result has 353 places, 343 transitions, 784 flow [2025-01-09 21:33:01,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=353, PETRI_TRANSITIONS=343} [2025-01-09 21:33:01,652 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -25 predicate places. [2025-01-09 21:33:01,652 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 343 transitions, 784 flow [2025-01-09 21:33:01,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 350.8333333333333) internal successors, (2105), 6 states have internal predecessors, (2105), 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:01,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:01,653 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] [2025-01-09 21:33:01,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:01,653 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:33:01,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1411421035, now seen corresponding path program 1 times [2025-01-09 21:33:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:01,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873313393] [2025-01-09 21:33:01,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:01,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:33:01,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:33:01,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:01,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:33:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873313393] [2025-01-09 21:33:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873313393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:01,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144285459] [2025-01-09 21:33:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:01,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:01,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:01,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:01,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:02,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 411 [2025-01-09 21:33:02,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 343 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:02,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:02,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 411 [2025-01-09 21:33:02,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:02,544 INFO L124 PetriNetUnfolderBase]: 350/2338 cut-off events. [2025-01-09 21:33:02,544 INFO L125 PetriNetUnfolderBase]: For 140/219 co-relation queries the response was YES. [2025-01-09 21:33:02,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 2338 events. 350/2338 cut-off events. For 140/219 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 18256 event pairs, 91 based on Foata normal form. 12/2189 useless extension candidates. Maximal degree in co-relation 3312. Up to 278 conditions per place. [2025-01-09 21:33:02,564 INFO L140 encePairwiseOnDemand]: 404/411 looper letters, 45 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-01-09 21:33:02,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 920 flow [2025-01-09 21:33:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2025-01-09 21:33:02,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8694241686942417 [2025-01-09 21:33:02,568 INFO L175 Difference]: Start difference. First operand has 353 places, 343 transitions, 784 flow. Second operand 6 states and 2144 transitions. [2025-01-09 21:33:02,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 920 flow [2025-01-09 21:33:02,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 357 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:02,573 INFO L231 Difference]: Finished difference. Result has 351 places, 341 transitions, 780 flow [2025-01-09 21:33:02,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=351, PETRI_TRANSITIONS=341} [2025-01-09 21:33:02,575 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -27 predicate places. [2025-01-09 21:33:02,575 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 341 transitions, 780 flow [2025-01-09 21:33:02,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:02,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:02,576 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] [2025-01-09 21:33:02,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:02,576 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:33:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash -241065307, now seen corresponding path program 1 times [2025-01-09 21:33:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320750015] [2025-01-09 21:33:02,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:02,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:33:02,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:33:02,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:02,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:02,615 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:02,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320750015] [2025-01-09 21:33:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320750015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:02,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:02,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516237181] [2025-01-09 21:33:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:02,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:02,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:02,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:02,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 411 [2025-01-09 21:33:02,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 341 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:02,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:02,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 411 [2025-01-09 21:33:02,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:02,770 INFO L124 PetriNetUnfolderBase]: 128/1639 cut-off events. [2025-01-09 21:33:02,771 INFO L125 PetriNetUnfolderBase]: For 43/68 co-relation queries the response was YES. [2025-01-09 21:33:02,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 1639 events. 128/1639 cut-off events. For 43/68 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9888 event pairs, 38 based on Foata normal form. 0/1536 useless extension candidates. Maximal degree in co-relation 1954. Up to 149 conditions per place. [2025-01-09 21:33:02,783 INFO L140 encePairwiseOnDemand]: 409/411 looper letters, 10 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2025-01-09 21:33:02,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 340 transitions, 800 flow [2025-01-09 21:33:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1125 transitions. [2025-01-09 21:33:02,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9124087591240876 [2025-01-09 21:33:02,785 INFO L175 Difference]: Start difference. First operand has 351 places, 341 transitions, 780 flow. Second operand 3 states and 1125 transitions. [2025-01-09 21:33:02,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 340 transitions, 800 flow [2025-01-09 21:33:02,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 340 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:02,788 INFO L231 Difference]: Finished difference. Result has 347 places, 340 transitions, 770 flow [2025-01-09 21:33:02,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=347, PETRI_TRANSITIONS=340} [2025-01-09 21:33:02,790 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -31 predicate places. [2025-01-09 21:33:02,790 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 340 transitions, 770 flow [2025-01-09 21:33:02,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:02,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:02,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:02,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:02,791 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:33:02,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash -373109266, now seen corresponding path program 1 times [2025-01-09 21:33:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:02,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016179794] [2025-01-09 21:33:02,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:02,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:02,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:33:02,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:33:02,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:02,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:02,831 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:02,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:02,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016179794] [2025-01-09 21:33:02,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016179794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:02,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:02,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:02,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112093780] [2025-01-09 21:33:02,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:02,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:02,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:02,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:02,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 411 [2025-01-09 21:33:02,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 340 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:02,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:02,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 411 [2025-01-09 21:33:02,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:02,980 INFO L124 PetriNetUnfolderBase]: 128/1631 cut-off events. [2025-01-09 21:33:02,981 INFO L125 PetriNetUnfolderBase]: For 43/68 co-relation queries the response was YES. [2025-01-09 21:33:02,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1631 events. 128/1631 cut-off events. For 43/68 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9843 event pairs, 38 based on Foata normal form. 8/1536 useless extension candidates. Maximal degree in co-relation 1917. Up to 149 conditions per place. [2025-01-09 21:33:02,991 INFO L140 encePairwiseOnDemand]: 409/411 looper letters, 0 selfloop transitions, 0 changer transitions 339/339 dead transitions. [2025-01-09 21:33:02,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 339 transitions, 788 flow [2025-01-09 21:33:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2025-01-09 21:33:02,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9115977291159773 [2025-01-09 21:33:02,993 INFO L175 Difference]: Start difference. First operand has 347 places, 340 transitions, 770 flow. Second operand 3 states and 1124 transitions. [2025-01-09 21:33:02,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 339 transitions, 788 flow [2025-01-09 21:33:02,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 339 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:02,996 INFO L231 Difference]: Finished difference. Result has 347 places, 0 transitions, 0 flow [2025-01-09 21:33:02,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=411, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=347, PETRI_TRANSITIONS=0} [2025-01-09 21:33:02,997 INFO L279 CegarLoopForPetriNet]: 378 programPoint places, -31 predicate places. [2025-01-09 21:33:02,997 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 0 transitions, 0 flow [2025-01-09 21:33:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:03,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 79 remaining) [2025-01-09 21:33:03,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-01-09 21:33:03,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-01-09 21:33:03,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-01-09 21:33:03,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-01-09 21:33:03,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-01-09 21:33:03,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-01-09 21:33:03,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-01-09 21:33:03,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-01-09 21:33:03,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-01-09 21:33:03,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-01-09 21:33:03,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-01-09 21:33:03,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-01-09 21:33:03,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:03,008 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:03,013 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:03,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:03,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:03 BasicIcfg [2025-01-09 21:33:03,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:03,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:03,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:03,021 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:03,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:52" (3/4) ... [2025-01-09 21:33:03,022 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:03,025 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:03,025 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:03,025 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:03,030 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-09 21:33:03,030 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:03,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:03,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:03,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:03,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:03,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:03,114 INFO L158 Benchmark]: Toolchain (without parser) took 11602.90ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 111.5MB in the beginning and 634.4MB in the end (delta: -522.9MB). Peak memory consumption was 675.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:03,115 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:03,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.44ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.0MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:03,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.72ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:03,116 INFO L158 Benchmark]: Boogie Preprocessor took 33.65ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:03,116 INFO L158 Benchmark]: RCFGBuilder took 937.64ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 84.4MB in the end (delta: 7.0MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2025-01-09 21:33:03,116 INFO L158 Benchmark]: TraceAbstraction took 10275.04ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 84.4MB in the beginning and 642.8MB in the end (delta: -558.4MB). Peak memory consumption was 643.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:03,116 INFO L158 Benchmark]: Witness Printer took 93.45ms. Allocated memory is still 1.3GB. Free memory was 642.8MB in the beginning and 634.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:03,118 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 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.44ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.0MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.72ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.65ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 91.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 937.64ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 84.4MB in the end (delta: 7.0MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10275.04ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 84.4MB in the beginning and 642.8MB in the end (delta: -558.4MB). Peak memory consumption was 643.8MB. Max. memory is 16.1GB. * Witness Printer took 93.45ms. Allocated memory is still 1.3GB. Free memory was 642.8MB in the beginning and 634.4MB 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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: 118]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 565 locations, 79 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: 10.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1460 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 548 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2294 IncrementalHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 385 mSolverCounterUnsat, 101 mSDtfsCounter, 2294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=0, InterpolantAutomatonStates: 72, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1796 NumberOfCodeBlocks, 1796 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 2551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 1/1 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 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:03,139 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