./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-1_1-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/ldv-races/race-1_1-join.i -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 ab598119c4148bae0d8b880ae1fca3b30d4f7d9a1b46bb07e7f3565fa04f9e72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:52:09,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:52:10,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:52:10,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:52:10,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:52:10,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:52:10,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:52:10,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:52:10,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:52:10,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:52:10,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:52:10,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:52:10,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:52:10,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:52:10,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:52:10,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:52:10,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:52:10,062 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 -> ab598119c4148bae0d8b880ae1fca3b30d4f7d9a1b46bb07e7f3565fa04f9e72 [2025-03-08 21:52:10,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:52:10,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:52:10,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:52:10,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:52:10,381 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:52:10,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_1-join.i [2025-03-08 21:52:11,527 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8ee76d2/32b19d51f0824d49a1b91100dc1511be/FLAGf613ea44d [2025-03-08 21:52:11,875 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:52:11,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_1-join.i [2025-03-08 21:52:11,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8ee76d2/32b19d51f0824d49a1b91100dc1511be/FLAGf613ea44d [2025-03-08 21:52:12,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8ee76d2/32b19d51f0824d49a1b91100dc1511be [2025-03-08 21:52:12,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:52:12,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:52:12,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:52:12,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:52:12,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:52:12,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26eceadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12, skipping insertion in model container [2025-03-08 21:52:12,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:52:12,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:52:12,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:52:12,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:52:12,706 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:52:12,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12 WrapperNode [2025-03-08 21:52:12,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:52:12,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:52:12,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:52:12,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:52:12,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,753 INFO L138 Inliner]: procedures = 481, calls = 25, calls flagged for inlining = 9, calls inlined = 12, statements flattened = 128 [2025-03-08 21:52:12,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:52:12,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:52:12,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:52:12,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:52:12,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:52:12,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:52:12,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:52:12,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:52:12,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (1/1) ... [2025-03-08 21:52:12,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:52:12,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:52:12,815 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-08 21:52:12,819 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-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:52:12,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 21:52:12,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 21:52:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:52:12,838 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:52:13,035 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:52:13,037 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:52:13,180 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:52:13,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:52:13,196 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:52:13,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:52:13,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:52:13 BoogieIcfgContainer [2025-03-08 21:52:13,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:52:13,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:52:13,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:52:13,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:52:13,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:52:12" (1/3) ... [2025-03-08 21:52:13,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a71115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:52:13, skipping insertion in model container [2025-03-08 21:52:13,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:12" (2/3) ... [2025-03-08 21:52:13,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a71115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:52:13, skipping insertion in model container [2025-03-08 21:52:13,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:52:13" (3/3) ... [2025-03-08 21:52:13,207 INFO L128 eAbstractionObserver]: Analyzing ICFG race-1_1-join.i [2025-03-08 21:52:13,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:52:13,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-1_1-join.i that has 2 procedures, 148 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-08 21:52:13,218 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:52:13,285 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 21:52:13,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 157 transitions, 321 flow [2025-03-08 21:52:13,361 INFO L124 PetriNetUnfolderBase]: 9/172 cut-off events. [2025-03-08 21:52:13,365 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:52:13,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 172 events. 9/172 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 297 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 94. Up to 3 conditions per place. [2025-03-08 21:52:13,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 157 transitions, 321 flow [2025-03-08 21:52:13,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 284 flow [2025-03-08 21:52:13,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:52:13,394 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;@6677e460, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:52:13,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-08 21:52:13,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:52:13,401 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 21:52:13,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:52:13,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:13,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:52:13,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:52:13,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash -258018233, now seen corresponding path program 1 times [2025-03-08 21:52:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:13,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634496682] [2025-03-08 21:52:13,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:13,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 21:52:13,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 21:52:13,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:13,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:13,667 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-08 21:52:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:13,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634496682] [2025-03-08 21:52:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634496682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:13,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:13,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:13,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387306825] [2025-03-08 21:52:13,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:13,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:13,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:13,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 157 [2025-03-08 21:52:13,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 139 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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-08 21:52:13,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:13,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 157 [2025-03-08 21:52:13,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:13,804 INFO L124 PetriNetUnfolderBase]: 4/170 cut-off events. [2025-03-08 21:52:13,805 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:52:13,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 170 events. 4/170 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 394 event pairs, 4 based on Foata normal form. 8/159 useless extension candidates. Maximal degree in co-relation 86. Up to 25 conditions per place. [2025-03-08 21:52:13,808 INFO L140 encePairwiseOnDemand]: 148/157 looper letters, 15 selfloop transitions, 2 changer transitions 6/126 dead transitions. [2025-03-08 21:52:13,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 126 transitions, 292 flow [2025-03-08 21:52:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2025-03-08 21:52:13,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8598726114649682 [2025-03-08 21:52:13,820 INFO L175 Difference]: Start difference. First operand has 136 places, 139 transitions, 284 flow. Second operand 3 states and 405 transitions. [2025-03-08 21:52:13,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 126 transitions, 292 flow [2025-03-08 21:52:13,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 126 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:13,827 INFO L231 Difference]: Finished difference. Result has 129 places, 120 transitions, 246 flow [2025-03-08 21:52:13,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=129, PETRI_TRANSITIONS=120} [2025-03-08 21:52:13,831 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -7 predicate places. [2025-03-08 21:52:13,831 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 120 transitions, 246 flow [2025-03-08 21:52:13,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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-08 21:52:13,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:13,831 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] [2025-03-08 21:52:13,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:52:13,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:52:13,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1370534025, now seen corresponding path program 1 times [2025-03-08 21:52:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:13,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683874910] [2025-03-08 21:52:13,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:13,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 21:52:13,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 21:52:13,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:13,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:13,892 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-08 21:52:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683874910] [2025-03-08 21:52:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683874910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673328922] [2025-03-08 21:52:13,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:13,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:13,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:13,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:13,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 157 [2025-03-08 21:52:13,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 120 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-08 21:52:13,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:13,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 157 [2025-03-08 21:52:13,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:13,967 INFO L124 PetriNetUnfolderBase]: 0/132 cut-off events. [2025-03-08 21:52:13,968 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:52:13,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 132 events. 0/132 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 211 event pairs, 0 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2025-03-08 21:52:13,969 INFO L140 encePairwiseOnDemand]: 146/157 looper letters, 8 selfloop transitions, 6 changer transitions 3/116 dead transitions. [2025-03-08 21:52:13,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 116 transitions, 268 flow [2025-03-08 21:52:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-03-08 21:52:13,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8365180467091295 [2025-03-08 21:52:13,971 INFO L175 Difference]: Start difference. First operand has 129 places, 120 transitions, 246 flow. Second operand 3 states and 394 transitions. [2025-03-08 21:52:13,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 116 transitions, 268 flow [2025-03-08 21:52:13,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:13,973 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 240 flow [2025-03-08 21:52:13,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2025-03-08 21:52:13,977 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -17 predicate places. [2025-03-08 21:52:13,977 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 240 flow [2025-03-08 21:52:13,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-08 21:52:13,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:13,977 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] [2025-03-08 21:52:13,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:52:13,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:52:13,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1481662211, now seen corresponding path program 1 times [2025-03-08 21:52:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182654575] [2025-03-08 21:52:13,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:14,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 21:52:14,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 21:52:14,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:14,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:14,116 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-08 21:52:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182654575] [2025-03-08 21:52:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182654575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:14,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:14,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317930929] [2025-03-08 21:52:14,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:14,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:14,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:14,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:14,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 157 [2025-03-08 21:52:14,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-08 21:52:14,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:14,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 157 [2025-03-08 21:52:14,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:14,193 INFO L124 PetriNetUnfolderBase]: 4/155 cut-off events. [2025-03-08 21:52:14,193 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 21:52:14,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 155 events. 4/155 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 348 event pairs, 4 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 60. Up to 24 conditions per place. [2025-03-08 21:52:14,194 INFO L140 encePairwiseOnDemand]: 154/157 looper letters, 14 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-03-08 21:52:14,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 112 transitions, 270 flow [2025-03-08 21:52:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2025-03-08 21:52:14,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8450106157112527 [2025-03-08 21:52:14,197 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 240 flow. Second operand 3 states and 398 transitions. [2025-03-08 21:52:14,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 112 transitions, 270 flow [2025-03-08 21:52:14,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:14,199 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 230 flow [2025-03-08 21:52:14,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-03-08 21:52:14,200 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -21 predicate places. [2025-03-08 21:52:14,200 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 230 flow [2025-03-08 21:52:14,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-08 21:52:14,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:14,200 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] [2025-03-08 21:52:14,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:52:14,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:52:14,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1560719977, now seen corresponding path program 1 times [2025-03-08 21:52:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:14,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823556099] [2025-03-08 21:52:14,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:14,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 21:52:14,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 21:52:14,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:14,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:14,278 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-08 21:52:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823556099] [2025-03-08 21:52:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823556099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:14,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958494112] [2025-03-08 21:52:14,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:14,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:14,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:14,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:14,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 157 [2025-03-08 21:52:14,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-08 21:52:14,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:14,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 157 [2025-03-08 21:52:14,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:14,317 INFO L124 PetriNetUnfolderBase]: 6/171 cut-off events. [2025-03-08 21:52:14,317 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:52:14,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 171 events. 6/171 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 412 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 167. Up to 21 conditions per place. [2025-03-08 21:52:14,318 INFO L140 encePairwiseOnDemand]: 154/157 looper letters, 11 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-08 21:52:14,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 258 flow [2025-03-08 21:52:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2025-03-08 21:52:14,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8768577494692145 [2025-03-08 21:52:14,319 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 230 flow. Second operand 3 states and 413 transitions. [2025-03-08 21:52:14,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 258 flow [2025-03-08 21:52:14,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:14,322 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 228 flow [2025-03-08 21:52:14,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2025-03-08 21:52:14,322 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -22 predicate places. [2025-03-08 21:52:14,323 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 228 flow [2025-03-08 21:52:14,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-08 21:52:14,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:14,324 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] [2025-03-08 21:52:14,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:52:14,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:52:14,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash 403875054, now seen corresponding path program 1 times [2025-03-08 21:52:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419251092] [2025-03-08 21:52:14,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:14,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 21:52:14,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 21:52:14,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:14,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:14,386 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-08 21:52:14,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:14,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419251092] [2025-03-08 21:52:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419251092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:14,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993889097] [2025-03-08 21:52:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:14,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:14,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:14,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:14,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 157 [2025-03-08 21:52:14,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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-08 21:52:14,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:14,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 157 [2025-03-08 21:52:14,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:14,436 INFO L124 PetriNetUnfolderBase]: 0/126 cut-off events. [2025-03-08 21:52:14,436 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:52:14,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 126 events. 0/126 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 0. Up to 13 conditions per place. [2025-03-08 21:52:14,437 INFO L140 encePairwiseOnDemand]: 154/157 looper letters, 12 selfloop transitions, 2 changer transitions 6/110 dead transitions. [2025-03-08 21:52:14,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 254 flow [2025-03-08 21:52:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2025-03-08 21:52:14,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8535031847133758 [2025-03-08 21:52:14,438 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 228 flow. Second operand 3 states and 402 transitions. [2025-03-08 21:52:14,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 254 flow [2025-03-08 21:52:14,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 110 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:14,440 INFO L231 Difference]: Finished difference. Result has 113 places, 104 transitions, 214 flow [2025-03-08 21:52:14,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=113, PETRI_TRANSITIONS=104} [2025-03-08 21:52:14,440 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -23 predicate places. [2025-03-08 21:52:14,440 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 104 transitions, 214 flow [2025-03-08 21:52:14,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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-08 21:52:14,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:14,441 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] [2025-03-08 21:52:14,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:52:14,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:52:14,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash -39402691, now seen corresponding path program 1 times [2025-03-08 21:52:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:14,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925502750] [2025-03-08 21:52:14,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:14,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 21:52:14,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 21:52:14,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:14,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:14,544 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-08 21:52:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925502750] [2025-03-08 21:52:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925502750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:14,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390801977] [2025-03-08 21:52:14,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:14,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:14,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:14,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:14,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 157 [2025-03-08 21:52:14,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 104 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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-08 21:52:14,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:14,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 157 [2025-03-08 21:52:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:14,572 INFO L124 PetriNetUnfolderBase]: 4/123 cut-off events. [2025-03-08 21:52:14,572 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-03-08 21:52:14,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 123 events. 4/123 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 154 event pairs, 1 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 103. Up to 13 conditions per place. [2025-03-08 21:52:14,573 INFO L140 encePairwiseOnDemand]: 155/157 looper letters, 8 selfloop transitions, 1 changer transitions 19/105 dead transitions. [2025-03-08 21:52:14,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 105 transitions, 234 flow [2025-03-08 21:52:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2025-03-08 21:52:14,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8938428874734607 [2025-03-08 21:52:14,574 INFO L175 Difference]: Start difference. First operand has 113 places, 104 transitions, 214 flow. Second operand 3 states and 421 transitions. [2025-03-08 21:52:14,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 105 transitions, 234 flow [2025-03-08 21:52:14,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:14,576 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 172 flow [2025-03-08 21:52:14,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-03-08 21:52:14,577 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2025-03-08 21:52:14,578 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 172 flow [2025-03-08 21:52:14,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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-08 21:52:14,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:14,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:52:14,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:52:14,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 21:52:14,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash 663201211, now seen corresponding path program 1 times [2025-03-08 21:52:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165933672] [2025-03-08 21:52:14,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:14,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 21:52:14,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 21:52:14,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:14,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:14,649 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-08 21:52:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165933672] [2025-03-08 21:52:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165933672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:14,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:14,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3703120] [2025-03-08 21:52:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:14,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:14,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:14,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 157 [2025-03-08 21:52:14,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-08 21:52:14,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:14,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 157 [2025-03-08 21:52:14,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:14,702 INFO L124 PetriNetUnfolderBase]: 4/106 cut-off events. [2025-03-08 21:52:14,702 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:52:14,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 106 events. 4/106 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 4 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 115. Up to 19 conditions per place. [2025-03-08 21:52:14,702 INFO L140 encePairwiseOnDemand]: 155/157 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2025-03-08 21:52:14,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 83 transitions, 192 flow [2025-03-08 21:52:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2025-03-08 21:52:14,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8343949044585988 [2025-03-08 21:52:14,704 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 172 flow. Second operand 3 states and 393 transitions. [2025-03-08 21:52:14,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 83 transitions, 192 flow [2025-03-08 21:52:14,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:52:14,705 INFO L231 Difference]: Finished difference. Result has 88 places, 0 transitions, 0 flow [2025-03-08 21:52:14,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=88, PETRI_TRANSITIONS=0} [2025-03-08 21:52:14,706 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -48 predicate places. [2025-03-08 21:52:14,706 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 0 transitions, 0 flow [2025-03-08 21:52:14,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-08 21:52:14,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-03-08 21:52:14,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-08 21:52:14,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-08 21:52:14,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-08 21:52:14,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-08 21:52:14,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:52:14,710 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:52:14,713 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:52:14,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:52:14,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:52:14 BasicIcfg [2025-03-08 21:52:14,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:52:14,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:52:14,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:52:14,717 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:52:14,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:52:13" (3/4) ... [2025-03-08 21:52:14,718 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:52:14,720 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 21:52:14,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 21:52:14,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 21:52:14,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:52:14,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 21:52:14,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:52:14,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:52:14,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:52:14,775 INFO L158 Benchmark]: Toolchain (without parser) took 2669.01ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 82.7MB in the end (delta: 46.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2025-03-08 21:52:14,776 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:14,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.44ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 74.9MB in the end (delta: 54.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 21:52:14,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.81ms. Allocated memory is still 167.8MB. Free memory was 74.9MB in the beginning and 72.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:14,776 INFO L158 Benchmark]: Boogie Preprocessor took 30.03ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 69.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:14,776 INFO L158 Benchmark]: IcfgBuilder took 411.57ms. Allocated memory is still 167.8MB. Free memory was 69.8MB in the beginning and 47.9MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 21:52:14,776 INFO L158 Benchmark]: TraceAbstraction took 1516.08ms. Allocated memory is still 167.8MB. Free memory was 47.0MB in the beginning and 89.6MB in the end (delta: -42.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:14,776 INFO L158 Benchmark]: Witness Printer took 58.27ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 82.7MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:52:14,777 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.53ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.44ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 74.9MB in the end (delta: 54.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.81ms. Allocated memory is still 167.8MB. Free memory was 74.9MB in the beginning and 72.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.03ms. Allocated memory is still 167.8MB. Free memory was 72.1MB in the beginning and 69.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 411.57ms. Allocated memory is still 167.8MB. Free memory was 69.8MB in the beginning and 47.9MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1516.08ms. Allocated memory is still 167.8MB. Free memory was 47.0MB in the beginning and 89.6MB in the end (delta: -42.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 58.27ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 82.7MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1713]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1719]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1721]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1722]: 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 3 procedures, 177 locations, 188 edges, 13 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: 1.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 35 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=0, InterpolantAutomatonStates: 21, 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.5s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 21:52:14,791 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