./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 462fb42b593b74362524fb8209dde3f76380a79de0c48b612eb75bd0eda8df1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:13:19,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:13:19,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:13:19,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:13:19,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:13:19,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:13:19,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:13:19,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:13:19,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:13:19,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:13:19,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:13:19,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:13:19,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:13:19,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:13:19,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:13:19,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:19,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:13:19,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:13:19,686 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/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 -> 462fb42b593b74362524fb8209dde3f76380a79de0c48b612eb75bd0eda8df1c [2025-03-17 11:13:19,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:13:19,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:13:19,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:13:19,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:13:19,909 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:13:19,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-03-17 11:13:21,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7ebdc7e/edc15ba5cc8442399ae8b188ddf0a423/FLAG29e4d9fb1 [2025-03-17 11:13:21,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:13:21,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-03-17 11:13:21,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7ebdc7e/edc15ba5cc8442399ae8b188ddf0a423/FLAG29e4d9fb1 [2025-03-17 11:13:21,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d7ebdc7e/edc15ba5cc8442399ae8b188ddf0a423 [2025-03-17 11:13:21,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:13:21,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:13:21,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:21,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:13:21,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:13:21,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f794e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21, skipping insertion in model container [2025-03-17 11:13:21,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:13:21,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:21,772 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:13:21,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:21,813 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:13:21,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21 WrapperNode [2025-03-17 11:13:21,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:21,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:21,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:13:21,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:13:21,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,860 INFO L138 Inliner]: procedures = 28, calls = 66, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 489 [2025-03-17 11:13:21,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:21,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:13:21,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:13:21,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:13:21,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:13:21,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:13:21,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:13:21,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:13:21,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (1/1) ... [2025-03-17 11:13:21,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:21,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:13:21,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:13:21,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:13:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:13:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:13:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 11:13:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:13:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-17 11:13:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-17 11:13:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-17 11:13:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-17 11:13:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:13:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:13:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:13:21,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:13:21,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:13:21,947 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:13:22,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:13:22,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:13:22,614 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:13:22,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:13:22,860 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:13:22,861 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:13:22,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:22 BoogieIcfgContainer [2025-03-17 11:13:22,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:13:22,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:13:22,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:13:22,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:13:22,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:13:21" (1/3) ... [2025-03-17 11:13:22,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c7e6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:22, skipping insertion in model container [2025-03-17 11:13:22,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:21" (2/3) ... [2025-03-17 11:13:22,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c7e6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:22, skipping insertion in model container [2025-03-17 11:13:22,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:22" (3/3) ... [2025-03-17 11:13:22,867 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2025-03-17 11:13:22,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:13:22,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1-dsl.wvr.c that has 7 procedures, 346 locations, 1 initial locations, 5 loop locations, and 71 error locations. [2025-03-17 11:13:22,880 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:13:22,987 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-17 11:13:23,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 370 transitions, 806 flow [2025-03-17 11:13:23,108 INFO L124 PetriNetUnfolderBase]: 17/356 cut-off events. [2025-03-17 11:13:23,110 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:13:23,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 356 events. 17/356 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 715 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 313. Up to 3 conditions per place. [2025-03-17 11:13:23,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 372 places, 370 transitions, 806 flow [2025-03-17 11:13:23,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 339 transitions, 726 flow [2025-03-17 11:13:23,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:13:23,142 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;@356ee160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:13:23,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2025-03-17 11:13:23,149 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:13:23,149 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-17 11:13:23,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:13:23,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:23,150 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] [2025-03-17 11:13:23,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:23,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1324161691, now seen corresponding path program 1 times [2025-03-17 11:13:23,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:23,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025261468] [2025-03-17 11:13:23,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:23,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:13:23,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:13:23,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:23,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:23,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025261468] [2025-03-17 11:13:23,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025261468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:23,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:23,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289400853] [2025-03-17 11:13:23,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:23,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:23,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:23,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:23,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 374 [2025-03-17 11:13:23,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-03-17 11:13:23,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:23,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 374 [2025-03-17 11:13:23,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:24,435 INFO L124 PetriNetUnfolderBase]: 2624/6048 cut-off events. [2025-03-17 11:13:24,435 INFO L125 PetriNetUnfolderBase]: For 1003/1003 co-relation queries the response was YES. [2025-03-17 11:13:24,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10458 conditions, 6048 events. 2624/6048 cut-off events. For 1003/1003 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 47485 event pairs, 1306 based on Foata normal form. 966/6066 useless extension candidates. Maximal degree in co-relation 10023. Up to 3339 conditions per place. [2025-03-17 11:13:24,485 INFO L140 encePairwiseOnDemand]: 308/374 looper letters, 35 selfloop transitions, 2 changer transitions 3/275 dead transitions. [2025-03-17 11:13:24,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 275 transitions, 672 flow [2025-03-17 11:13:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2025-03-17 11:13:24,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7905525846702317 [2025-03-17 11:13:24,501 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 726 flow. Second operand 3 states and 887 transitions. [2025-03-17 11:13:24,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 275 transitions, 672 flow [2025-03-17 11:13:24,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 275 transitions, 640 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-17 11:13:24,515 INFO L231 Difference]: Finished difference. Result has 275 places, 272 transitions, 564 flow [2025-03-17 11:13:24,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=275, PETRI_TRANSITIONS=272} [2025-03-17 11:13:24,520 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -67 predicate places. [2025-03-17 11:13:24,520 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 272 transitions, 564 flow [2025-03-17 11:13:24,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-03-17 11:13:24,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:24,521 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] [2025-03-17 11:13:24,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:13:24,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:24,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1863148870, now seen corresponding path program 1 times [2025-03-17 11:13:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227897039] [2025-03-17 11:13:24,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:24,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:13:24,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:13:24,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:24,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227897039] [2025-03-17 11:13:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227897039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:24,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:24,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921001097] [2025-03-17 11:13:24,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:24,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:24,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:24,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:24,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 374 [2025-03-17 11:13:24,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-03-17 11:13:24,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:24,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 374 [2025-03-17 11:13:24,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:25,306 INFO L124 PetriNetUnfolderBase]: 2624/6044 cut-off events. [2025-03-17 11:13:25,307 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:25,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9658 conditions, 6044 events. 2624/6044 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 47546 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9624. Up to 3338 conditions per place. [2025-03-17 11:13:25,347 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 34 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2025-03-17 11:13:25,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 271 transitions, 634 flow [2025-03-17 11:13:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2025-03-17 11:13:25,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361853832442068 [2025-03-17 11:13:25,350 INFO L175 Difference]: Start difference. First operand has 275 places, 272 transitions, 564 flow. Second operand 3 states and 826 transitions. [2025-03-17 11:13:25,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 271 transitions, 634 flow [2025-03-17 11:13:25,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 271 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:25,356 INFO L231 Difference]: Finished difference. Result has 271 places, 271 transitions, 562 flow [2025-03-17 11:13:25,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=271, PETRI_TRANSITIONS=271} [2025-03-17 11:13:25,358 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -71 predicate places. [2025-03-17 11:13:25,358 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 271 transitions, 562 flow [2025-03-17 11:13:25,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-03-17 11:13:25,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:25,359 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] [2025-03-17 11:13:25,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:13:25,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:25,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash 167052873, now seen corresponding path program 1 times [2025-03-17 11:13:25,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:25,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475867694] [2025-03-17 11:13:25,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:25,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:13:25,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:13:25,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:25,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:25,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:25,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475867694] [2025-03-17 11:13:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475867694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:25,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:25,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:25,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705648637] [2025-03-17 11:13:25,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:25,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:25,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:25,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:25,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-17 11:13:25,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 271 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:25,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:25,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-17 11:13:25,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:26,149 INFO L124 PetriNetUnfolderBase]: 2624/6043 cut-off events. [2025-03-17 11:13:26,150 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:26,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9656 conditions, 6043 events. 2624/6043 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 47603 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9614. Up to 3337 conditions per place. [2025-03-17 11:13:26,178 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-03-17 11:13:26,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 270 transitions, 630 flow [2025-03-17 11:13:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-17 11:13:26,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-17 11:13:26,180 INFO L175 Difference]: Start difference. First operand has 271 places, 271 transitions, 562 flow. Second operand 3 states and 828 transitions. [2025-03-17 11:13:26,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 270 transitions, 630 flow [2025-03-17 11:13:26,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 270 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:26,184 INFO L231 Difference]: Finished difference. Result has 270 places, 270 transitions, 560 flow [2025-03-17 11:13:26,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=270, PETRI_TRANSITIONS=270} [2025-03-17 11:13:26,185 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -72 predicate places. [2025-03-17 11:13:26,185 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 270 transitions, 560 flow [2025-03-17 11:13:26,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:26,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:26,186 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] [2025-03-17 11:13:26,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:13:26,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:26,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:26,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1033452402, now seen corresponding path program 1 times [2025-03-17 11:13:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:26,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832852242] [2025-03-17 11:13:26,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:26,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:26,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:13:26,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:13:26,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:26,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832852242] [2025-03-17 11:13:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832852242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:26,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:26,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499771680] [2025-03-17 11:13:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:26,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:26,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:26,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:26,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-17 11:13:26,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 270 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:26,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:26,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-17 11:13:26,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:26,891 INFO L124 PetriNetUnfolderBase]: 2624/6042 cut-off events. [2025-03-17 11:13:26,891 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:26,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9655 conditions, 6042 events. 2624/6042 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47430 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9605. Up to 3337 conditions per place. [2025-03-17 11:13:26,919 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-03-17 11:13:26,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 269 transitions, 628 flow [2025-03-17 11:13:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-17 11:13:26,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-17 11:13:26,922 INFO L175 Difference]: Start difference. First operand has 270 places, 270 transitions, 560 flow. Second operand 3 states and 828 transitions. [2025-03-17 11:13:26,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 269 transitions, 628 flow [2025-03-17 11:13:26,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 269 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:26,926 INFO L231 Difference]: Finished difference. Result has 269 places, 269 transitions, 558 flow [2025-03-17 11:13:26,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=269, PETRI_TRANSITIONS=269} [2025-03-17 11:13:26,927 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -73 predicate places. [2025-03-17 11:13:26,927 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 269 transitions, 558 flow [2025-03-17 11:13:26,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:26,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:26,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:26,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:13:26,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1717221652, now seen corresponding path program 1 times [2025-03-17 11:13:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208453285] [2025-03-17 11:13:26,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:26,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:26,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:13:26,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:13:26,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:26,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:26,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208453285] [2025-03-17 11:13:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208453285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:26,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075566327] [2025-03-17 11:13:26,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:26,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:26,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:26,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:26,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:26,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-17 11:13:26,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 269 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:26,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:26,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-17 11:13:26,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:27,728 INFO L124 PetriNetUnfolderBase]: 2624/6041 cut-off events. [2025-03-17 11:13:27,728 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:27,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9654 conditions, 6041 events. 2624/6041 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47449 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9596. Up to 3337 conditions per place. [2025-03-17 11:13:27,775 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-03-17 11:13:27,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 268 transitions, 626 flow [2025-03-17 11:13:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-17 11:13:27,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-17 11:13:27,778 INFO L175 Difference]: Start difference. First operand has 269 places, 269 transitions, 558 flow. Second operand 3 states and 828 transitions. [2025-03-17 11:13:27,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 268 transitions, 626 flow [2025-03-17 11:13:27,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 268 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:27,784 INFO L231 Difference]: Finished difference. Result has 268 places, 268 transitions, 556 flow [2025-03-17 11:13:27,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=268, PETRI_TRANSITIONS=268} [2025-03-17 11:13:27,787 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -74 predicate places. [2025-03-17 11:13:27,787 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 268 transitions, 556 flow [2025-03-17 11:13:27,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:27,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:27,788 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] [2025-03-17 11:13:27,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:13:27,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:27,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1487167539, now seen corresponding path program 1 times [2025-03-17 11:13:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:27,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531279342] [2025-03-17 11:13:27,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:27,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:27,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:13:27,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:13:27,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:27,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:27,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:27,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531279342] [2025-03-17 11:13:27,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531279342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:27,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:27,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:27,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919489413] [2025-03-17 11:13:27,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:27,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:27,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:27,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:27,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:27,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 374 [2025-03-17 11:13:27,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 268 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-03-17 11:13:27,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:27,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 374 [2025-03-17 11:13:27,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:28,577 INFO L124 PetriNetUnfolderBase]: 2624/6040 cut-off events. [2025-03-17 11:13:28,578 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:28,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9654 conditions, 6040 events. 2624/6040 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47429 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9588. Up to 3338 conditions per place. [2025-03-17 11:13:28,604 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 34 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-03-17 11:13:28,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 267 transitions, 626 flow [2025-03-17 11:13:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2025-03-17 11:13:28,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361853832442068 [2025-03-17 11:13:28,606 INFO L175 Difference]: Start difference. First operand has 268 places, 268 transitions, 556 flow. Second operand 3 states and 826 transitions. [2025-03-17 11:13:28,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 267 transitions, 626 flow [2025-03-17 11:13:28,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 267 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:28,609 INFO L231 Difference]: Finished difference. Result has 267 places, 267 transitions, 554 flow [2025-03-17 11:13:28,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=267, PETRI_TRANSITIONS=267} [2025-03-17 11:13:28,610 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -75 predicate places. [2025-03-17 11:13:28,610 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 267 transitions, 554 flow [2025-03-17 11:13:28,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-03-17 11:13:28,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:28,611 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-03-17 11:13:28,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:13:28,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:28,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash 711178697, now seen corresponding path program 1 times [2025-03-17 11:13:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:28,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636699569] [2025-03-17 11:13:28,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:28,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 11:13:28,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 11:13:28,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:28,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636699569] [2025-03-17 11:13:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636699569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:28,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051955484] [2025-03-17 11:13:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:28,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:28,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:28,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-17 11:13:28,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 267 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:28,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:28,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-17 11:13:28,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,129 INFO L124 PetriNetUnfolderBase]: 2624/6039 cut-off events. [2025-03-17 11:13:29,129 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:29,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9652 conditions, 6039 events. 2624/6039 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47478 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9578. Up to 3337 conditions per place. [2025-03-17 11:13:29,161 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-03-17 11:13:29,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 622 flow [2025-03-17 11:13:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-17 11:13:29,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-17 11:13:29,164 INFO L175 Difference]: Start difference. First operand has 267 places, 267 transitions, 554 flow. Second operand 3 states and 828 transitions. [2025-03-17 11:13:29,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 622 flow [2025-03-17 11:13:29,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 266 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,167 INFO L231 Difference]: Finished difference. Result has 266 places, 266 transitions, 552 flow [2025-03-17 11:13:29,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=266, PETRI_TRANSITIONS=266} [2025-03-17 11:13:29,168 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -76 predicate places. [2025-03-17 11:13:29,168 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 266 transitions, 552 flow [2025-03-17 11:13:29,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:29,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,169 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] [2025-03-17 11:13:29,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:13:29,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:29,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1147289628, now seen corresponding path program 1 times [2025-03-17 11:13:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074772864] [2025-03-17 11:13:29,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:13:29,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:13:29,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:29,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074772864] [2025-03-17 11:13:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074772864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521443627] [2025-03-17 11:13:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-17 11:13:29,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 266 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:29,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-17 11:13:29,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,716 INFO L124 PetriNetUnfolderBase]: 2624/6038 cut-off events. [2025-03-17 11:13:29,716 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:29,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9651 conditions, 6038 events. 2624/6038 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47457 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9569. Up to 3337 conditions per place. [2025-03-17 11:13:29,743 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-03-17 11:13:29,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 265 transitions, 620 flow [2025-03-17 11:13:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-17 11:13:29,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-17 11:13:29,745 INFO L175 Difference]: Start difference. First operand has 266 places, 266 transitions, 552 flow. Second operand 3 states and 828 transitions. [2025-03-17 11:13:29,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 265 transitions, 620 flow [2025-03-17 11:13:29,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 265 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,748 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 550 flow [2025-03-17 11:13:29,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-03-17 11:13:29,749 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -77 predicate places. [2025-03-17 11:13:29,749 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 550 flow [2025-03-17 11:13:29,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:29,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:29,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:13:29,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:29,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash 406295352, now seen corresponding path program 1 times [2025-03-17 11:13:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480365431] [2025-03-17 11:13:29,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 11:13:29,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 11:13:29,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480365431] [2025-03-17 11:13:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480365431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503587552] [2025-03-17 11:13:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-17 11:13:29,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:29,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-17 11:13:29,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:30,259 INFO L124 PetriNetUnfolderBase]: 2624/6037 cut-off events. [2025-03-17 11:13:30,259 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:30,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9650 conditions, 6037 events. 2624/6037 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47496 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9560. Up to 3337 conditions per place. [2025-03-17 11:13:30,289 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-03-17 11:13:30,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 264 transitions, 618 flow [2025-03-17 11:13:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-17 11:13:30,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-17 11:13:30,291 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 550 flow. Second operand 3 states and 828 transitions. [2025-03-17 11:13:30,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 264 transitions, 618 flow [2025-03-17 11:13:30,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:30,294 INFO L231 Difference]: Finished difference. Result has 264 places, 264 transitions, 548 flow [2025-03-17 11:13:30,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=264, PETRI_TRANSITIONS=264} [2025-03-17 11:13:30,294 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -78 predicate places. [2025-03-17 11:13:30,295 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 264 transitions, 548 flow [2025-03-17 11:13:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:30,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:30,295 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] [2025-03-17 11:13:30,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:13:30,295 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:30,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1099127396, now seen corresponding path program 1 times [2025-03-17 11:13:30,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:30,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112189990] [2025-03-17 11:13:30,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:30,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:30,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:13:30,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:13:30,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:30,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112189990] [2025-03-17 11:13:30,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112189990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:30,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:30,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476041431] [2025-03-17 11:13:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:30,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:30,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:30,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:30,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-17 11:13:30,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-03-17 11:13:30,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:30,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-17 11:13:30,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:30,781 INFO L124 PetriNetUnfolderBase]: 2624/6035 cut-off events. [2025-03-17 11:13:30,782 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:30,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9648 conditions, 6035 events. 2624/6035 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47458 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9550. Up to 3337 conditions per place. [2025-03-17 11:13:30,812 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 34 selfloop transitions, 1 changer transitions 0/262 dead transitions. [2025-03-17 11:13:30,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 262 transitions, 614 flow [2025-03-17 11:13:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2025-03-17 11:13:30,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7388591800356507 [2025-03-17 11:13:30,814 INFO L175 Difference]: Start difference. First operand has 264 places, 264 transitions, 548 flow. Second operand 3 states and 829 transitions. [2025-03-17 11:13:30,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 262 transitions, 614 flow [2025-03-17 11:13:30,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 262 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:30,817 INFO L231 Difference]: Finished difference. Result has 262 places, 262 transitions, 542 flow [2025-03-17 11:13:30,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=262, PETRI_TRANSITIONS=262} [2025-03-17 11:13:30,818 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -80 predicate places. [2025-03-17 11:13:30,818 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 262 transitions, 542 flow [2025-03-17 11:13:30,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-03-17 11:13:30,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:30,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:30,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:13:30,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1265345306, now seen corresponding path program 1 times [2025-03-17 11:13:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977580514] [2025-03-17 11:13:30,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:30,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 11:13:30,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 11:13:30,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:30,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977580514] [2025-03-17 11:13:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977580514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:30,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:30,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:30,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227658789] [2025-03-17 11:13:30,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:30,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:30,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:30,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:30,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:30,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-17 11:13:30,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 262 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:30,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:30,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-17 11:13:30,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:31,321 INFO L124 PetriNetUnfolderBase]: 2624/6034 cut-off events. [2025-03-17 11:13:31,321 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:31,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9646 conditions, 6034 events. 2624/6034 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47479 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9548. Up to 3337 conditions per place. [2025-03-17 11:13:31,400 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2025-03-17 11:13:31,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 261 transitions, 610 flow [2025-03-17 11:13:31,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-17 11:13:31,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-17 11:13:31,407 INFO L175 Difference]: Start difference. First operand has 262 places, 262 transitions, 542 flow. Second operand 3 states and 828 transitions. [2025-03-17 11:13:31,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 261 transitions, 610 flow [2025-03-17 11:13:31,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 261 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:31,409 INFO L231 Difference]: Finished difference. Result has 262 places, 261 transitions, 543 flow [2025-03-17 11:13:31,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=262, PETRI_TRANSITIONS=261} [2025-03-17 11:13:31,410 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -80 predicate places. [2025-03-17 11:13:31,410 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 261 transitions, 543 flow [2025-03-17 11:13:31,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-17 11:13:31,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:31,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:31,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:13:31,411 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:31,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1680008012, now seen corresponding path program 1 times [2025-03-17 11:13:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28669499] [2025-03-17 11:13:31,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:31,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 11:13:31,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 11:13:31,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:31,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28669499] [2025-03-17 11:13:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28669499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818319535] [2025-03-17 11:13:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:31,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:31,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:31,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 374 [2025-03-17 11:13:31,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 261 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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-03-17 11:13:31,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:31,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 374 [2025-03-17 11:13:31,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:32,409 INFO L124 PetriNetUnfolderBase]: 2624/6033 cut-off events. [2025-03-17 11:13:32,410 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:32,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9655 conditions, 6033 events. 2624/6033 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47370 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9558. Up to 3342 conditions per place. [2025-03-17 11:13:32,444 INFO L140 encePairwiseOnDemand]: 368/374 looper letters, 38 selfloop transitions, 5 changer transitions 0/260 dead transitions. [2025-03-17 11:13:32,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 260 transitions, 627 flow [2025-03-17 11:13:32,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1586 transitions. [2025-03-17 11:13:32,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7067736185383244 [2025-03-17 11:13:32,447 INFO L175 Difference]: Start difference. First operand has 262 places, 261 transitions, 543 flow. Second operand 6 states and 1586 transitions. [2025-03-17 11:13:32,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 260 transitions, 627 flow [2025-03-17 11:13:32,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 260 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:32,449 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 547 flow [2025-03-17 11:13:32,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2025-03-17 11:13:32,450 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -78 predicate places. [2025-03-17 11:13:32,450 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 547 flow [2025-03-17 11:13:32,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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-03-17 11:13:32,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:32,451 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] [2025-03-17 11:13:32,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:13:32,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:32,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash -408862517, now seen corresponding path program 1 times [2025-03-17 11:13:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560092959] [2025-03-17 11:13:32,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:32,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:32,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 11:13:32,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 11:13:32,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:32,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560092959] [2025-03-17 11:13:32,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560092959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:32,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:32,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470994961] [2025-03-17 11:13:32,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:32,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:32,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:32,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:32,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 374 [2025-03-17 11:13:32,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-03-17 11:13:32,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:32,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 374 [2025-03-17 11:13:32,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:33,115 INFO L124 PetriNetUnfolderBase]: 2624/6032 cut-off events. [2025-03-17 11:13:33,115 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:33,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9647 conditions, 6032 events. 2624/6032 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47411 event pairs, 1306 based on Foata normal form. 0/5100 useless extension candidates. Maximal degree in co-relation 9629. Up to 3335 conditions per place. [2025-03-17 11:13:33,147 INFO L140 encePairwiseOnDemand]: 372/374 looper letters, 32 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2025-03-17 11:13:33,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 259 transitions, 611 flow [2025-03-17 11:13:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2025-03-17 11:13:33,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7442067736185384 [2025-03-17 11:13:33,152 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 547 flow. Second operand 3 states and 835 transitions. [2025-03-17 11:13:33,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 259 transitions, 611 flow [2025-03-17 11:13:33,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 259 transitions, 601 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:33,155 INFO L231 Difference]: Finished difference. Result has 260 places, 259 transitions, 537 flow [2025-03-17 11:13:33,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=260, PETRI_TRANSITIONS=259} [2025-03-17 11:13:33,155 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -82 predicate places. [2025-03-17 11:13:33,156 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 537 flow [2025-03-17 11:13:33,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-03-17 11:13:33,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:33,156 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] [2025-03-17 11:13:33,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:13:33,156 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-17 11:13:33,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1740768362, now seen corresponding path program 1 times [2025-03-17 11:13:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:33,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953709460] [2025-03-17 11:13:33,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:33,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 11:13:33,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 11:13:33,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:33,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:33,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953709460] [2025-03-17 11:13:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953709460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:33,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295547165] [2025-03-17 11:13:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:33,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:33,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:33,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:33,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:33,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 374 [2025-03-17 11:13:33,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-03-17 11:13:33,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:33,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 374 [2025-03-17 11:13:33,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:33,933 INFO L124 PetriNetUnfolderBase]: 2624/6031 cut-off events. [2025-03-17 11:13:33,933 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-03-17 11:13:33,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9641 conditions, 6031 events. 2624/6031 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 47484 event pairs, 1306 based on Foata normal form. 1/5100 useless extension candidates. Maximal degree in co-relation 9633. Up to 3335 conditions per place. [2025-03-17 11:13:33,953 INFO L140 encePairwiseOnDemand]: 372/374 looper letters, 0 selfloop transitions, 0 changer transitions 258/258 dead transitions. [2025-03-17 11:13:33,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 258 transitions, 599 flow [2025-03-17 11:13:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2025-03-17 11:13:33,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7433155080213903 [2025-03-17 11:13:33,955 INFO L175 Difference]: Start difference. First operand has 260 places, 259 transitions, 537 flow. Second operand 3 states and 834 transitions. [2025-03-17 11:13:33,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 258 transitions, 599 flow [2025-03-17 11:13:33,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 258 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:33,957 INFO L231 Difference]: Finished difference. Result has 260 places, 0 transitions, 0 flow [2025-03-17 11:13:33,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=260, PETRI_TRANSITIONS=0} [2025-03-17 11:13:33,958 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -82 predicate places. [2025-03-17 11:13:33,958 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 0 transitions, 0 flow [2025-03-17 11:13:33,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-03-17 11:13:33,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (136 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (135 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (134 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (133 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (132 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (131 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (130 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (129 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (128 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (127 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (126 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (125 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (124 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (123 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (122 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (121 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (120 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (119 of 137 remaining) [2025-03-17 11:13:33,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (118 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (117 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (116 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (115 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (114 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (113 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (112 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (111 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (110 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (109 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (108 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (107 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (106 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (105 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (104 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (103 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (102 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (101 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (100 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (99 of 137 remaining) [2025-03-17 11:13:33,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (98 of 137 remaining) [2025-03-17 11:13:33,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (97 of 137 remaining) [2025-03-17 11:13:33,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (96 of 137 remaining) [2025-03-17 11:13:33,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (95 of 137 remaining) [2025-03-17 11:13:33,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (94 of 137 remaining) [2025-03-17 11:13:33,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (93 of 137 remaining) [2025-03-17 11:13:33,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (92 of 137 remaining) [2025-03-17 11:13:33,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (89 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (88 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (85 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (84 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (83 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (82 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (81 of 137 remaining) [2025-03-17 11:13:33,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (80 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (79 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (78 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (77 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (76 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (75 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (74 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (73 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (72 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (71 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (70 of 137 remaining) [2025-03-17 11:13:33,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (69 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (68 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (67 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (66 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (65 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (64 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (63 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (62 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (61 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (60 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (59 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (58 of 137 remaining) [2025-03-17 11:13:33,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork5Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork5Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (55 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (53 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (52 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (51 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (50 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (49 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (48 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (47 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (46 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (45 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (43 of 137 remaining) [2025-03-17 11:13:33,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (41 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (40 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (39 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (38 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (37 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (36 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (35 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (34 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (32 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (31 of 137 remaining) [2025-03-17 11:13:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (30 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (29 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (28 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork2Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork2Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (25 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (24 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (23 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (22 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (21 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (20 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (19 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (18 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (17 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (16 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (15 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (14 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (13 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (12 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (11 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (10 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (9 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (8 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (7 of 137 remaining) [2025-03-17 11:13:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (6 of 137 remaining) [2025-03-17 11:13:33,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (5 of 137 remaining) [2025-03-17 11:13:33,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (4 of 137 remaining) [2025-03-17 11:13:33,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (3 of 137 remaining) [2025-03-17 11:13:33,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (2 of 137 remaining) [2025-03-17 11:13:33,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 137 remaining) [2025-03-17 11:13:33,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (0 of 137 remaining) [2025-03-17 11:13:33,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:13:33,970 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:33,976 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:13:33,976 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:13:33,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:13:33 BasicIcfg [2025-03-17 11:13:33,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:13:33,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:13:33,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:13:33,982 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:13:33,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:22" (3/4) ... [2025-03-17 11:13:33,984 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:13:33,986 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:13:33,986 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:13:33,986 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:13:33,986 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-17 11:13:33,986 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-03-17 11:13:33,986 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-03-17 11:13:33,990 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 11:13:33,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:13:33,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:13:33,991 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:13:34,065 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:13:34,065 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:13:34,065 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:13:34,066 INFO L158 Benchmark]: Toolchain (without parser) took 12458.84ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 112.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-17 11:13:34,066 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:34,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.60ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:13:34,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.92ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:34,067 INFO L158 Benchmark]: Boogie Preprocessor took 34.40ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:34,068 INFO L158 Benchmark]: IcfgBuilder took 965.33ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 45.8MB in the end (delta: 47.2MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2025-03-17 11:13:34,068 INFO L158 Benchmark]: TraceAbstraction took 11118.12ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 45.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 992.5MB. Max. memory is 16.1GB. [2025-03-17 11:13:34,068 INFO L158 Benchmark]: Witness Printer took 84.23ms. Allocated memory is still 2.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:34,070 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.60ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.92ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.40ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 965.33ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 45.8MB in the end (delta: 47.2MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11118.12ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 45.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 992.5MB. Max. memory is 16.1GB. * Witness Printer took 84.23ms. Allocated memory is still 2.4GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 164]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: 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: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: 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: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 502 locations, 538 edges, 137 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: 11.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1043 IncrementalHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 49 mSDtfsCounter, 1043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=726occurred in iteration=0, InterpolantAutomatonStates: 45, 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, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:13:34,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE