./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series.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 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:19,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:19,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:33:19,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:19,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:19,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:19,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:19,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:19,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:19,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:19,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:19,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:19,873 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:19,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:19,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:19,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:19,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:19,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:19,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:19,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:19,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:19,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:19,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:19,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:19,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:19,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:19,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:19,876 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 -> 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c [2025-01-09 21:33:20,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:20,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:20,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:20,105 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:20,106 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:20,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-01-09 21:33:21,296 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417b61689/0346520f2cb3406194c1d38831ae21f9/FLAGa0dbfc67c [2025-01-09 21:33:21,537 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:21,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2025-01-09 21:33:21,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417b61689/0346520f2cb3406194c1d38831ae21f9/FLAGa0dbfc67c [2025-01-09 21:33:21,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417b61689/0346520f2cb3406194c1d38831ae21f9 [2025-01-09 21:33:21,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:21,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:21,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:21,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:21,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:21,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:21" (1/1) ... [2025-01-09 21:33:21,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df74df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:21, skipping insertion in model container [2025-01-09 21:33:21,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:21" (1/1) ... [2025-01-09 21:33:21,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:22,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:22,034 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:22,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:22,072 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:22,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22 WrapperNode [2025-01-09 21:33:22,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:22,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:22,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:22,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:22,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,115 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 631 [2025-01-09 21:33:22,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:22,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:22,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:22,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:22,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:22,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:22,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:22,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:22,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (1/1) ... [2025-01-09 21:33:22,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:22,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:22,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:33:22,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:33:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:22,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:22,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:22,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:33:22,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:22,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:22,209 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:33:22,297 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:22,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:22,972 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:22,972 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:23,730 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:23,737 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:33:23,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:23 BoogieIcfgContainer [2025-01-09 21:33:23,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:23,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:23,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:23,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:23,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:21" (1/3) ... [2025-01-09 21:33:23,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17883f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:23, skipping insertion in model container [2025-01-09 21:33:23,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:22" (2/3) ... [2025-01-09 21:33:23,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17883f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:23, skipping insertion in model container [2025-01-09 21:33:23,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:23" (3/3) ... [2025-01-09 21:33:23,747 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2025-01-09 21:33:23,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:23,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series.wvr.c that has 5 procedures, 417 locations, 1 initial locations, 7 loop locations, and 99 error locations. [2025-01-09 21:33:23,760 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:23,852 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:33:23,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 431 transitions, 890 flow [2025-01-09 21:33:24,034 INFO L124 PetriNetUnfolderBase]: 15/427 cut-off events. [2025-01-09 21:33:24,037 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:24,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 427 events. 15/427 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 645 event pairs, 0 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 379. Up to 2 conditions per place. [2025-01-09 21:33:24,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 429 places, 431 transitions, 890 flow [2025-01-09 21:33:24,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 409 places, 410 transitions, 844 flow [2025-01-09 21:33:24,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:24,080 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;@122c5681, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:24,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 182 error locations. [2025-01-09 21:33:24,088 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:24,088 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-01-09 21:33:24,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:24,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:24,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:24,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash -19455304, now seen corresponding path program 1 times [2025-01-09 21:33:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296777264] [2025-01-09 21:33:24,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:24,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:24,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:24,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:24,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:24,257 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:24,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296777264] [2025-01-09 21:33:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296777264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:24,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:24,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178295591] [2025-01-09 21:33:24,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:24,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:24,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:24,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:24,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 431 [2025-01-09 21:33:24,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 410 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:24,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:24,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 431 [2025-01-09 21:33:24,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:24,788 INFO L124 PetriNetUnfolderBase]: 745/1700 cut-off events. [2025-01-09 21:33:24,789 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-01-09 21:33:24,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 1700 events. 745/1700 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8752 event pairs, 485 based on Foata normal form. 7/1548 useless extension candidates. Maximal degree in co-relation 2496. Up to 1009 conditions per place. [2025-01-09 21:33:24,803 INFO L140 encePairwiseOnDemand]: 342/431 looper letters, 27 selfloop transitions, 2 changer transitions 7/323 dead transitions. [2025-01-09 21:33:24,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 323 transitions, 728 flow [2025-01-09 21:33:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1052 transitions. [2025-01-09 21:33:24,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8136117556071152 [2025-01-09 21:33:24,817 INFO L175 Difference]: Start difference. First operand has 409 places, 410 transitions, 844 flow. Second operand 3 states and 1052 transitions. [2025-01-09 21:33:24,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 323 transitions, 728 flow [2025-01-09 21:33:24,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 323 transitions, 712 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:33:24,829 INFO L231 Difference]: Finished difference. Result has 323 places, 316 transitions, 644 flow [2025-01-09 21:33:24,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=323, PETRI_TRANSITIONS=316} [2025-01-09 21:33:24,834 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -86 predicate places. [2025-01-09 21:33:24,834 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 316 transitions, 644 flow [2025-01-09 21:33:24,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:24,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:24,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:24,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:24,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:24,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash 660699748, now seen corresponding path program 1 times [2025-01-09 21:33:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636286421] [2025-01-09 21:33:24,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:24,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:24,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:33:24,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:33:24,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:24,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:24,903 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:24,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636286421] [2025-01-09 21:33:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636286421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:24,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899382600] [2025-01-09 21:33:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:24,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:24,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:24,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:24,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:24,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 431 [2025-01-09 21:33:24,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 316 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:24,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:24,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 431 [2025-01-09 21:33:24,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:25,241 INFO L124 PetriNetUnfolderBase]: 745/1692 cut-off events. [2025-01-09 21:33:25,241 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:33:25,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 1692 events. 745/1692 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8791 event pairs, 485 based on Foata normal form. 0/1541 useless extension candidates. Maximal degree in co-relation 2736. Up to 1008 conditions per place. [2025-01-09 21:33:25,249 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 26 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-01-09 21:33:25,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 315 transitions, 698 flow [2025-01-09 21:33:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:25,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748646558391338 [2025-01-09 21:33:25,251 INFO L175 Difference]: Start difference. First operand has 323 places, 316 transitions, 644 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:25,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 315 transitions, 698 flow [2025-01-09 21:33:25,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:25,256 INFO L231 Difference]: Finished difference. Result has 315 places, 315 transitions, 642 flow [2025-01-09 21:33:25,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=315, PETRI_TRANSITIONS=315} [2025-01-09 21:33:25,257 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -94 predicate places. [2025-01-09 21:33:25,257 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 315 transitions, 642 flow [2025-01-09 21:33:25,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:25,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:25,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:25,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:25,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:25,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash -651475931, now seen corresponding path program 1 times [2025-01-09 21:33:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:25,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554656124] [2025-01-09 21:33:25,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:25,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:25,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:33:25,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:33:25,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:25,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:25,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:25,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554656124] [2025-01-09 21:33:25,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554656124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:25,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:25,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127758412] [2025-01-09 21:33:25,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:25,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:25,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:25,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:25,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 431 [2025-01-09 21:33:25,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 315 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:25,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:25,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 431 [2025-01-09 21:33:25,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:25,571 INFO L124 PetriNetUnfolderBase]: 745/1691 cut-off events. [2025-01-09 21:33:25,571 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:33:25,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 1691 events. 745/1691 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8774 event pairs, 485 based on Foata normal form. 0/1541 useless extension candidates. Maximal degree in co-relation 2727. Up to 1008 conditions per place. [2025-01-09 21:33:25,578 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 26 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2025-01-09 21:33:25,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 696 flow [2025-01-09 21:33:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:25,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748646558391338 [2025-01-09 21:33:25,581 INFO L175 Difference]: Start difference. First operand has 315 places, 315 transitions, 642 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:25,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 696 flow [2025-01-09 21:33:25,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 314 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:25,585 INFO L231 Difference]: Finished difference. Result has 314 places, 314 transitions, 640 flow [2025-01-09 21:33:25,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=314, PETRI_TRANSITIONS=314} [2025-01-09 21:33:25,586 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -95 predicate places. [2025-01-09 21:33:25,586 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 640 flow [2025-01-09 21:33:25,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:25,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:25,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:25,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:25,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash -208174085, now seen corresponding path program 1 times [2025-01-09 21:33:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671676004] [2025-01-09 21:33:25,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:25,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:33:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:33:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:25,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671676004] [2025-01-09 21:33:25,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671676004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:25,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997254972] [2025-01-09 21:33:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:25,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:25,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:25,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 431 [2025-01-09 21:33:25,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:25,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:25,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 431 [2025-01-09 21:33:25,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:25,899 INFO L124 PetriNetUnfolderBase]: 745/1690 cut-off events. [2025-01-09 21:33:25,900 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:33:25,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1690 events. 745/1690 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8773 event pairs, 485 based on Foata normal form. 0/1541 useless extension candidates. Maximal degree in co-relation 2718. Up to 1008 conditions per place. [2025-01-09 21:33:25,908 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 26 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-01-09 21:33:25,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 313 transitions, 694 flow [2025-01-09 21:33:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:25,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748646558391338 [2025-01-09 21:33:25,912 INFO L175 Difference]: Start difference. First operand has 314 places, 314 transitions, 640 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:25,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 313 transitions, 694 flow [2025-01-09 21:33:25,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 313 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:25,916 INFO L231 Difference]: Finished difference. Result has 313 places, 313 transitions, 638 flow [2025-01-09 21:33:25,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=313, PETRI_TRANSITIONS=313} [2025-01-09 21:33:25,917 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -96 predicate places. [2025-01-09 21:33:25,917 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 313 transitions, 638 flow [2025-01-09 21:33:25,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:25,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:25,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:25,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:25,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:25,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1755135369, now seen corresponding path program 1 times [2025-01-09 21:33:25,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:25,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779946734] [2025-01-09 21:33:25,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:25,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:25,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:33:25,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:33:25,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:25,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:25,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:25,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779946734] [2025-01-09 21:33:25,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779946734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:25,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:25,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146025784] [2025-01-09 21:33:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:25,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:25,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:25,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:25,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 431 [2025-01-09 21:33:25,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 313 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:25,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:25,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 431 [2025-01-09 21:33:25,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:26,386 INFO L124 PetriNetUnfolderBase]: 982/2330 cut-off events. [2025-01-09 21:33:26,386 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 21:33:26,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 2330 events. 982/2330 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14361 event pairs, 392 based on Foata normal form. 0/2110 useless extension candidates. Maximal degree in co-relation 3683. Up to 714 conditions per place. [2025-01-09 21:33:26,395 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 40 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2025-01-09 21:33:26,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 329 transitions, 759 flow [2025-01-09 21:33:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2025-01-09 21:33:26,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.768754833720031 [2025-01-09 21:33:26,397 INFO L175 Difference]: Start difference. First operand has 313 places, 313 transitions, 638 flow. Second operand 3 states and 994 transitions. [2025-01-09 21:33:26,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 329 transitions, 759 flow [2025-01-09 21:33:26,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 329 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:26,401 INFO L231 Difference]: Finished difference. Result has 313 places, 313 transitions, 642 flow [2025-01-09 21:33:26,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=313, PETRI_TRANSITIONS=313} [2025-01-09 21:33:26,402 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -96 predicate places. [2025-01-09 21:33:26,402 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 313 transitions, 642 flow [2025-01-09 21:33:26,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:26,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:26,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:26,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:26,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:26,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash -830814670, now seen corresponding path program 1 times [2025-01-09 21:33:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:26,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70046256] [2025-01-09 21:33:26,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:26,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:33:26,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:33:26,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:26,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70046256] [2025-01-09 21:33:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70046256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013879929] [2025-01-09 21:33:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:26,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:26,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:26,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:26,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:26,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-01-09 21:33:26,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 313 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:26,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:26,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-01-09 21:33:26,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:26,726 INFO L124 PetriNetUnfolderBase]: 982/2326 cut-off events. [2025-01-09 21:33:26,726 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-01-09 21:33:26,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3981 conditions, 2326 events. 982/2326 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14560 event pairs, 665 based on Foata normal form. 0/2099 useless extension candidates. Maximal degree in co-relation 2132. Up to 1327 conditions per place. [2025-01-09 21:33:26,740 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 26 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2025-01-09 21:33:26,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 312 transitions, 696 flow [2025-01-09 21:33:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-01-09 21:33:26,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-01-09 21:33:26,743 INFO L175 Difference]: Start difference. First operand has 313 places, 313 transitions, 642 flow. Second operand 3 states and 970 transitions. [2025-01-09 21:33:26,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 312 transitions, 696 flow [2025-01-09 21:33:26,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 312 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:26,747 INFO L231 Difference]: Finished difference. Result has 313 places, 312 transitions, 642 flow [2025-01-09 21:33:26,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=313, PETRI_TRANSITIONS=312} [2025-01-09 21:33:26,749 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -96 predicate places. [2025-01-09 21:33:26,749 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 312 transitions, 642 flow [2025-01-09 21:33:26,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:26,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:26,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:26,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:26,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:26,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2144209481, now seen corresponding path program 1 times [2025-01-09 21:33:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80856985] [2025-01-09 21:33:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:26,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:33:26,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:33:26,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:26,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:26,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:26,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80856985] [2025-01-09 21:33:26,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80856985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:26,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:26,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031556156] [2025-01-09 21:33:26,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:26,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:26,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:26,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:26,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 431 [2025-01-09 21:33:26,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 312 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:26,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:26,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 431 [2025-01-09 21:33:26,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:27,068 INFO L124 PetriNetUnfolderBase]: 982/2325 cut-off events. [2025-01-09 21:33:27,069 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-01-09 21:33:27,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3904 conditions, 2325 events. 982/2325 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14558 event pairs, 665 based on Foata normal form. 0/2099 useless extension candidates. Maximal degree in co-relation 3832. Up to 1328 conditions per place. [2025-01-09 21:33:27,079 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-01-09 21:33:27,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 311 transitions, 698 flow [2025-01-09 21:33:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-01-09 21:33:27,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748646558391338 [2025-01-09 21:33:27,081 INFO L175 Difference]: Start difference. First operand has 313 places, 312 transitions, 642 flow. Second operand 3 states and 968 transitions. [2025-01-09 21:33:27,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 311 transitions, 698 flow [2025-01-09 21:33:27,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 311 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:27,085 INFO L231 Difference]: Finished difference. Result has 312 places, 311 transitions, 640 flow [2025-01-09 21:33:27,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=312, PETRI_TRANSITIONS=311} [2025-01-09 21:33:27,085 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -97 predicate places. [2025-01-09 21:33:27,086 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 311 transitions, 640 flow [2025-01-09 21:33:27,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:27,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:27,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:27,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:27,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:27,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1977185529, now seen corresponding path program 1 times [2025-01-09 21:33:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:27,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839873561] [2025-01-09 21:33:27,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:27,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:27,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:33:27,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:33:27,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:27,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839873561] [2025-01-09 21:33:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839873561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:27,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195717503] [2025-01-09 21:33:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:27,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:27,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:27,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:27,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 431 [2025-01-09 21:33:27,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 311 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:27,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:27,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 431 [2025-01-09 21:33:27,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:27,613 INFO L124 PetriNetUnfolderBase]: 1232/2818 cut-off events. [2025-01-09 21:33:27,613 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-01-09 21:33:27,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 2818 events. 1232/2818 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18045 event pairs, 472 based on Foata normal form. 0/2558 useless extension candidates. Maximal degree in co-relation 4694. Up to 903 conditions per place. [2025-01-09 21:33:27,625 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 41 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2025-01-09 21:33:27,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 327 transitions, 766 flow [2025-01-09 21:33:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-01-09 21:33:27,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7679814385150812 [2025-01-09 21:33:27,628 INFO L175 Difference]: Start difference. First operand has 312 places, 311 transitions, 640 flow. Second operand 3 states and 993 transitions. [2025-01-09 21:33:27,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 327 transitions, 766 flow [2025-01-09 21:33:27,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 327 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:27,631 INFO L231 Difference]: Finished difference. Result has 312 places, 311 transitions, 644 flow [2025-01-09 21:33:27,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=312, PETRI_TRANSITIONS=311} [2025-01-09 21:33:27,632 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -97 predicate places. [2025-01-09 21:33:27,633 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 311 transitions, 644 flow [2025-01-09 21:33:27,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:27,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:27,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:27,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:27,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:27,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1303595993, now seen corresponding path program 1 times [2025-01-09 21:33:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:27,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855227212] [2025-01-09 21:33:27,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:27,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:33:27,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:33:27,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:27,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:27,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:27,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855227212] [2025-01-09 21:33:27,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855227212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:27,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:27,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:27,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67663492] [2025-01-09 21:33:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:27,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:27,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:27,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:27,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:27,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-01-09 21:33:27,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 311 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:27,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:27,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-01-09 21:33:27,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:28,086 INFO L124 PetriNetUnfolderBase]: 1232/3009 cut-off events. [2025-01-09 21:33:28,086 INFO L125 PetriNetUnfolderBase]: For 463/463 co-relation queries the response was YES. [2025-01-09 21:33:28,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 3009 events. 1232/3009 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20988 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 3076. Up to 1665 conditions per place. [2025-01-09 21:33:28,099 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-01-09 21:33:28,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 310 transitions, 700 flow [2025-01-09 21:33:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-01-09 21:33:28,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-01-09 21:33:28,101 INFO L175 Difference]: Start difference. First operand has 312 places, 311 transitions, 644 flow. Second operand 3 states and 970 transitions. [2025-01-09 21:33:28,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 310 transitions, 700 flow [2025-01-09 21:33:28,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 310 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:28,105 INFO L231 Difference]: Finished difference. Result has 312 places, 310 transitions, 644 flow [2025-01-09 21:33:28,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=312, PETRI_TRANSITIONS=310} [2025-01-09 21:33:28,106 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -97 predicate places. [2025-01-09 21:33:28,106 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 310 transitions, 644 flow [2025-01-09 21:33:28,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:28,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:28,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:28,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:28,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:28,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash -331847430, now seen corresponding path program 1 times [2025-01-09 21:33:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:28,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657192719] [2025-01-09 21:33:28,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:28,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:33:28,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:33:28,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:28,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:28,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657192719] [2025-01-09 21:33:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657192719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:28,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:28,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560872835] [2025-01-09 21:33:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:28,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:28,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:28,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:28,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 431 [2025-01-09 21:33:28,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 310 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:28,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:28,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 431 [2025-01-09 21:33:28,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:28,466 INFO L124 PetriNetUnfolderBase]: 1232/3008 cut-off events. [2025-01-09 21:33:28,466 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-01-09 21:33:28,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 3008 events. 1232/3008 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20966 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5049. Up to 1663 conditions per place. [2025-01-09 21:33:28,481 INFO L140 encePairwiseOnDemand]: 429/431 looper letters, 26 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2025-01-09 21:33:28,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 696 flow [2025-01-09 21:33:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2025-01-09 21:33:28,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7556071152358855 [2025-01-09 21:33:28,484 INFO L175 Difference]: Start difference. First operand has 312 places, 310 transitions, 644 flow. Second operand 3 states and 977 transitions. [2025-01-09 21:33:28,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 696 flow [2025-01-09 21:33:28,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 309 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:28,489 INFO L231 Difference]: Finished difference. Result has 311 places, 309 transitions, 640 flow [2025-01-09 21:33:28,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=311, PETRI_TRANSITIONS=309} [2025-01-09 21:33:28,490 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -98 predicate places. [2025-01-09 21:33:28,490 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 309 transitions, 640 flow [2025-01-09 21:33:28,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:28,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:28,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:28,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:28,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash 446635646, now seen corresponding path program 1 times [2025-01-09 21:33:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60146169] [2025-01-09 21:33:28,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:28,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:33:28,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:33:28,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:28,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:28,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60146169] [2025-01-09 21:33:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60146169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:28,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:28,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:28,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301693100] [2025-01-09 21:33:28,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:28,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:28,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:28,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:28,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-01-09 21:33:28,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 309 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:28,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:28,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-01-09 21:33:28,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:28,925 INFO L124 PetriNetUnfolderBase]: 1232/3007 cut-off events. [2025-01-09 21:33:28,925 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-01-09 21:33:28,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 3007 events. 1232/3007 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20975 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5049. Up to 1665 conditions per place. [2025-01-09 21:33:28,935 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-01-09 21:33:28,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 696 flow [2025-01-09 21:33:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-01-09 21:33:28,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-01-09 21:33:28,938 INFO L175 Difference]: Start difference. First operand has 311 places, 309 transitions, 640 flow. Second operand 3 states and 970 transitions. [2025-01-09 21:33:28,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 696 flow [2025-01-09 21:33:28,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 308 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:28,943 INFO L231 Difference]: Finished difference. Result has 311 places, 308 transitions, 641 flow [2025-01-09 21:33:28,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=311, PETRI_TRANSITIONS=308} [2025-01-09 21:33:28,944 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -98 predicate places. [2025-01-09 21:33:28,944 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 308 transitions, 641 flow [2025-01-09 21:33:28,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:28,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:28,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:28,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:28,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:28,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash 731495022, now seen corresponding path program 1 times [2025-01-09 21:33:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:28,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30178597] [2025-01-09 21:33:28,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:28,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:33:28,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:33:28,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:28,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30178597] [2025-01-09 21:33:29,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30178597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:29,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237614004] [2025-01-09 21:33:29,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:29,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:29,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 431 [2025-01-09 21:33:29,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 308 transitions, 641 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:29,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 431 [2025-01-09 21:33:29,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:29,910 INFO L124 PetriNetUnfolderBase]: 1232/3004 cut-off events. [2025-01-09 21:33:29,911 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-01-09 21:33:29,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 3004 events. 1232/3004 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20968 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5083. Up to 1686 conditions per place. [2025-01-09 21:33:29,922 INFO L140 encePairwiseOnDemand]: 413/431 looper letters, 48 selfloop transitions, 15 changer transitions 0/305 dead transitions. [2025-01-09 21:33:29,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 305 transitions, 761 flow [2025-01-09 21:33:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1738 transitions. [2025-01-09 21:33:29,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6720804331013148 [2025-01-09 21:33:29,925 INFO L175 Difference]: Start difference. First operand has 311 places, 308 transitions, 641 flow. Second operand 6 states and 1738 transitions. [2025-01-09 21:33:29,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 305 transitions, 761 flow [2025-01-09 21:33:29,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 305 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:29,929 INFO L231 Difference]: Finished difference. Result has 311 places, 305 transitions, 661 flow [2025-01-09 21:33:29,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=661, PETRI_PLACES=311, PETRI_TRANSITIONS=305} [2025-01-09 21:33:29,930 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -98 predicate places. [2025-01-09 21:33:29,930 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 305 transitions, 661 flow [2025-01-09 21:33:29,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:29,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:29,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:29,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:29,931 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:29,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1687532718, now seen corresponding path program 1 times [2025-01-09 21:33:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:29,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670779453] [2025-01-09 21:33:29,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:29,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:33:29,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:33:29,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:29,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:29,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:29,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670779453] [2025-01-09 21:33:29,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670779453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:29,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:29,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570458025] [2025-01-09 21:33:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:29,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:29,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:29,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:29,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:29,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 431 [2025-01-09 21:33:29,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 305 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:29,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:29,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 431 [2025-01-09 21:33:29,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,350 INFO L124 PetriNetUnfolderBase]: 1232/3003 cut-off events. [2025-01-09 21:33:30,350 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-01-09 21:33:30,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5147 conditions, 3003 events. 1232/3003 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20955 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5097. Up to 1663 conditions per place. [2025-01-09 21:33:30,363 INFO L140 encePairwiseOnDemand]: 429/431 looper letters, 26 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2025-01-09 21:33:30,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 304 transitions, 713 flow [2025-01-09 21:33:30,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2025-01-09 21:33:30,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7556071152358855 [2025-01-09 21:33:30,366 INFO L175 Difference]: Start difference. First operand has 311 places, 305 transitions, 661 flow. Second operand 3 states and 977 transitions. [2025-01-09 21:33:30,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 304 transitions, 713 flow [2025-01-09 21:33:30,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 304 transitions, 683 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:30,370 INFO L231 Difference]: Finished difference. Result has 307 places, 304 transitions, 631 flow [2025-01-09 21:33:30,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=307, PETRI_TRANSITIONS=304} [2025-01-09 21:33:30,371 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -102 predicate places. [2025-01-09 21:33:30,371 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 304 transitions, 631 flow [2025-01-09 21:33:30,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:30,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:30,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:30,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:30,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:30,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1547169737, now seen corresponding path program 1 times [2025-01-09 21:33:30,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:30,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529586049] [2025-01-09 21:33:30,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:30,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 21:33:30,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 21:33:30,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:30,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529586049] [2025-01-09 21:33:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529586049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:30,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478743859] [2025-01-09 21:33:30,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:30,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:30,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-01-09 21:33:30,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 304 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:30,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-01-09 21:33:30,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:30,822 INFO L124 PetriNetUnfolderBase]: 1232/3002 cut-off events. [2025-01-09 21:33:30,822 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-01-09 21:33:30,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 3002 events. 1232/3002 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20994 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5045. Up to 1665 conditions per place. [2025-01-09 21:33:30,833 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-01-09 21:33:30,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 303 transitions, 687 flow [2025-01-09 21:33:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-01-09 21:33:30,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-01-09 21:33:30,835 INFO L175 Difference]: Start difference. First operand has 307 places, 304 transitions, 631 flow. Second operand 3 states and 970 transitions. [2025-01-09 21:33:30,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 303 transitions, 687 flow [2025-01-09 21:33:30,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 303 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:30,839 INFO L231 Difference]: Finished difference. Result has 307 places, 303 transitions, 632 flow [2025-01-09 21:33:30,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=307, PETRI_TRANSITIONS=303} [2025-01-09 21:33:30,840 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -102 predicate places. [2025-01-09 21:33:30,840 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 303 transitions, 632 flow [2025-01-09 21:33:30,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:30,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:30,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:30,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:30,840 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:30,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1739496464, now seen corresponding path program 1 times [2025-01-09 21:33:30,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:30,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892992894] [2025-01-09 21:33:30,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:30,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:33:30,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:33:30,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:30,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:30,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892992894] [2025-01-09 21:33:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892992894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:30,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101748656] [2025-01-09 21:33:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:30,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:30,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:30,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:30,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:30,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-01-09 21:33:30,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 303 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:30,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:30,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-01-09 21:33:30,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,199 INFO L124 PetriNetUnfolderBase]: 1232/3000 cut-off events. [2025-01-09 21:33:31,200 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-01-09 21:33:31,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 3000 events. 1232/3000 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20990 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5045. Up to 1665 conditions per place. [2025-01-09 21:33:31,211 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 28 selfloop transitions, 1 changer transitions 0/301 dead transitions. [2025-01-09 21:33:31,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 301 transitions, 686 flow [2025-01-09 21:33:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-01-09 21:33:31,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7509667440061871 [2025-01-09 21:33:31,214 INFO L175 Difference]: Start difference. First operand has 307 places, 303 transitions, 632 flow. Second operand 3 states and 971 transitions. [2025-01-09 21:33:31,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 301 transitions, 686 flow [2025-01-09 21:33:31,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 301 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:31,217 INFO L231 Difference]: Finished difference. Result has 305 places, 301 transitions, 626 flow [2025-01-09 21:33:31,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2025-01-09 21:33:31,218 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -104 predicate places. [2025-01-09 21:33:31,218 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 626 flow [2025-01-09 21:33:31,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:31,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:31,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:31,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:31,219 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1042506150, now seen corresponding path program 1 times [2025-01-09 21:33:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:31,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692076652] [2025-01-09 21:33:31,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:31,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:33:31,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:33:31,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:31,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692076652] [2025-01-09 21:33:31,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692076652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:31,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:31,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080186661] [2025-01-09 21:33:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:31,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:31,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:31,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:31,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 431 [2025-01-09 21:33:31,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:31,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:31,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 431 [2025-01-09 21:33:31,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,561 INFO L124 PetriNetUnfolderBase]: 1232/2999 cut-off events. [2025-01-09 21:33:31,561 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-01-09 21:33:31,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 2999 events. 1232/2999 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20991 event pairs, 858 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 5043. Up to 1665 conditions per place. [2025-01-09 21:33:31,574 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 27 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-01-09 21:33:31,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 300 transitions, 682 flow [2025-01-09 21:33:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-01-09 21:33:31,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7501933488012374 [2025-01-09 21:33:31,576 INFO L175 Difference]: Start difference. First operand has 305 places, 301 transitions, 626 flow. Second operand 3 states and 970 transitions. [2025-01-09 21:33:31,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 300 transitions, 682 flow [2025-01-09 21:33:31,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 300 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:31,580 INFO L231 Difference]: Finished difference. Result has 305 places, 300 transitions, 627 flow [2025-01-09 21:33:31,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=305, PETRI_TRANSITIONS=300} [2025-01-09 21:33:31,580 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -104 predicate places. [2025-01-09 21:33:31,581 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 300 transitions, 627 flow [2025-01-09 21:33:31,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:31,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:31,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:31,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:31,581 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-01-09 21:33:31,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1005413368, now seen corresponding path program 1 times [2025-01-09 21:33:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:31,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041278874] [2025-01-09 21:33:31,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:31,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 21:33:31,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 21:33:31,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:31,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041278874] [2025-01-09 21:33:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041278874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474915500] [2025-01-09 21:33:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:31,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:31,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:31,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:31,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 431 [2025-01-09 21:33:31,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 300 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:31,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:31,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 431 [2025-01-09 21:33:31,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:31,939 INFO L124 PetriNetUnfolderBase]: 1232/2995 cut-off events. [2025-01-09 21:33:31,940 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-01-09 21:33:31,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 2995 events. 1232/2995 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21004 event pairs, 858 based on Foata normal form. 4/2695 useless extension candidates. Maximal degree in co-relation 5041. Up to 1662 conditions per place. [2025-01-09 21:33:31,947 INFO L140 encePairwiseOnDemand]: 429/431 looper letters, 0 selfloop transitions, 0 changer transitions 299/299 dead transitions. [2025-01-09 21:33:31,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 299 transitions, 675 flow [2025-01-09 21:33:31,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2025-01-09 21:33:31,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7563805104408353 [2025-01-09 21:33:31,949 INFO L175 Difference]: Start difference. First operand has 305 places, 300 transitions, 627 flow. Second operand 3 states and 978 transitions. [2025-01-09 21:33:31,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 299 transitions, 675 flow [2025-01-09 21:33:31,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:31,952 INFO L231 Difference]: Finished difference. Result has 304 places, 0 transitions, 0 flow [2025-01-09 21:33:31,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=304, PETRI_TRANSITIONS=0} [2025-01-09 21:33:31,952 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -105 predicate places. [2025-01-09 21:33:31,952 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 0 transitions, 0 flow [2025-01-09 21:33:31,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:31,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (181 of 182 remaining) [2025-01-09 21:33:31,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (180 of 182 remaining) [2025-01-09 21:33:31,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (179 of 182 remaining) [2025-01-09 21:33:31,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (178 of 182 remaining) [2025-01-09 21:33:31,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (177 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (176 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (175 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (174 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (173 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (172 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (171 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (170 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (169 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (168 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (167 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (166 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (165 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (164 of 182 remaining) [2025-01-09 21:33:31,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (163 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (162 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (161 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (160 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (159 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (158 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (157 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (156 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (155 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (154 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (153 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (152 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (151 of 182 remaining) [2025-01-09 21:33:31,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (150 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (149 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (148 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (147 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (146 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (145 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (144 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (143 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (142 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (141 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (140 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (139 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (138 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (137 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (136 of 182 remaining) [2025-01-09 21:33:31,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (135 of 182 remaining) [2025-01-09 21:33:31,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (134 of 182 remaining) [2025-01-09 21:33:31,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (133 of 182 remaining) [2025-01-09 21:33:31,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (132 of 182 remaining) [2025-01-09 21:33:31,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (131 of 182 remaining) [2025-01-09 21:33:31,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (130 of 182 remaining) [2025-01-09 21:33:31,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (129 of 182 remaining) [2025-01-09 21:33:31,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (128 of 182 remaining) [2025-01-09 21:33:31,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (127 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (126 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (125 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (124 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (123 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (122 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (121 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (120 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (119 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (118 of 182 remaining) [2025-01-09 21:33:31,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (117 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (116 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (115 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (114 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (113 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (112 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (111 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (110 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (109 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (108 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (107 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (106 of 182 remaining) [2025-01-09 21:33:31,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (105 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (104 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (103 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (98 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (97 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (96 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (94 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (93 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (92 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (91 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (90 of 182 remaining) [2025-01-09 21:33:31,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (89 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (88 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (87 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (86 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (85 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (83 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (82 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (81 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (80 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (79 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 182 remaining) [2025-01-09 21:33:31,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (60 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (58 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (51 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (49 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (46 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (45 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (44 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (42 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (40 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 182 remaining) [2025-01-09 21:33:31,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 182 remaining) [2025-01-09 21:33:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 182 remaining) [2025-01-09 21:33:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 182 remaining) [2025-01-09 21:33:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 182 remaining) [2025-01-09 21:33:31,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 182 remaining) [2025-01-09 21:33:31,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 182 remaining) [2025-01-09 21:33:31,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 182 remaining) [2025-01-09 21:33:31,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:31,970 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:31,976 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:31,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:31,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:31 BasicIcfg [2025-01-09 21:33:31,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:31,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:31,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:31,981 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:31,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:23" (3/4) ... [2025-01-09 21:33:31,982 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:31,985 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:31,985 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:31,985 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:31,985 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:33:31,992 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-01-09 21:33:31,992 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:31,993 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:33:31,993 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:32,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:32,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:32,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:32,060 INFO L158 Benchmark]: Toolchain (without parser) took 10178.70ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 112.1MB in the beginning and 637.8MB in the end (delta: -525.7MB). Peak memory consumption was 332.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,060 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:32,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.90ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.11ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 93.8MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,061 INFO L158 Benchmark]: Boogie Preprocessor took 33.21ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 90.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:32,061 INFO L158 Benchmark]: RCFGBuilder took 1586.83ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 80.6MB in the end (delta: 9.7MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,061 INFO L158 Benchmark]: TraceAbstraction took 8242.04ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 79.5MB in the beginning and 646.2MB in the end (delta: -566.7MB). Peak memory consumption was 619.5MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,061 INFO L158 Benchmark]: Witness Printer took 78.74ms. Allocated memory is still 1.0GB. Free memory was 646.2MB in the beginning and 637.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:32,062 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.20ms. Allocated memory is still 201.3MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.90ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.11ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 93.8MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.21ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 90.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1586.83ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 80.6MB in the end (delta: 9.7MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8242.04ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 79.5MB in the beginning and 646.2MB in the end (delta: -566.7MB). Peak memory consumption was 619.5MB. Max. memory is 16.1GB. * Witness Printer took 78.74ms. Allocated memory is still 1.0GB. Free memory was 646.2MB in the beginning and 637.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: 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: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 534 locations, 182 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1034 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 56 mSDtfsCounter, 1034 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 99 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:32,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE