./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.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/goblint-regression/13-privatized_25-struct_nr_true.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 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:00:48,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:00:48,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:00:48,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:00:48,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:00:48,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:00:48,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:00:48,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:00:48,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:00:48,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:00:48,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:00:48,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:00:48,259 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:00:48,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:00:48,260 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:00:48,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:00:48,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:00:48,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:00:48,261 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 -> 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff [2025-03-08 22:00:48,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:00:48,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:00:48,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:00:48,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:00:48,528 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:00:48,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2025-03-08 22:00:49,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c1710ee/72c4c86c0af9452ea915860b202c06e7/FLAGda45ec127 [2025-03-08 22:00:49,923 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:00:49,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2025-03-08 22:00:49,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c1710ee/72c4c86c0af9452ea915860b202c06e7/FLAGda45ec127 [2025-03-08 22:00:49,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c1710ee/72c4c86c0af9452ea915860b202c06e7 [2025-03-08 22:00:49,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:00:49,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:00:49,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:00:49,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:00:49,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:00:49,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:00:49" (1/1) ... [2025-03-08 22:00:49,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b986871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:49, skipping insertion in model container [2025-03-08 22:00:49,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:00:49" (1/1) ... [2025-03-08 22:00:49,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:00:50,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:00:50,170 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:00:50,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:00:50,243 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:00:50,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50 WrapperNode [2025-03-08 22:00:50,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:00:50,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:00:50,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:00:50,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:00:50,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,275 INFO L138 Inliner]: procedures = 162, calls = 22, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 111 [2025-03-08 22:00:50,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:00:50,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:00:50,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:00:50,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:00:50,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:00:50,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:00:50,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:00:50,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:00:50,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (1/1) ... [2025-03-08 22:00:50,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:00:50,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:00:50,335 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 22:00:50,338 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 22:00:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:00:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:00:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:00:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:00:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:00:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:00:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:00:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:00:50,357 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 22:00:50,444 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:00:50,445 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:00:50,606 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:00:50,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:00:50,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:00:50,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:00:50,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:00:50 BoogieIcfgContainer [2025-03-08 22:00:50,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:00:50,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:00:50,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:00:50,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:00:50,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:00:49" (1/3) ... [2025-03-08 22:00:50,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8ae48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:00:50, skipping insertion in model container [2025-03-08 22:00:50,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:50" (2/3) ... [2025-03-08 22:00:50,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8ae48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:00:50, skipping insertion in model container [2025-03-08 22:00:50,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:00:50" (3/3) ... [2025-03-08 22:00:50,626 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.i [2025-03-08 22:00:50,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:00:50,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_25-struct_nr_true.i that has 2 procedures, 133 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-08 22:00:50,636 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:00:50,690 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:00:50,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 140 transitions, 287 flow [2025-03-08 22:00:50,776 INFO L124 PetriNetUnfolderBase]: 8/139 cut-off events. [2025-03-08 22:00:50,778 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:00:50,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 139 events. 8/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 194 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2025-03-08 22:00:50,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 140 transitions, 287 flow [2025-03-08 22:00:50,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 134 transitions, 271 flow [2025-03-08 22:00:50,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:00:50,797 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;@36df3046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:00:50,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-08 22:00:50,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:00:50,804 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-03-08 22:00:50,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:00:50,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:00:50,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:00:50,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:00:50,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:00:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1731074624, now seen corresponding path program 1 times [2025-03-08 22:00:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:00:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867870166] [2025-03-08 22:00:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:00:50,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:00:50,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 22:00:50,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 22:00:50,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:00:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:00:50,963 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 22:00:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:00:50,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867870166] [2025-03-08 22:00:50,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867870166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:00:50,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:00:50,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:00:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761174122] [2025-03-08 22:00:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:00:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:00:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:00:51,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:00:51,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:00:51,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 140 [2025-03-08 22:00:51,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 134 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 22:00:51,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:00:51,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 140 [2025-03-08 22:00:51,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:00:51,252 INFO L124 PetriNetUnfolderBase]: 110/821 cut-off events. [2025-03-08 22:00:51,252 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:00:51,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 821 events. 110/821 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5189 event pairs, 49 based on Foata normal form. 86/814 useless extension candidates. Maximal degree in co-relation 1056. Up to 167 conditions per place. [2025-03-08 22:00:51,258 INFO L140 encePairwiseOnDemand]: 111/140 looper letters, 29 selfloop transitions, 15 changer transitions 3/135 dead transitions. [2025-03-08 22:00:51,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 361 flow [2025-03-08 22:00:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:00:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:00:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-08 22:00:51,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-08 22:00:51,273 INFO L175 Difference]: Start difference. First operand has 130 places, 134 transitions, 271 flow. Second operand 3 states and 364 transitions. [2025-03-08 22:00:51,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 135 transitions, 361 flow [2025-03-08 22:00:51,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 135 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:00:51,281 INFO L231 Difference]: Finished difference. Result has 124 places, 128 transitions, 356 flow [2025-03-08 22:00:51,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=124, PETRI_TRANSITIONS=128} [2025-03-08 22:00:51,286 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-03-08 22:00:51,286 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 128 transitions, 356 flow [2025-03-08 22:00:51,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 22:00:51,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:00:51,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:00:51,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:00:51,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:00:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:00:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1999450177, now seen corresponding path program 1 times [2025-03-08 22:00:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:00:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244365119] [2025-03-08 22:00:51,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:00:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:00:51,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:00:51,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:00:51,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:00:51,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:00:51,383 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 22:00:51,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:00:51,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244365119] [2025-03-08 22:00:51,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244365119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:00:51,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:00:51,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:00:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436971607] [2025-03-08 22:00:51,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:00:51,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:00:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:00:51,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:00:51,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:00:51,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2025-03-08 22:00:51,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 128 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 22:00:51,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:00:51,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2025-03-08 22:00:51,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:00:51,560 INFO L124 PetriNetUnfolderBase]: 132/926 cut-off events. [2025-03-08 22:00:51,561 INFO L125 PetriNetUnfolderBase]: For 301/333 co-relation queries the response was YES. [2025-03-08 22:00:51,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 926 events. 132/926 cut-off events. For 301/333 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6133 event pairs, 59 based on Foata normal form. 2/832 useless extension candidates. Maximal degree in co-relation 1504. Up to 230 conditions per place. [2025-03-08 22:00:51,567 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 29 selfloop transitions, 10 changer transitions 0/138 dead transitions. [2025-03-08 22:00:51,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 474 flow [2025-03-08 22:00:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:00:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:00:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2025-03-08 22:00:51,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8261904761904761 [2025-03-08 22:00:51,569 INFO L175 Difference]: Start difference. First operand has 124 places, 128 transitions, 356 flow. Second operand 3 states and 347 transitions. [2025-03-08 22:00:51,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 474 flow [2025-03-08 22:00:51,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:00:51,574 INFO L231 Difference]: Finished difference. Result has 123 places, 136 transitions, 412 flow [2025-03-08 22:00:51,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=123, PETRI_TRANSITIONS=136} [2025-03-08 22:00:51,575 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2025-03-08 22:00:51,575 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 136 transitions, 412 flow [2025-03-08 22:00:51,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 22:00:51,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:00:51,575 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-08 22:00:51,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:00:51,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:00:51,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:00:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1999056207, now seen corresponding path program 1 times [2025-03-08 22:00:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:00:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952300831] [2025-03-08 22:00:51,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:00:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:00:51,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:00:51,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:00:51,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:00:51,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:00:51,689 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 22:00:51,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:00:51,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952300831] [2025-03-08 22:00:51,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952300831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:00:51,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:00:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:00:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893438691] [2025-03-08 22:00:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:00:51,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:00:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:00:51,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:00:51,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:00:51,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 140 [2025-03-08 22:00:51,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 136 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 22:00:51,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:00:51,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 140 [2025-03-08 22:00:51,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:00:51,750 INFO L124 PetriNetUnfolderBase]: 1/180 cut-off events. [2025-03-08 22:00:51,750 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-08 22:00:51,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 180 events. 1/180 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 222 event pairs, 0 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 204. Up to 21 conditions per place. [2025-03-08 22:00:51,750 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 2 selfloop transitions, 4 changer transitions 9/110 dead transitions. [2025-03-08 22:00:51,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 110 transitions, 286 flow [2025-03-08 22:00:51,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:00:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:00:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-03-08 22:00:51,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2025-03-08 22:00:51,755 INFO L175 Difference]: Start difference. First operand has 123 places, 136 transitions, 412 flow. Second operand 3 states and 371 transitions. [2025-03-08 22:00:51,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 110 transitions, 286 flow [2025-03-08 22:00:51,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 256 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-08 22:00:51,757 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 234 flow [2025-03-08 22:00:51,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=115, PETRI_TRANSITIONS=101} [2025-03-08 22:00:51,758 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -15 predicate places. [2025-03-08 22:00:51,758 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 234 flow [2025-03-08 22:00:51,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 22:00:51,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:00:51,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:00:51,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:00:51,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:00:51,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:00:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1573942624, now seen corresponding path program 1 times [2025-03-08 22:00:51,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:00:51,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325234725] [2025-03-08 22:00:51,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:00:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:00:51,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 22:00:51,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:00:51,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:00:51,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:00:51,819 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 22:00:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:00:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325234725] [2025-03-08 22:00:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325234725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:00:51,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:00:51,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:00:51,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286177338] [2025-03-08 22:00:51,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:00:51,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:00:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:00:51,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:00:51,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:00:51,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2025-03-08 22:00:51,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 101 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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 22:00:51,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:00:51,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2025-03-08 22:00:51,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:00:51,906 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-08 22:00:51,906 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:00:51,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 160 events. 1/160 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 149 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 187. Up to 31 conditions per place. [2025-03-08 22:00:51,907 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 18 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-03-08 22:00:51,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 272 flow [2025-03-08 22:00:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:00:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:00:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2025-03-08 22:00:51,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2025-03-08 22:00:51,909 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 234 flow. Second operand 3 states and 343 transitions. [2025-03-08 22:00:51,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 272 flow [2025-03-08 22:00:51,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:00:51,912 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 232 flow [2025-03-08 22:00:51,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2025-03-08 22:00:51,914 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -24 predicate places. [2025-03-08 22:00:51,914 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 232 flow [2025-03-08 22:00:51,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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 22:00:51,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:00:51,914 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 22:00:51,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:00:51,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:00:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:00:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -65858226, now seen corresponding path program 1 times [2025-03-08 22:00:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:00:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532732007] [2025-03-08 22:00:51,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:00:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:00:51,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:00:51,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:00:51,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:00:51,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:00:51,966 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 22:00:51,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:00:51,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532732007] [2025-03-08 22:00:51,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532732007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:00:51,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:00:51,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:00:51,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101807301] [2025-03-08 22:00:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:00:51,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:00:51,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:00:51,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:00:51,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:00:52,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2025-03-08 22:00:52,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 22:00:52,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:00:52,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2025-03-08 22:00:52,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:00:52,033 INFO L124 PetriNetUnfolderBase]: 1/158 cut-off events. [2025-03-08 22:00:52,034 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-08 22:00:52,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 158 events. 1/158 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 143 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 185. Up to 32 conditions per place. [2025-03-08 22:00:52,035 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 17 selfloop transitions, 2 changer transitions 7/99 dead transitions. [2025-03-08 22:00:52,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 99 transitions, 272 flow [2025-03-08 22:00:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:00:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:00:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-08 22:00:52,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8047619047619048 [2025-03-08 22:00:52,036 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 232 flow. Second operand 3 states and 338 transitions. [2025-03-08 22:00:52,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 99 transitions, 272 flow [2025-03-08 22:00:52,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 99 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:00:52,039 INFO L231 Difference]: Finished difference. Result has 105 places, 92 transitions, 213 flow [2025-03-08 22:00:52,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=105, PETRI_TRANSITIONS=92} [2025-03-08 22:00:52,040 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -25 predicate places. [2025-03-08 22:00:52,040 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 213 flow [2025-03-08 22:00:52,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 22:00:52,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:00:52,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:00:52,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:00:52,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:00:52,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:00:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash -89840243, now seen corresponding path program 1 times [2025-03-08 22:00:52,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:00:52,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023912119] [2025-03-08 22:00:52,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:00:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:00:52,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:00:52,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:00:52,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:00:52,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:00:52,093 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 22:00:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:00:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023912119] [2025-03-08 22:00:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023912119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:00:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:00:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:00:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677383996] [2025-03-08 22:00:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:00:52,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:00:52,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:00:52,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:00:52,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:00:52,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2025-03-08 22:00:52,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 22:00:52,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:00:52,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2025-03-08 22:00:52,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:00:52,143 INFO L124 PetriNetUnfolderBase]: 0/117 cut-off events. [2025-03-08 22:00:52,143 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-08 22:00:52,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 117 events. 0/117 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 58 event pairs, 0 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2025-03-08 22:00:52,143 INFO L140 encePairwiseOnDemand]: 138/140 looper letters, 0 selfloop transitions, 0 changer transitions 91/91 dead transitions. [2025-03-08 22:00:52,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 91 transitions, 243 flow [2025-03-08 22:00:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:00:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:00:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2025-03-08 22:00:52,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2025-03-08 22:00:52,146 INFO L175 Difference]: Start difference. First operand has 105 places, 92 transitions, 213 flow. Second operand 3 states and 340 transitions. [2025-03-08 22:00:52,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 91 transitions, 243 flow [2025-03-08 22:00:52,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 91 transitions, 237 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 22:00:52,148 INFO L231 Difference]: Finished difference. Result has 98 places, 0 transitions, 0 flow [2025-03-08 22:00:52,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=98, PETRI_TRANSITIONS=0} [2025-03-08 22:00:52,149 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -32 predicate places. [2025-03-08 22:00:52,149 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 0 transitions, 0 flow [2025-03-08 22:00:52,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 22:00:52,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-03-08 22:00:52,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-08 22:00:52,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-08 22:00:52,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-08 22:00:52,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-08 22:00:52,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-08 22:00:52,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-03-08 22:00:52,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-08 22:00:52,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-08 22:00:52,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-08 22:00:52,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-08 22:00:52,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-08 22:00:52,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-08 22:00:52,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-08 22:00:52,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-08 22:00:52,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:00:52,154 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 22:00:52,158 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:00:52,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:00:52,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:00:52 BasicIcfg [2025-03-08 22:00:52,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:00:52,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:00:52,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:00:52,166 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:00:52,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:00:50" (3/4) ... [2025-03-08 22:00:52,168 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:00:52,170 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-08 22:00:52,172 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-08 22:00:52,172 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:00:52,172 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 22:00:52,172 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:00:52,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:00:52,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:00:52,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:00:52,221 INFO L158 Benchmark]: Toolchain (without parser) took 2271.95ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 74.4MB in the end (delta: 52.9MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2025-03-08 22:00:52,221 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:00:52,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.93ms. Allocated memory is still 167.8MB. Free memory was 126.9MB in the beginning and 107.6MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:00:52,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.00ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:00:52,222 INFO L158 Benchmark]: Boogie Preprocessor took 27.08ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 105.0MB in the end (delta: 826.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:00:52,222 INFO L158 Benchmark]: IcfgBuilder took 316.33ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 89.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:00:52,222 INFO L158 Benchmark]: TraceAbstraction took 1543.81ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 79.7MB in the end (delta: 8.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2025-03-08 22:00:52,222 INFO L158 Benchmark]: Witness Printer took 54.71ms. Allocated memory is still 167.8MB. Free memory was 79.7MB in the beginning and 74.4MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:00:52,223 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.93ms. Allocated memory is still 167.8MB. Free memory was 126.9MB in the beginning and 107.6MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.00ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.08ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 105.0MB in the end (delta: 826.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 316.33ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 89.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1543.81ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 79.7MB in the end (delta: 8.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 54.71ms. Allocated memory is still 167.8MB. Free memory was 79.7MB in the beginning and 74.4MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 703]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 704]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 704]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 692]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 693]: 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, 184 locations, 195 edges, 15 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: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 36 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 22:00:52,235 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