./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_14-idxunknown_access.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/05-lval_ls_14-idxunknown_access.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 ab624cd95d0fa2367e02c67b22b0f1efd275cc176f54b50b7fb2d138f7f4319c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:45:20,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:45:20,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:45:20,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:45:20,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:45:20,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:45:20,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:45:20,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:45:20,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:45:20,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:45:20,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:45:20,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:45:20,380 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:45:20,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:45:20,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:45:20,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:45:20,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:45:20,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:45:20,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:45:20,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:45:20,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:45:20,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:45:20,381 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:45:20,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:45:20,383 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:20,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:45:20,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:45:20,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:45:20,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:45:20,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:45:20,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:45:20,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:45:20,384 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 -> ab624cd95d0fa2367e02c67b22b0f1efd275cc176f54b50b7fb2d138f7f4319c [2025-03-04 06:45:20,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:45:20,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:45:20,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:45:20,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:45:20,637 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:45:20,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_14-idxunknown_access.i [2025-03-04 06:45:21,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d468f1588/cd08e67f1d2c4e41b9e1e76d6fda2970/FLAG165c82e9e [2025-03-04 06:45:22,046 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:45:22,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_14-idxunknown_access.i [2025-03-04 06:45:22,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d468f1588/cd08e67f1d2c4e41b9e1e76d6fda2970/FLAG165c82e9e [2025-03-04 06:45:22,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d468f1588/cd08e67f1d2c4e41b9e1e76d6fda2970 [2025-03-04 06:45:22,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:45:22,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:45:22,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:22,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:45:22,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:45:22,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad69ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22, skipping insertion in model container [2025-03-04 06:45:22,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:45:22,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:22,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:45:22,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:22,344 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:45:22,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22 WrapperNode [2025-03-04 06:45:22,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:22,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:22,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:45:22,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:45:22,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,388 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 50 [2025-03-04 06:45:22,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:22,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:45:22,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:45:22,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:45:22,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:45:22,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:45:22,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:45:22,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:45:22,416 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:22,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:22,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:45:22,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:45:22,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:45:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:45:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:45:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:45:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:45:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:45:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:45:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:45:22,476 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:45:22,577 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:45:22,580 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:45:22,772 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:45:22,773 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:45:22,780 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:45:22,780 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:45:22,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:22 BoogieIcfgContainer [2025-03-04 06:45:22,780 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:45:22,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:45:22,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:45:22,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:45:22,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:45:22" (1/3) ... [2025-03-04 06:45:22,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7e3ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:22, skipping insertion in model container [2025-03-04 06:45:22,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (2/3) ... [2025-03-04 06:45:22,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7e3ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:22, skipping insertion in model container [2025-03-04 06:45:22,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:22" (3/3) ... [2025-03-04 06:45:22,787 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_14-idxunknown_access.i [2025-03-04 06:45:22,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:45:22,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_14-idxunknown_access.i that has 2 procedures, 81 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 06:45:22,798 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:45:22,835 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:45:22,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 81 transitions, 166 flow [2025-03-04 06:45:22,911 INFO L124 PetriNetUnfolderBase]: 1/80 cut-off events. [2025-03-04 06:45:22,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:22,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 80 events. 1/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-03-04 06:45:22,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 81 transitions, 166 flow [2025-03-04 06:45:22,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 80 transitions, 163 flow [2025-03-04 06:45:22,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:45:22,941 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;@171e2b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:45:22,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 06:45:22,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:45:22,959 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-03-04 06:45:22,959 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:22,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:22,960 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] [2025-03-04 06:45:22,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:22,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1347492613, now seen corresponding path program 1 times [2025-03-04 06:45:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:22,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300570509] [2025-03-04 06:45:22,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:23,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 06:45:23,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 06:45:23,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:23,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300570509] [2025-03-04 06:45:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300570509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:23,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:23,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580752475] [2025-03-04 06:45:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:23,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:23,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:23,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:23,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 81 [2025-03-04 06:45:23,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 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-04 06:45:23,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:23,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 81 [2025-03-04 06:45:23,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:24,055 INFO L124 PetriNetUnfolderBase]: 72/437 cut-off events. [2025-03-04 06:45:24,056 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:24,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 437 events. 72/437 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2549 event pairs, 26 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 581. Up to 101 conditions per place. [2025-03-04 06:45:24,060 INFO L140 encePairwiseOnDemand]: 69/81 looper letters, 28 selfloop transitions, 22 changer transitions 1/112 dead transitions. [2025-03-04 06:45:24,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 112 transitions, 327 flow [2025-03-04 06:45:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 430 transitions. [2025-03-04 06:45:24,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8847736625514403 [2025-03-04 06:45:24,075 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 163 flow. Second operand 6 states and 430 transitions. [2025-03-04 06:45:24,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 112 transitions, 327 flow [2025-03-04 06:45:24,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:24,082 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 304 flow [2025-03-04 06:45:24,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2025-03-04 06:45:24,086 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 8 predicate places. [2025-03-04 06:45:24,087 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 304 flow [2025-03-04 06:45:24,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 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-04 06:45:24,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:24,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:45:24,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:24,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1503391921, now seen corresponding path program 1 times [2025-03-04 06:45:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906484296] [2025-03-04 06:45:24,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:24,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:45:24,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:45:24,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:24,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:24,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906484296] [2025-03-04 06:45:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906484296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:24,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435355853] [2025-03-04 06:45:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:24,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:24,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:24,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:24,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-04 06:45:24,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:24,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:24,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-04 06:45:24,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:24,672 INFO L124 PetriNetUnfolderBase]: 118/628 cut-off events. [2025-03-04 06:45:24,672 INFO L125 PetriNetUnfolderBase]: For 99/109 co-relation queries the response was YES. [2025-03-04 06:45:24,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 628 events. 118/628 cut-off events. For 99/109 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4332 event pairs, 29 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 1099. Up to 204 conditions per place. [2025-03-04 06:45:24,677 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 42 selfloop transitions, 26 changer transitions 0/133 dead transitions. [2025-03-04 06:45:24,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 526 flow [2025-03-04 06:45:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2025-03-04 06:45:24,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2025-03-04 06:45:24,680 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 304 flow. Second operand 6 states and 414 transitions. [2025-03-04 06:45:24,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 526 flow [2025-03-04 06:45:24,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 133 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:24,690 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 482 flow [2025-03-04 06:45:24,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2025-03-04 06:45:24,691 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 16 predicate places. [2025-03-04 06:45:24,691 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 482 flow [2025-03-04 06:45:24,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:24,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:24,692 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-04 06:45:24,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:45:24,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:24,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -633891959, now seen corresponding path program 1 times [2025-03-04 06:45:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:24,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900219334] [2025-03-04 06:45:24,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:24,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:45:24,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:45:24,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:24,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:24,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:24,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900219334] [2025-03-04 06:45:24,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900219334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:24,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:24,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937661147] [2025-03-04 06:45:24,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:24,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:24,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:24,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:24,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:25,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 81 [2025-03-04 06:45:25,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 59.166666666666664) internal successors, (355), 6 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:25,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:25,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 81 [2025-03-04 06:45:25,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:25,325 INFO L124 PetriNetUnfolderBase]: 294/1253 cut-off events. [2025-03-04 06:45:25,325 INFO L125 PetriNetUnfolderBase]: For 649/682 co-relation queries the response was YES. [2025-03-04 06:45:25,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 1253 events. 294/1253 cut-off events. For 649/682 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9610 event pairs, 65 based on Foata normal form. 10/1174 useless extension candidates. Maximal degree in co-relation 2748. Up to 426 conditions per place. [2025-03-04 06:45:25,334 INFO L140 encePairwiseOnDemand]: 66/81 looper letters, 78 selfloop transitions, 59 changer transitions 0/196 dead transitions. [2025-03-04 06:45:25,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 196 transitions, 1117 flow [2025-03-04 06:45:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2025-03-04 06:45:25,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539094650205762 [2025-03-04 06:45:25,336 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 482 flow. Second operand 6 states and 415 transitions. [2025-03-04 06:45:25,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 196 transitions, 1117 flow [2025-03-04 06:45:25,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 196 transitions, 1117 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:25,343 INFO L231 Difference]: Finished difference. Result has 108 places, 174 transitions, 1000 flow [2025-03-04 06:45:25,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1000, PETRI_PLACES=108, PETRI_TRANSITIONS=174} [2025-03-04 06:45:25,348 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 25 predicate places. [2025-03-04 06:45:25,348 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 174 transitions, 1000 flow [2025-03-04 06:45:25,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.166666666666664) internal successors, (355), 6 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:25,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:25,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:45:25,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:25,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1904357076, now seen corresponding path program 1 times [2025-03-04 06:45:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379067377] [2025-03-04 06:45:25,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:25,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:45:25,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:45:25,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:25,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:25,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:25,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379067377] [2025-03-04 06:45:25,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379067377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:25,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:25,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599219283] [2025-03-04 06:45:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:25,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:25,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:25,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:25,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 81 [2025-03-04 06:45:25,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 174 transitions, 1000 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:25,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:25,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 81 [2025-03-04 06:45:25,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:25,985 INFO L124 PetriNetUnfolderBase]: 482/1728 cut-off events. [2025-03-04 06:45:25,985 INFO L125 PetriNetUnfolderBase]: For 2258/2304 co-relation queries the response was YES. [2025-03-04 06:45:25,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4968 conditions, 1728 events. 482/1728 cut-off events. For 2258/2304 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13917 event pairs, 89 based on Foata normal form. 14/1672 useless extension candidates. Maximal degree in co-relation 4914. Up to 681 conditions per place. [2025-03-04 06:45:25,999 INFO L140 encePairwiseOnDemand]: 66/81 looper letters, 109 selfloop transitions, 76 changer transitions 12/260 dead transitions. [2025-03-04 06:45:25,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 260 transitions, 1922 flow [2025-03-04 06:45:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 400 transitions. [2025-03-04 06:45:26,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.823045267489712 [2025-03-04 06:45:26,001 INFO L175 Difference]: Start difference. First operand has 108 places, 174 transitions, 1000 flow. Second operand 6 states and 400 transitions. [2025-03-04 06:45:26,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 260 transitions, 1922 flow [2025-03-04 06:45:26,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 260 transitions, 1854 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:26,017 INFO L231 Difference]: Finished difference. Result has 117 places, 223 transitions, 1558 flow [2025-03-04 06:45:26,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=117, PETRI_TRANSITIONS=223} [2025-03-04 06:45:26,019 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 34 predicate places. [2025-03-04 06:45:26,020 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 223 transitions, 1558 flow [2025-03-04 06:45:26,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:26,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:26,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:26,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:45:26,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:26,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2025331573, now seen corresponding path program 1 times [2025-03-04 06:45:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:26,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780869693] [2025-03-04 06:45:26,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:26,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:45:26,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:45:26,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:26,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:45:26,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:45:26,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:45:26,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:45:26,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:26,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:45:26,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:45:26,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:45:26,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-04 06:45:26,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-04 06:45:26,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 06:45:26,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-04 06:45:26,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-04 06:45:26,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-04 06:45:26,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-04 06:45:26,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:45:26,083 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 06:45:26,119 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:45:26,119 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:45:26,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:45:26 BasicIcfg [2025-03-04 06:45:26,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:45:26,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:45:26,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:45:26,125 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:45:26,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:22" (3/4) ... [2025-03-04 06:45:26,126 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 06:45:26,164 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-03-04 06:45:26,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:45:26,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:45:26,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:45:26,194 INFO L158 Benchmark]: Toolchain (without parser) took 4123.02ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.5MB in the beginning and 144.1MB in the end (delta: -37.6MB). Peak memory consumption was 119.6MB. Max. memory is 16.1GB. [2025-03-04 06:45:26,194 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:26,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.73ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 87.4MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:45:26,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.15ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:26,196 INFO L158 Benchmark]: Boogie Preprocessor took 24.74ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 84.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:26,196 INFO L158 Benchmark]: IcfgBuilder took 365.41ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 69.7MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:26,196 INFO L158 Benchmark]: TraceAbstraction took 3341.88ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 69.7MB in the beginning and 152.5MB in the end (delta: -82.8MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2025-03-04 06:45:26,196 INFO L158 Benchmark]: Witness Printer took 68.51ms. Allocated memory is still 302.0MB. Free memory was 152.5MB in the beginning and 144.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:26,197 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.73ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 87.4MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.15ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.74ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 84.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 365.41ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 69.7MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3341.88ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 69.7MB in the beginning and 152.5MB in the end (delta: -82.8MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Witness Printer took 68.51ms. Allocated memory is still 302.0MB. Free memory was 152.5MB in the beginning and 144.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L684] 0 int data[10]; VAL [data={1:0}] [L690] 0 int i = __VERIFIER_nondet_int(); VAL [data={1:0}, i=4] [L691] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data={1:0}] [L691] RET 0 assume_abort_if_not(0 <= i && i < 10) [L692] 0 pthread_t id; VAL [data={1:0}, i=4] [L693] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data={1:0}, i=4, id=-1] [L694] EXPR 0 data[i] VAL [\old(arg)={0:0}, data={1:0}, i=4, id=-1] [L694] 0 data[i]++ VAL [\old(arg)={0:0}, data={1:0}, i=4, id=-1] [L686] EXPR 1 data[4] VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L686] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L694] 0 data[i]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=4, id=-1] [L686] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L694] 0 data[i]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=4, id=-1] [L686] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L694] 0 data[i]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=4, id=-1] [L686] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}] [L694] 0 data[i]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=4, id=-1] Now there is a data race (on the heap) between C: data[4]++ [686] and C: data[i]++ [694] - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 105 locations, 7 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: 3.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 999 IncrementalHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 5 mSDtfsCounter, 999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 1.3s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-04 06:45:26,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)