./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_01-idx_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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_01-idx_rc.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 881804847426e60812f8175456032b889bbad15c60068b15698c7277211e0c6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:15:33,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:15:33,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:15:33,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:15:33,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:15:33,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:15:33,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:15:33,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:15:33,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:15:33,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:15:33,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:15:33,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:15:33,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:15:33,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:15:33,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:15:33,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:15:33,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:15:33,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:15:33,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:15:33,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:15:33,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:15:33,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:15:33,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:33,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:15:33,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:15:33,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:15:33,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:15:33,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:15:33,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:15:33,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:15:33,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:15:33,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:15:33,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:15:33,976 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 -> 881804847426e60812f8175456032b889bbad15c60068b15698c7277211e0c6e [2025-03-13 22:15:34,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:15:34,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:15:34,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:15:34,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:15:34,191 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:15:34,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_01-idx_rc.i [2025-03-13 22:15:35,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9880530/48d35b417f7a4461886e7ca195cba5e0/FLAGa231b958e [2025-03-13 22:15:35,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:15:35,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_01-idx_rc.i [2025-03-13 22:15:35,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9880530/48d35b417f7a4461886e7ca195cba5e0/FLAGa231b958e [2025-03-13 22:15:35,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9880530/48d35b417f7a4461886e7ca195cba5e0 [2025-03-13 22:15:35,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:15:35,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:15:35,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:35,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:15:35,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:15:35,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:35" (1/1) ... [2025-03-13 22:15:35,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaa85da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:35, skipping insertion in model container [2025-03-13 22:15:35,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:35" (1/1) ... [2025-03-13 22:15:35,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:15:36,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:36,144 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:15:36,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:36,225 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:15:36,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36 WrapperNode [2025-03-13 22:15:36,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:36,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:36,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:15:36,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:15:36,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,258 INFO L138 Inliner]: procedures = 162, calls = 58, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 88 [2025-03-13 22:15:36,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:36,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:15:36,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:15:36,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:15:36,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:15:36,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:15:36,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:15:36,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:15:36,280 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (1/1) ... [2025-03-13 22:15:36,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:36,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:36,307 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-13 22:15:36,310 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-13 22:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:15:36,326 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:15:36,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:15:36,328 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:15:36,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:15:36,406 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:15:36,611 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:15:36,611 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:15:36,612 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:15:36,636 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:15:36,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:36 BoogieIcfgContainer [2025-03-13 22:15:36,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:15:36,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:15:36,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:15:36,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:15:36,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:15:35" (1/3) ... [2025-03-13 22:15:36,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3dd61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:36, skipping insertion in model container [2025-03-13 22:15:36,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:36" (2/3) ... [2025-03-13 22:15:36,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3dd61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:36, skipping insertion in model container [2025-03-13 22:15:36,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:36" (3/3) ... [2025-03-13 22:15:36,643 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_01-idx_rc.i [2025-03-13 22:15:36,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:15:36,656 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_01-idx_rc.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-13 22:15:36,656 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:15:36,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:15:36,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 110 transitions, 224 flow [2025-03-13 22:15:36,778 INFO L124 PetriNetUnfolderBase]: 1/109 cut-off events. [2025-03-13 22:15:36,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:15:36,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-13 22:15:36,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 110 transitions, 224 flow [2025-03-13 22:15:36,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 109 transitions, 221 flow [2025-03-13 22:15:36,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:15:36,796 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;@6b995e50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:15:36,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 22:15:36,812 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:15:36,813 INFO L124 PetriNetUnfolderBase]: 1/79 cut-off events. [2025-03-13 22:15:36,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:15:36,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:36,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:36,814 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-13 22:15:36,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1450300205, now seen corresponding path program 1 times [2025-03-13 22:15:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:36,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823646507] [2025-03-13 22:15:36,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:36,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-13 22:15:36,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-13 22:15:36,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:36,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:37,063 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-13 22:15:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:37,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823646507] [2025-03-13 22:15:37,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823646507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:37,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:37,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:15:37,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863475472] [2025-03-13 22:15:37,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:37,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:37,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:37,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:15:37,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110 [2025-03-13 22:15:37,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-13 22:15:37,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:37,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110 [2025-03-13 22:15:37,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:37,182 INFO L124 PetriNetUnfolderBase]: 7/170 cut-off events. [2025-03-13 22:15:37,182 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 170 events. 7/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 257 event pairs, 6 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 113. Up to 24 conditions per place. [2025-03-13 22:15:37,184 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 10 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-03-13 22:15:37,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 110 transitions, 247 flow [2025-03-13 22:15:37,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2025-03-13 22:15:37,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-03-13 22:15:37,220 INFO L175 Difference]: Start difference. First operand has 112 places, 109 transitions, 221 flow. Second operand 3 states and 310 transitions. [2025-03-13 22:15:37,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 110 transitions, 247 flow [2025-03-13 22:15:37,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 110 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:37,226 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 232 flow [2025-03-13 22:15:37,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2025-03-13 22:15:37,230 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-03-13 22:15:37,231 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 232 flow [2025-03-13 22:15:37,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-13 22:15:37,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:37,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:37,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:15:37,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:37,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash -397719070, now seen corresponding path program 1 times [2025-03-13 22:15:37,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:37,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-03-13 22:15:37,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:37,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:37,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 22:15:37,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 22:15:37,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:37,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:37,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-03-13 22:15:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153447029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039062390] [2025-03-13 22:15:37,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:37,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:15:37,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:15:37,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 22:15:37,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 22:15:37,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:37,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:37,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 22:15:37,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:15:37,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:15:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039062390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:15:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 22:15:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374162339] [2025-03-13 22:15:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:37,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:37,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:37,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:37,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 110 [2025-03-13 22:15:37,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-13 22:15:37,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:37,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 110 [2025-03-13 22:15:37,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:37,592 INFO L124 PetriNetUnfolderBase]: 32/259 cut-off events. [2025-03-13 22:15:37,592 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:37,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 259 events. 32/259 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 888 event pairs, 13 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 280. Up to 44 conditions per place. [2025-03-13 22:15:37,594 INFO L140 encePairwiseOnDemand]: 102/110 looper letters, 17 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2025-03-13 22:15:37,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 120 transitions, 298 flow [2025-03-13 22:15:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2025-03-13 22:15:37,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575757575757575 [2025-03-13 22:15:37,598 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 232 flow. Second operand 3 states and 316 transitions. [2025-03-13 22:15:37,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 120 transitions, 298 flow [2025-03-13 22:15:37,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:37,600 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 282 flow [2025-03-13 22:15:37,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-03-13 22:15:37,604 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 5 predicate places. [2025-03-13 22:15:37,604 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 282 flow [2025-03-13 22:15:37,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-13 22:15:37,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:37,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:37,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:15:37,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:37,810 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-13 22:15:37,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:37,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1375564877, now seen corresponding path program 1 times [2025-03-13 22:15:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:37,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889697603] [2025-03-13 22:15:37,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:37,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:37,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-13 22:15:37,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-13 22:15:37,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:37,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:37,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:37,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889697603] [2025-03-13 22:15:37,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889697603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:37,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695069015] [2025-03-13 22:15:37,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:37,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:37,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:37,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:15:37,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:15:37,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-13 22:15:38,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-13 22:15:38,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:38,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:38,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 22:15:38,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:15:38,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:15:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695069015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:38,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:15:38,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 22:15:38,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18682223] [2025-03-13 22:15:38,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:38,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:38,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:38,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:38,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:38,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 110 [2025-03-13 22:15:38,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-13 22:15:38,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:38,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 110 [2025-03-13 22:15:38,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:38,135 INFO L124 PetriNetUnfolderBase]: 47/319 cut-off events. [2025-03-13 22:15:38,135 INFO L125 PetriNetUnfolderBase]: For 89/94 co-relation queries the response was YES. [2025-03-13 22:15:38,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 319 events. 47/319 cut-off events. For 89/94 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1324 event pairs, 21 based on Foata normal form. 3/304 useless extension candidates. Maximal degree in co-relation 451. Up to 86 conditions per place. [2025-03-13 22:15:38,139 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 16 selfloop transitions, 7 changer transitions 1/123 dead transitions. [2025-03-13 22:15:38,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 123 transitions, 354 flow [2025-03-13 22:15:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2025-03-13 22:15:38,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424242424242424 [2025-03-13 22:15:38,142 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 282 flow. Second operand 3 states and 311 transitions. [2025-03-13 22:15:38,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 123 transitions, 354 flow [2025-03-13 22:15:38,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 123 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:15:38,144 INFO L231 Difference]: Finished difference. Result has 119 places, 121 transitions, 326 flow [2025-03-13 22:15:38,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=119, PETRI_TRANSITIONS=121} [2025-03-13 22:15:38,146 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 7 predicate places. [2025-03-13 22:15:38,146 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 121 transitions, 326 flow [2025-03-13 22:15:38,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-13 22:15:38,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:38,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:38,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 22:15:38,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-13 22:15:38,351 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-13 22:15:38,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 240725878, now seen corresponding path program 1 times [2025-03-13 22:15:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:38,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-03-13 22:15:38,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:38,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-13 22:15:38,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-13 22:15:38,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:38,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:38,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-03-13 22:15:38,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237134654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:38,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844143637] [2025-03-13 22:15:38,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:38,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:38,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:38,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:15:38,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 22:15:38,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-13 22:15:38,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-13 22:15:38,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:38,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:38,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 22:15:38,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:15:38,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:15:38,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844143637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:38,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:15:38,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 22:15:38,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974949184] [2025-03-13 22:15:38,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:38,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:38,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:38,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:38,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 110 [2025-03-13 22:15:38,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 121 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-13 22:15:38,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:38,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 110 [2025-03-13 22:15:38,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:38,626 INFO L124 PetriNetUnfolderBase]: 66/386 cut-off events. [2025-03-13 22:15:38,626 INFO L125 PetriNetUnfolderBase]: For 214/222 co-relation queries the response was YES. [2025-03-13 22:15:38,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 386 events. 66/386 cut-off events. For 214/222 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1758 event pairs, 25 based on Foata normal form. 2/371 useless extension candidates. Maximal degree in co-relation 650. Up to 115 conditions per place. [2025-03-13 22:15:38,628 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 17 selfloop transitions, 7 changer transitions 7/128 dead transitions. [2025-03-13 22:15:38,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 128 transitions, 412 flow [2025-03-13 22:15:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-13 22:15:38,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9303030303030303 [2025-03-13 22:15:38,630 INFO L175 Difference]: Start difference. First operand has 119 places, 121 transitions, 326 flow. Second operand 3 states and 307 transitions. [2025-03-13 22:15:38,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 128 transitions, 412 flow [2025-03-13 22:15:38,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 128 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:15:38,635 INFO L231 Difference]: Finished difference. Result has 121 places, 120 transitions, 344 flow [2025-03-13 22:15:38,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=121, PETRI_TRANSITIONS=120} [2025-03-13 22:15:38,636 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 9 predicate places. [2025-03-13 22:15:38,636 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 120 transitions, 344 flow [2025-03-13 22:15:38,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-13 22:15:38,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:38,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:38,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 22:15:38,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:38,837 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-13 22:15:38,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash -526456405, now seen corresponding path program 1 times [2025-03-13 22:15:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:38,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468238690] [2025-03-13 22:15:38,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:38,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-13 22:15:38,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-13 22:15:38,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:38,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468238690] [2025-03-13 22:15:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468238690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702973537] [2025-03-13 22:15:38,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:38,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:38,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:38,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:15:38,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 22:15:38,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-13 22:15:38,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-13 22:15:38,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:38,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:38,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:15:38,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:39,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702973537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:39,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:39,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:15:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880506046] [2025-03-13 22:15:39,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:39,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:15:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:39,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:15:39,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:15:39,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2025-03-13 22:15:39,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 120 transitions, 344 flow. Second operand has 10 states, 10 states have (on average 98.1) internal successors, (981), 10 states have internal predecessors, (981), 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-13 22:15:39,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:39,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2025-03-13 22:15:39,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:39,190 INFO L124 PetriNetUnfolderBase]: 25/318 cut-off events. [2025-03-13 22:15:39,190 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-03-13 22:15:39,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 318 events. 25/318 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1301 event pairs, 10 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 461. Up to 37 conditions per place. [2025-03-13 22:15:39,191 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 14 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2025-03-13 22:15:39,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 128 transitions, 408 flow [2025-03-13 22:15:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions. [2025-03-13 22:15:39,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.897979797979798 [2025-03-13 22:15:39,193 INFO L175 Difference]: Start difference. First operand has 121 places, 120 transitions, 344 flow. Second operand 9 states and 889 transitions. [2025-03-13 22:15:39,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 128 transitions, 408 flow [2025-03-13 22:15:39,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 128 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:15:39,198 INFO L231 Difference]: Finished difference. Result has 130 places, 126 transitions, 380 flow [2025-03-13 22:15:39,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=130, PETRI_TRANSITIONS=126} [2025-03-13 22:15:39,200 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 18 predicate places. [2025-03-13 22:15:39,200 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 126 transitions, 380 flow [2025-03-13 22:15:39,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.1) internal successors, (981), 10 states have internal predecessors, (981), 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-13 22:15:39,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:39,201 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:39,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 22:15:39,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:39,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:39,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2084017247, now seen corresponding path program 2 times [2025-03-13 22:15:39,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:39,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-13 22:15:39,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:39,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 22:15:39,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:15:39,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:15:39,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:39,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-13 22:15:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445899137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592253610] [2025-03-13 22:15:39,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:39,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:39,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:39,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:15:39,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 22:15:39,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-13 22:15:39,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:15:39,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:15:39,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:39,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:15:39,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:39,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592253610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:39,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:15:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351345417] [2025-03-13 22:15:39,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:39,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:15:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:39,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:15:39,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:15:39,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2025-03-13 22:15:39,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 126 transitions, 380 flow. Second operand has 18 states, 18 states have (on average 98.05555555555556) internal successors, (1765), 18 states have internal predecessors, (1765), 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-13 22:15:39,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:39,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2025-03-13 22:15:39,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:39,979 INFO L124 PetriNetUnfolderBase]: 25/338 cut-off events. [2025-03-13 22:15:39,980 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-13 22:15:39,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 338 events. 25/338 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1298 event pairs, 10 based on Foata normal form. 4/331 useless extension candidates. Maximal degree in co-relation 442. Up to 37 conditions per place. [2025-03-13 22:15:39,981 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 18 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2025-03-13 22:15:39,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 554 flow [2025-03-13 22:15:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:15:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:15:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2059 transitions. [2025-03-13 22:15:39,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913419913419913 [2025-03-13 22:15:39,984 INFO L175 Difference]: Start difference. First operand has 130 places, 126 transitions, 380 flow. Second operand 21 states and 2059 transitions. [2025-03-13 22:15:39,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 554 flow [2025-03-13 22:15:39,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 540 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:39,987 INFO L231 Difference]: Finished difference. Result has 154 places, 139 transitions, 504 flow [2025-03-13 22:15:39,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=504, PETRI_PLACES=154, PETRI_TRANSITIONS=139} [2025-03-13 22:15:39,988 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 42 predicate places. [2025-03-13 22:15:39,988 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 139 transitions, 504 flow [2025-03-13 22:15:39,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 98.05555555555556) internal successors, (1765), 18 states have internal predecessors, (1765), 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-13 22:15:39,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:39,989 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:39,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 22:15:40,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:40,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:40,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1618166901, now seen corresponding path program 3 times [2025-03-13 22:15:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004065338] [2025-03-13 22:15:40,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:15:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:40,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 8 equivalence classes. [2025-03-13 22:15:40,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:15:40,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 22:15:40,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004065338] [2025-03-13 22:15:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004065338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24393491] [2025-03-13 22:15:40,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:15:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:40,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:15:40,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 22:15:40,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 8 equivalence classes. [2025-03-13 22:15:40,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:15:40,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 22:15:40,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:40,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 22:15:40,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:40,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24393491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:40,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:40,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:15:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451583631] [2025-03-13 22:15:40,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:40,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:15:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:40,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:15:40,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:15:40,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2025-03-13 22:15:40,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 139 transitions, 504 flow. Second operand has 23 states, 23 states have (on average 98.1304347826087) internal successors, (2257), 23 states have internal predecessors, (2257), 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-13 22:15:40,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:40,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2025-03-13 22:15:40,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:41,210 INFO L124 PetriNetUnfolderBase]: 25/353 cut-off events. [2025-03-13 22:15:41,210 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-03-13 22:15:41,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 353 events. 25/353 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1298 event pairs, 10 based on Foata normal form. 3/345 useless extension candidates. Maximal degree in co-relation 446. Up to 37 conditions per place. [2025-03-13 22:15:41,211 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 21 selfloop transitions, 30 changer transitions 0/156 dead transitions. [2025-03-13 22:15:41,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 156 transitions, 734 flow [2025-03-13 22:15:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:15:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:15:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2934 transitions. [2025-03-13 22:15:41,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889090909090909 [2025-03-13 22:15:41,215 INFO L175 Difference]: Start difference. First operand has 154 places, 139 transitions, 504 flow. Second operand 30 states and 2934 transitions. [2025-03-13 22:15:41,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 156 transitions, 734 flow [2025-03-13 22:15:41,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 156 transitions, 704 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-13 22:15:41,219 INFO L231 Difference]: Finished difference. Result has 181 places, 149 transitions, 632 flow [2025-03-13 22:15:41,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=632, PETRI_PLACES=181, PETRI_TRANSITIONS=149} [2025-03-13 22:15:41,219 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 69 predicate places. [2025-03-13 22:15:41,220 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 149 transitions, 632 flow [2025-03-13 22:15:41,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 98.1304347826087) internal successors, (2257), 23 states have internal predecessors, (2257), 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-13 22:15:41,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:41,221 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:41,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 22:15:41,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:41,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:41,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -714045418, now seen corresponding path program 4 times [2025-03-13 22:15:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948104780] [2025-03-13 22:15:41,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:15:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:41,433 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 130 statements into 2 equivalence classes. [2025-03-13 22:15:41,448 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-13 22:15:41,448 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:15:41,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:15:41,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:15:41,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-13 22:15:41,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-13 22:15:41,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:41,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:15:41,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:15:41,480 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:15:41,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-13 22:15:41,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-13 22:15:41,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-13 22:15:41,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-13 22:15:41,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-13 22:15:41,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-13 22:15:41,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-13 22:15:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:15:41,483 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-03-13 22:15:41,522 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:15:41,522 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:15:41,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:15:41 BasicIcfg [2025-03-13 22:15:41,526 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:15:41,526 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:15:41,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:15:41,526 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:15:41,527 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:36" (3/4) ... [2025-03-13 22:15:41,527 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 22:15:41,560 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-13 22:15:41,602 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:15:41,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:15:41,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:15:41,604 INFO L158 Benchmark]: Toolchain (without parser) took 5767.49ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 65.0MB in the end (delta: 57.0MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2025-03-13 22:15:41,604 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:41,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.69ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 101.0MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:15:41,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.12ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 99.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:15:41,605 INFO L158 Benchmark]: Boogie Preprocessor took 17.76ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 98.0MB in the end (delta: 913.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:41,605 INFO L158 Benchmark]: IcfgBuilder took 357.32ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 80.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:15:41,605 INFO L158 Benchmark]: TraceAbstraction took 4887.99ms. Allocated memory is still 167.8MB. Free memory was 80.4MB in the beginning and 75.1MB in the end (delta: 5.4MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2025-03-13 22:15:41,606 INFO L158 Benchmark]: Witness Printer took 77.68ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 65.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:15:41,606 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.18ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.69ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 101.0MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.12ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 99.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.76ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 98.0MB in the end (delta: 913.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.32ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 80.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4887.99ms. Allocated memory is still 167.8MB. Free memory was 80.4MB in the beginning and 75.1MB in the end (delta: 5.4MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 77.68ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 65.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int data; VAL [data=0] [L680] 0 pthread_mutex_t m[10]; VAL [data=0, m={1:0}] [L688] 0 int i = 0; VAL [data=0, i=0, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=1, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=2, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=3, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=4, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=5, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=6, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=7, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=8, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=9, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=10, m={1:0}] [L688] COND FALSE 0 !(i < 10) VAL [data=0, m={1:0}] [L690] 0 pthread_t id; VAL [data=0, m={1:0}] [L691] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data=0, id=-1, m={1:0}] [L683] 1 data++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, m={1:0}] [L693] 0 data++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, id=-1, m={1:0}] [L683] 1 data++ VAL [\old(arg)={0:0}, arg={0:0}, data=1, m={1:0}] [L693] 0 data++ VAL [\old(arg)={0:0}, arg={0:0}, data=1, id=-1, m={1:0}] Now there is a data race on ~data~0 between C: data++ [683] and C: data++ [693] - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: 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: 683]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 683]: 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, 130 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: 4.8s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 23 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 797 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=7, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1262 NumberOfCodeBlocks, 1262 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1803 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1134 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 3/399 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-13 22:15:41,618 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)