./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/test-hard1.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 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:56:18,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:56:19,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:56:19,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:56:19,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:56:19,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:56:19,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:56:19,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:56:19,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:56:19,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:56:19,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:56:19,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:56:19,054 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:56:19,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:56:19,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:56:19,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:56:19,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:19,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:56:19,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:56:19,056 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 -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 [2025-03-04 06:56:19,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:56:19,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:56:19,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:56:19,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:56:19,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:56:19,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-03-04 06:56:20,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11826aac9/923d55c6f6ba41f5b6f5e6224af358f2/FLAG851a70cb8 [2025-03-04 06:56:20,767 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:56:20,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-03-04 06:56:20,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11826aac9/923d55c6f6ba41f5b6f5e6224af358f2/FLAG851a70cb8 [2025-03-04 06:56:20,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11826aac9/923d55c6f6ba41f5b6f5e6224af358f2 [2025-03-04 06:56:20,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:56:20,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:56:20,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:20,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:56:20,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:56:20,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:20" (1/1) ... [2025-03-04 06:56:20,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484d6cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:20, skipping insertion in model container [2025-03-04 06:56:20,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:20" (1/1) ... [2025-03-04 06:56:20,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:56:20,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:21,002 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:56:21,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:21,038 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:56:21,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21 WrapperNode [2025-03-04 06:56:21,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:21,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:21,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:56:21,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:56:21,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,064 INFO L138 Inliner]: procedures = 23, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2025-03-04 06:56:21,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:21,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:56:21,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:56:21,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:56:21,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:56:21,089 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:56:21,089 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:56:21,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:56:21,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (1/1) ... [2025-03-04 06:56:21,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:21,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:21,121 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-04 06:56:21,126 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-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:56:21,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:56:21,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:56:21,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 06:56:21,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:56:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:56:21,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:56:21,140 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:56:21,225 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:56:21,226 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:56:21,577 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:56:21,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:56:21,762 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:56:21,762 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:56:21,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:21 BoogieIcfgContainer [2025-03-04 06:56:21,763 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:56:21,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:56:21,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:56:21,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:56:21,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:56:20" (1/3) ... [2025-03-04 06:56:21,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81995ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:21, skipping insertion in model container [2025-03-04 06:56:21,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:21" (2/3) ... [2025-03-04 06:56:21,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81995ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:21, skipping insertion in model container [2025-03-04 06:56:21,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:21" (3/3) ... [2025-03-04 06:56:21,771 INFO L128 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2025-03-04 06:56:21,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:56:21,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-hard1.wvr.c that has 5 procedures, 196 locations, 1 initial locations, 4 loop locations, and 43 error locations. [2025-03-04 06:56:21,786 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:56:21,859 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:56:21,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 202 transitions, 432 flow [2025-03-04 06:56:21,969 INFO L124 PetriNetUnfolderBase]: 7/198 cut-off events. [2025-03-04 06:56:21,971 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:56:21,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 198 events. 7/198 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 264 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2025-03-04 06:56:21,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 202 transitions, 432 flow [2025-03-04 06:56:21,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 181 transitions, 386 flow [2025-03-04 06:56:21,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:21,998 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;@6bc53c8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:21,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-03-04 06:56:22,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:22,006 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-04 06:56:22,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:22,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:22,007 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] [2025-03-04 06:56:22,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:22,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash -634233419, now seen corresponding path program 1 times [2025-03-04 06:56:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:22,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662491315] [2025-03-04 06:56:22,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:22,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:22,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 06:56:22,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 06:56:22,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:22,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:22,149 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-04 06:56:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662491315] [2025-03-04 06:56:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662491315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:22,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:22,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:22,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495745316] [2025-03-04 06:56:22,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:22,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:22,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:22,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:22,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 202 [2025-03-04 06:56:22,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 181 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-04 06:56:22,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:22,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 202 [2025-03-04 06:56:22,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:22,475 INFO L124 PetriNetUnfolderBase]: 449/1011 cut-off events. [2025-03-04 06:56:22,475 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-04 06:56:22,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 1011 events. 449/1011 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5051 event pairs, 272 based on Foata normal form. 1/903 useless extension candidates. Maximal degree in co-relation 1525. Up to 614 conditions per place. [2025-03-04 06:56:22,485 INFO L140 encePairwiseOnDemand]: 166/202 looper letters, 25 selfloop transitions, 2 changer transitions 1/147 dead transitions. [2025-03-04 06:56:22,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 147 transitions, 372 flow [2025-03-04 06:56:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-04 06:56:22,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838283828382838 [2025-03-04 06:56:22,500 INFO L175 Difference]: Start difference. First operand has 188 places, 181 transitions, 386 flow. Second operand 3 states and 475 transitions. [2025-03-04 06:56:22,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 147 transitions, 372 flow [2025-03-04 06:56:22,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 356 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:56:22,509 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 304 flow [2025-03-04 06:56:22,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2025-03-04 06:56:22,514 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -39 predicate places. [2025-03-04 06:56:22,516 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 304 flow [2025-03-04 06:56:22,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-04 06:56:22,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:22,516 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] [2025-03-04 06:56:22,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:56:22,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:22,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash 708137953, now seen corresponding path program 1 times [2025-03-04 06:56:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234609976] [2025-03-04 06:56:22,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:22,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:22,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 06:56:22,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 06:56:22,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:22,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:22,556 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-04 06:56:22,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:22,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234609976] [2025-03-04 06:56:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234609976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:22,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:22,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924148678] [2025-03-04 06:56:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:22,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:22,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:22,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:22,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:22,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 202 [2025-03-04 06:56:22,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-04 06:56:22,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:22,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 202 [2025-03-04 06:56:22,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:22,720 INFO L124 PetriNetUnfolderBase]: 449/1009 cut-off events. [2025-03-04 06:56:22,720 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:56:22,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 1009 events. 449/1009 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5053 event pairs, 272 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1639. Up to 614 conditions per place. [2025-03-04 06:56:22,725 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 25 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-03-04 06:56:22,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 356 flow [2025-03-04 06:56:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2025-03-04 06:56:22,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7293729372937293 [2025-03-04 06:56:22,727 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 304 flow. Second operand 3 states and 442 transitions. [2025-03-04 06:56:22,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 356 flow [2025-03-04 06:56:22,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:22,730 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 302 flow [2025-03-04 06:56:22,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2025-03-04 06:56:22,732 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -41 predicate places. [2025-03-04 06:56:22,732 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 302 flow [2025-03-04 06:56:22,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-04 06:56:22,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:22,732 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] [2025-03-04 06:56:22,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:56:22,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:22,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2051962358, now seen corresponding path program 1 times [2025-03-04 06:56:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012369810] [2025-03-04 06:56:22,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:22,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:56:22,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:56:22,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:22,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:22,785 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-04 06:56:22,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:22,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012369810] [2025-03-04 06:56:22,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012369810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:22,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:22,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:22,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877218559] [2025-03-04 06:56:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:22,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:22,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:22,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:22,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:22,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 202 [2025-03-04 06:56:22,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-04 06:56:22,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:22,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 202 [2025-03-04 06:56:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:22,952 INFO L124 PetriNetUnfolderBase]: 449/1008 cut-off events. [2025-03-04 06:56:22,953 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:56:22,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 1008 events. 449/1008 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5066 event pairs, 272 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1630. Up to 613 conditions per place. [2025-03-04 06:56:22,959 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 24 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-03-04 06:56:22,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 352 flow [2025-03-04 06:56:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-03-04 06:56:22,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7326732673267327 [2025-03-04 06:56:22,961 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 302 flow. Second operand 3 states and 444 transitions. [2025-03-04 06:56:22,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 352 flow [2025-03-04 06:56:22,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 144 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:22,963 INFO L231 Difference]: Finished difference. Result has 146 places, 144 transitions, 300 flow [2025-03-04 06:56:22,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=146, PETRI_TRANSITIONS=144} [2025-03-04 06:56:22,964 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -42 predicate places. [2025-03-04 06:56:22,964 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 144 transitions, 300 flow [2025-03-04 06:56:22,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-04 06:56:22,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:22,965 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] [2025-03-04 06:56:22,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:56:22,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:22,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -24908360, now seen corresponding path program 1 times [2025-03-04 06:56:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267570925] [2025-03-04 06:56:22,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:22,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:56:22,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:56:22,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:22,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:22,997 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-04 06:56:22,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:22,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267570925] [2025-03-04 06:56:22,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267570925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:22,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:22,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:22,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366530459] [2025-03-04 06:56:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:22,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:22,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:22,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:23,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 202 [2025-03-04 06:56:23,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 144 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-04 06:56:23,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:23,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 202 [2025-03-04 06:56:23,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:23,169 INFO L124 PetriNetUnfolderBase]: 449/1007 cut-off events. [2025-03-04 06:56:23,170 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:56:23,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 1007 events. 449/1007 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5065 event pairs, 272 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1621. Up to 613 conditions per place. [2025-03-04 06:56:23,177 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 24 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2025-03-04 06:56:23,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 143 transitions, 350 flow [2025-03-04 06:56:23,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-03-04 06:56:23,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7326732673267327 [2025-03-04 06:56:23,180 INFO L175 Difference]: Start difference. First operand has 146 places, 144 transitions, 300 flow. Second operand 3 states and 444 transitions. [2025-03-04 06:56:23,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 143 transitions, 350 flow [2025-03-04 06:56:23,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:23,191 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 298 flow [2025-03-04 06:56:23,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-03-04 06:56:23,192 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -43 predicate places. [2025-03-04 06:56:23,192 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 298 flow [2025-03-04 06:56:23,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-04 06:56:23,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:23,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:23,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:56:23,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:23,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1193009986, now seen corresponding path program 1 times [2025-03-04 06:56:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:23,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089128851] [2025-03-04 06:56:23,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:23,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:23,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:56:23,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:56:23,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:23,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:23,238 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-04 06:56:23,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:23,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089128851] [2025-03-04 06:56:23,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089128851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:23,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:23,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390431803] [2025-03-04 06:56:23,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:23,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:23,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:23,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:23,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:23,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 202 [2025-03-04 06:56:23,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-04 06:56:23,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:23,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 202 [2025-03-04 06:56:23,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:23,351 INFO L124 PetriNetUnfolderBase]: 449/1006 cut-off events. [2025-03-04 06:56:23,351 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:56:23,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 1006 events. 449/1006 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5078 event pairs, 272 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1611. Up to 612 conditions per place. [2025-03-04 06:56:23,357 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 23 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-03-04 06:56:23,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 142 transitions, 346 flow [2025-03-04 06:56:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2025-03-04 06:56:23,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.735973597359736 [2025-03-04 06:56:23,359 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 298 flow. Second operand 3 states and 446 transitions. [2025-03-04 06:56:23,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 142 transitions, 346 flow [2025-03-04 06:56:23,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:23,361 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 296 flow [2025-03-04 06:56:23,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2025-03-04 06:56:23,362 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -44 predicate places. [2025-03-04 06:56:23,362 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 296 flow [2025-03-04 06:56:23,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-04 06:56:23,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:23,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:23,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:56:23,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:23,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash -989892576, now seen corresponding path program 1 times [2025-03-04 06:56:23,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:23,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563644596] [2025-03-04 06:56:23,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:23,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:23,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:56:23,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:56:23,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:23,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:23,407 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-04 06:56:23,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563644596] [2025-03-04 06:56:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563644596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:23,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906448751] [2025-03-04 06:56:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:23,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:23,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:23,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:23,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 202 [2025-03-04 06:56:23,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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-04 06:56:23,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:23,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 202 [2025-03-04 06:56:23,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:23,607 INFO L124 PetriNetUnfolderBase]: 640/1499 cut-off events. [2025-03-04 06:56:23,608 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-04 06:56:23,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 1499 events. 640/1499 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8779 event pairs, 302 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 2372. Up to 618 conditions per place. [2025-03-04 06:56:23,618 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 39 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-03-04 06:56:23,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 158 transitions, 421 flow [2025-03-04 06:56:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-03-04 06:56:23,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7673267326732673 [2025-03-04 06:56:23,620 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 296 flow. Second operand 3 states and 465 transitions. [2025-03-04 06:56:23,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 158 transitions, 421 flow [2025-03-04 06:56:23,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:23,622 INFO L231 Difference]: Finished difference. Result has 144 places, 143 transitions, 316 flow [2025-03-04 06:56:23,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=144, PETRI_TRANSITIONS=143} [2025-03-04 06:56:23,624 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -44 predicate places. [2025-03-04 06:56:23,625 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 143 transitions, 316 flow [2025-03-04 06:56:23,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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-04 06:56:23,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:23,625 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-04 06:56:23,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:56:23,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:23,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2098975463, now seen corresponding path program 1 times [2025-03-04 06:56:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:23,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289267732] [2025-03-04 06:56:23,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:23,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:56:23,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:56:23,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:23,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:23,682 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-04 06:56:23,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:23,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289267732] [2025-03-04 06:56:23,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289267732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:23,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:23,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:23,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52642884] [2025-03-04 06:56:23,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:23,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:23,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:23,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:23,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 202 [2025-03-04 06:56:23,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 143 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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-04 06:56:23,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:23,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 202 [2025-03-04 06:56:23,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:23,884 INFO L124 PetriNetUnfolderBase]: 847/1919 cut-off events. [2025-03-04 06:56:23,885 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-03-04 06:56:23,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 1919 events. 847/1919 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12220 event pairs, 224 based on Foata normal form. 1/1720 useless extension candidates. Maximal degree in co-relation 1010. Up to 794 conditions per place. [2025-03-04 06:56:23,892 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 2 selfloop transitions, 1 changer transitions 94/159 dead transitions. [2025-03-04 06:56:23,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 159 transitions, 453 flow [2025-03-04 06:56:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2025-03-04 06:56:23,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7623762376237624 [2025-03-04 06:56:23,893 INFO L175 Difference]: Start difference. First operand has 144 places, 143 transitions, 316 flow. Second operand 3 states and 462 transitions. [2025-03-04 06:56:23,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 159 transitions, 453 flow [2025-03-04 06:56:23,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 159 transitions, 441 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:23,897 INFO L231 Difference]: Finished difference. Result has 142 places, 65 transitions, 134 flow [2025-03-04 06:56:23,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=142, PETRI_TRANSITIONS=65} [2025-03-04 06:56:23,898 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -46 predicate places. [2025-03-04 06:56:23,899 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 65 transitions, 134 flow [2025-03-04 06:56:23,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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-04 06:56:23,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:23,899 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] [2025-03-04 06:56:23,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:56:23,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:23,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -312107450, now seen corresponding path program 1 times [2025-03-04 06:56:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618187110] [2025-03-04 06:56:23,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:23,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:56:23,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:56:23,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:23,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:23,943 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-04 06:56:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618187110] [2025-03-04 06:56:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618187110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094384906] [2025-03-04 06:56:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:23,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:23,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:23,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:23,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 202 [2025-03-04 06:56:23,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 65 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-04 06:56:23,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:23,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 202 [2025-03-04 06:56:23,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:23,959 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2025-03-04 06:56:23,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:23,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 0/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 06:56:23,960 INFO L140 encePairwiseOnDemand]: 200/202 looper letters, 2 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-03-04 06:56:23,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 138 flow [2025-03-04 06:56:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2025-03-04 06:56:23,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7145214521452146 [2025-03-04 06:56:23,965 INFO L175 Difference]: Start difference. First operand has 142 places, 65 transitions, 134 flow. Second operand 3 states and 433 transitions. [2025-03-04 06:56:23,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 138 flow [2025-03-04 06:56:23,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:23,966 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 132 flow [2025-03-04 06:56:23,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-03-04 06:56:23,967 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -119 predicate places. [2025-03-04 06:56:23,967 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 132 flow [2025-03-04 06:56:23,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-04 06:56:23,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:23,967 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] [2025-03-04 06:56:23,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:56:23,967 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-04 06:56:23,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:23,970 INFO L85 PathProgramCache]: Analyzing trace with hash 712469085, now seen corresponding path program 1 times [2025-03-04 06:56:23,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:23,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668038661] [2025-03-04 06:56:23,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:23,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:23,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:56:23,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:56:23,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:23,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:24,015 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-04 06:56:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668038661] [2025-03-04 06:56:24,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668038661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:24,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:24,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112232746] [2025-03-04 06:56:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:24,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:24,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:24,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:24,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 202 [2025-03-04 06:56:24,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-04 06:56:24,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:24,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 202 [2025-03-04 06:56:24,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:24,029 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2025-03-04 06:56:24,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:24,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 0/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 06:56:24,029 INFO L140 encePairwiseOnDemand]: 200/202 looper letters, 0 selfloop transitions, 0 changer transitions 63/63 dead transitions. [2025-03-04 06:56:24,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 134 flow [2025-03-04 06:56:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2025-03-04 06:56:24,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7128712871287128 [2025-03-04 06:56:24,031 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 132 flow. Second operand 3 states and 432 transitions. [2025-03-04 06:56:24,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 134 flow [2025-03-04 06:56:24,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:24,032 INFO L231 Difference]: Finished difference. Result has 69 places, 0 transitions, 0 flow [2025-03-04 06:56:24,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=69, PETRI_TRANSITIONS=0} [2025-03-04 06:56:24,033 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -119 predicate places. [2025-03-04 06:56:24,033 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 0 transitions, 0 flow [2025-03-04 06:56:24,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-04 06:56:24,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (78 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-03-04 06:56:24,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-03-04 06:56:24,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-03-04 06:56:24,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-03-04 06:56:24,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-03-04 06:56:24,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-03-04 06:56:24,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-03-04 06:56:24,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:56:24,043 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:24,047 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:56:24,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:56:24,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:56:24 BasicIcfg [2025-03-04 06:56:24,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:56:24,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:56:24,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:56:24,058 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:56:24,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:21" (3/4) ... [2025-03-04 06:56:24,060 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:56:24,062 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:56:24,062 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:56:24,062 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:56:24,062 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-04 06:56:24,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 06:56:24,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:56:24,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 06:56:24,067 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:56:24,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:56:24,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:56:24,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:56:24,129 INFO L158 Benchmark]: Toolchain (without parser) took 3313.75ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 107.2MB in the beginning and 151.9MB in the end (delta: -44.7MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2025-03-04 06:56:24,129 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:24,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.70ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:24,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.98ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:24,130 INFO L158 Benchmark]: Boogie Preprocessor took 18.57ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.1MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:24,130 INFO L158 Benchmark]: IcfgBuilder took 673.23ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 49.3MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 06:56:24,130 INFO L158 Benchmark]: TraceAbstraction took 2292.74ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 48.8MB in the beginning and 55.8MB in the end (delta: -7.0MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-03-04 06:56:24,130 INFO L158 Benchmark]: Witness Printer took 71.11ms. Allocated memory is still 192.9MB. Free memory was 55.8MB in the beginning and 151.9MB in the end (delta: -96.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:24,133 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.35ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.70ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.98ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.57ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.1MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 673.23ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 49.3MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2292.74ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 48.8MB in the beginning and 55.8MB in the end (delta: -7.0MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 71.11ms. Allocated memory is still 192.9MB. Free memory was 55.8MB in the beginning and 151.9MB in the end (delta: -96.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - 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: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: 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: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - 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: 111]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 264 locations, 79 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 388 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 38 mSDtfsCounter, 388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=0, InterpolantAutomatonStates: 27, 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.3s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 43 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:56:24,150 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