./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_13-idxunknown_lock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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_13-idxunknown_lock.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 88789d38e839cdb13726f2ad9aa669b066ca22f31157bd019778c09c91261c6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:04:18,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:04:18,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:04:18,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:04:18,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:04:18,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:04:18,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:04:18,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:04:18,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:04:18,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:04:18,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:04:18,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:04:18,531 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:04:18,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:04:18,532 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:04:18,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:18,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:04:18,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:04:18,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:04:18,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:04:18,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:04:18,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:04:18,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:04:18,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:04:18,534 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 -> 88789d38e839cdb13726f2ad9aa669b066ca22f31157bd019778c09c91261c6f [2025-03-17 11:04:18,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:04:18,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:04:18,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:04:18,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:04:18,774 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:04:18,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_13-idxunknown_lock.i [2025-03-17 11:04:19,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cb1546a/ea9171b7d84b4df28531c7093d4dfeca/FLAG7d69efdd4 [2025-03-17 11:04:20,170 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:04:20,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_13-idxunknown_lock.i [2025-03-17 11:04:20,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cb1546a/ea9171b7d84b4df28531c7093d4dfeca/FLAG7d69efdd4 [2025-03-17 11:04:20,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cb1546a/ea9171b7d84b4df28531c7093d4dfeca [2025-03-17 11:04:20,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:04:20,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:04:20,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:04:20,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:04:20,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:04:20,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b07572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20, skipping insertion in model container [2025-03-17 11:04:20,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:04:20,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:04:20,708 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:04:20,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:04:20,779 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:04:20,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20 WrapperNode [2025-03-17 11:04:20,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:04:20,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:04:20,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:04:20,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:04:20,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,808 INFO L138 Inliner]: procedures = 165, calls = 74, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2025-03-17 11:04:20,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:04:20,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:04:20,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:04:20,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:04:20,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:04:20,837 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:04:20,837 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:04:20,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:04:20,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (1/1) ... [2025-03-17 11:04:20,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:20,866 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-17 11:04:20,868 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-17 11:04:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:04:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:04:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:04:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:04:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:04:20,884 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:04:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:04:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:04:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:04:20,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:04:20,885 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:04:20,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:04:20,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:04:21,248 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:04:21,248 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:04:21,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:04:21,274 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:04:21,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:21 BoogieIcfgContainer [2025-03-17 11:04:21,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:04:21,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:04:21,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:04:21,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:04:21,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:04:20" (1/3) ... [2025-03-17 11:04:21,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257e533b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:04:21, skipping insertion in model container [2025-03-17 11:04:21,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:20" (2/3) ... [2025-03-17 11:04:21,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257e533b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:04:21, skipping insertion in model container [2025-03-17 11:04:21,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:21" (3/3) ... [2025-03-17 11:04:21,282 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_13-idxunknown_lock.i [2025-03-17 11:04:21,293 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:04:21,295 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_13-idxunknown_lock.i that has 2 procedures, 148 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-17 11:04:21,295 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:04:21,356 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:04:21,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 149 transitions, 302 flow [2025-03-17 11:04:21,453 INFO L124 PetriNetUnfolderBase]: 2/148 cut-off events. [2025-03-17 11:04:21,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:21,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2025-03-17 11:04:21,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 149 transitions, 302 flow [2025-03-17 11:04:21,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 148 transitions, 299 flow [2025-03-17 11:04:21,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:04:21,477 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;@774b2581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:04:21,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:04:21,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:04:21,510 INFO L124 PetriNetUnfolderBase]: 2/111 cut-off events. [2025-03-17 11:04:21,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:21,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:21,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:21,513 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-17 11:04:21,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1906349497, now seen corresponding path program 1 times [2025-03-17 11:04:21,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:21,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605936155] [2025-03-17 11:04:21,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:21,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:04:21,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:04:21,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:21,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:21,861 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-17 11:04:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:21,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605936155] [2025-03-17 11:04:21,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605936155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:21,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:21,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:04:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108327596] [2025-03-17 11:04:21,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:21,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:04:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:21,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:04:21,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:04:21,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 149 [2025-03-17 11:04:21,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 148 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-17 11:04:21,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:21,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 149 [2025-03-17 11:04:21,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:21,975 INFO L124 PetriNetUnfolderBase]: 7/232 cut-off events. [2025-03-17 11:04:21,975 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:21,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 232 events. 7/232 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 337 event pairs, 6 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 153. Up to 24 conditions per place. [2025-03-17 11:04:21,978 INFO L140 encePairwiseOnDemand]: 145/149 looper letters, 10 selfloop transitions, 2 changer transitions 1/148 dead transitions. [2025-03-17 11:04:21,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 148 transitions, 323 flow [2025-03-17 11:04:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:04:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:04:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2025-03-17 11:04:21,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9507829977628636 [2025-03-17 11:04:21,991 INFO L175 Difference]: Start difference. First operand has 150 places, 148 transitions, 299 flow. Second operand 3 states and 425 transitions. [2025-03-17 11:04:21,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 148 transitions, 323 flow [2025-03-17 11:04:21,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 148 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:21,997 INFO L231 Difference]: Finished difference. Result has 152 places, 147 transitions, 306 flow [2025-03-17 11:04:21,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=152, PETRI_TRANSITIONS=147} [2025-03-17 11:04:22,004 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 2 predicate places. [2025-03-17 11:04:22,004 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 147 transitions, 306 flow [2025-03-17 11:04:22,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-17 11:04:22,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:22,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:22,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:04:22,006 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-17 11:04:22,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash -781754042, now seen corresponding path program 1 times [2025-03-17 11:04:22,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:22,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275307205] [2025-03-17 11:04:22,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:22,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:22,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 11:04:22,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 11:04:22,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:22,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:22,202 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-17 11:04:22,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275307205] [2025-03-17 11:04:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275307205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120472552] [2025-03-17 11:04:22,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:22,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:22,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:22,206 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-17 11:04:22,207 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-17 11:04:22,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 11:04:22,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 11:04:22,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:22,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:22,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:04:22,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:22,369 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-17 11:04:22,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:22,415 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-17 11:04:22,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120472552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:22,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:22,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:04:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064476788] [2025-03-17 11:04:22,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:22,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:04:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:22,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:04:22,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:04:22,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 149 [2025-03-17 11:04:22,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 147 transitions, 306 flow. Second operand has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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-17 11:04:22,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:22,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 149 [2025-03-17 11:04:22,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:22,561 INFO L124 PetriNetUnfolderBase]: 7/238 cut-off events. [2025-03-17 11:04:22,562 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:22,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 238 events. 7/238 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 330 event pairs, 6 based on Foata normal form. 2/227 useless extension candidates. Maximal degree in co-relation 200. Up to 24 conditions per place. [2025-03-17 11:04:22,563 INFO L140 encePairwiseOnDemand]: 143/149 looper letters, 14 selfloop transitions, 9 changer transitions 0/155 dead transitions. [2025-03-17 11:04:22,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 155 transitions, 370 flow [2025-03-17 11:04:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:04:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:04:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1231 transitions. [2025-03-17 11:04:22,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9179716629381058 [2025-03-17 11:04:22,566 INFO L175 Difference]: Start difference. First operand has 152 places, 147 transitions, 306 flow. Second operand 9 states and 1231 transitions. [2025-03-17 11:04:22,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 155 transitions, 370 flow [2025-03-17 11:04:22,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 155 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:22,569 INFO L231 Difference]: Finished difference. Result has 161 places, 153 transitions, 354 flow [2025-03-17 11:04:22,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=354, PETRI_PLACES=161, PETRI_TRANSITIONS=153} [2025-03-17 11:04:22,570 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 11 predicate places. [2025-03-17 11:04:22,570 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 153 transitions, 354 flow [2025-03-17 11:04:22,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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-17 11:04:22,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:22,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:22,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:04:22,772 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-17 11:04:22,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:22,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:22,773 INFO L85 PathProgramCache]: Analyzing trace with hash -239188698, now seen corresponding path program 2 times [2025-03-17 11:04:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838485091] [2025-03-17 11:04:22,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:22,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-03-17 11:04:22,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 95 of 110 statements. [2025-03-17 11:04:22,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:22,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:04:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:23,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838485091] [2025-03-17 11:04:23,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838485091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:23,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:23,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:23,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350260470] [2025-03-17 11:04:23,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:23,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:23,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:23,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:23,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 149 [2025-03-17 11:04:23,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 153 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 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-17 11:04:23,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:23,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 149 [2025-03-17 11:04:23,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:23,635 INFO L124 PetriNetUnfolderBase]: 261/1013 cut-off events. [2025-03-17 11:04:23,635 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:04:23,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 1013 events. 261/1013 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5978 event pairs, 67 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1502. Up to 257 conditions per place. [2025-03-17 11:04:23,641 INFO L140 encePairwiseOnDemand]: 127/149 looper letters, 88 selfloop transitions, 42 changer transitions 0/255 dead transitions. [2025-03-17 11:04:23,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 255 transitions, 818 flow [2025-03-17 11:04:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2025-03-17 11:04:23,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530201342281879 [2025-03-17 11:04:23,643 INFO L175 Difference]: Start difference. First operand has 161 places, 153 transitions, 354 flow. Second operand 6 states and 852 transitions. [2025-03-17 11:04:23,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 255 transitions, 818 flow [2025-03-17 11:04:23,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 255 transitions, 812 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:23,648 INFO L231 Difference]: Finished difference. Result has 170 places, 199 transitions, 664 flow [2025-03-17 11:04:23,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=664, PETRI_PLACES=170, PETRI_TRANSITIONS=199} [2025-03-17 11:04:23,649 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 20 predicate places. [2025-03-17 11:04:23,649 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 199 transitions, 664 flow [2025-03-17 11:04:23,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 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-17 11:04:23,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:23,650 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, 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-17 11:04:23,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:04:23,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:23,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash -693917398, now seen corresponding path program 1 times [2025-03-17 11:04:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:23,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393761341] [2025-03-17 11:04:23,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:23,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:23,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 11:04:23,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 11:04:23,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:23,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:23,804 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-17 11:04:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393761341] [2025-03-17 11:04:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393761341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288594647] [2025-03-17 11:04:23,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:23,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:23,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:23,806 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-17 11:04:23,808 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-17 11:04:23,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 11:04:23,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 11:04:23,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:23,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:23,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:04:23,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:23,943 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-17 11:04:23,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:24,047 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-17 11:04:24,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288594647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:24,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:24,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 11:04:24,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714064740] [2025-03-17 11:04:24,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:24,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:04:24,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:24,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:04:24,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:04:24,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 149 [2025-03-17 11:04:24,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 199 transitions, 664 flow. Second operand has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 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-17 11:04:24,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:24,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 149 [2025-03-17 11:04:24,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:24,340 INFO L124 PetriNetUnfolderBase]: 123/780 cut-off events. [2025-03-17 11:04:24,340 INFO L125 PetriNetUnfolderBase]: For 129/144 co-relation queries the response was YES. [2025-03-17 11:04:24,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 780 events. 123/780 cut-off events. For 129/144 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4498 event pairs, 41 based on Foata normal form. 4/767 useless extension candidates. Maximal degree in co-relation 1260. Up to 126 conditions per place. [2025-03-17 11:04:24,344 INFO L140 encePairwiseOnDemand]: 143/149 looper letters, 18 selfloop transitions, 21 changer transitions 0/217 dead transitions. [2025-03-17 11:04:24,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 217 transitions, 830 flow [2025-03-17 11:04:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:04:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:04:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2857 transitions. [2025-03-17 11:04:24,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130712687759668 [2025-03-17 11:04:24,349 INFO L175 Difference]: Start difference. First operand has 170 places, 199 transitions, 664 flow. Second operand 21 states and 2857 transitions. [2025-03-17 11:04:24,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 217 transitions, 830 flow [2025-03-17 11:04:24,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 217 transitions, 830 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:24,354 INFO L231 Difference]: Finished difference. Result has 195 places, 212 transitions, 794 flow [2025-03-17 11:04:24,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=794, PETRI_PLACES=195, PETRI_TRANSITIONS=212} [2025-03-17 11:04:24,355 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 45 predicate places. [2025-03-17 11:04:24,355 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 212 transitions, 794 flow [2025-03-17 11:04:24,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 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-17 11:04:24,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:24,357 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, 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-17 11:04:24,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:04:24,557 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,SelfDestructingSolverStorable3 [2025-03-17 11:04:24,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:24,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1206277910, now seen corresponding path program 2 times [2025-03-17 11:04:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:24,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548305320] [2025-03-17 11:04:24,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:24,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 138 statements into 2 equivalence classes. [2025-03-17 11:04:24,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 103 of 138 statements. [2025-03-17 11:04:24,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:24,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 11:04:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548305320] [2025-03-17 11:04:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548305320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:24,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467633477] [2025-03-17 11:04:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:24,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:24,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:24,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:25,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 149 [2025-03-17 11:04:25,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 212 transitions, 794 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 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-17 11:04:25,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:25,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 149 [2025-03-17 11:04:25,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:25,258 INFO L124 PetriNetUnfolderBase]: 417/1432 cut-off events. [2025-03-17 11:04:25,259 INFO L125 PetriNetUnfolderBase]: For 638/673 co-relation queries the response was YES. [2025-03-17 11:04:25,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3436 conditions, 1432 events. 417/1432 cut-off events. For 638/673 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9197 event pairs, 108 based on Foata normal form. 21/1436 useless extension candidates. Maximal degree in co-relation 3238. Up to 602 conditions per place. [2025-03-17 11:04:25,269 INFO L140 encePairwiseOnDemand]: 132/149 looper letters, 99 selfloop transitions, 53 changer transitions 6/295 dead transitions. [2025-03-17 11:04:25,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 295 transitions, 1462 flow [2025-03-17 11:04:25,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 812 transitions. [2025-03-17 11:04:25,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9082774049217002 [2025-03-17 11:04:25,272 INFO L175 Difference]: Start difference. First operand has 195 places, 212 transitions, 794 flow. Second operand 6 states and 812 transitions. [2025-03-17 11:04:25,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 295 transitions, 1462 flow [2025-03-17 11:04:25,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 295 transitions, 1438 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 11:04:25,283 INFO L231 Difference]: Finished difference. Result has 199 places, 263 transitions, 1276 flow [2025-03-17 11:04:25,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1276, PETRI_PLACES=199, PETRI_TRANSITIONS=263} [2025-03-17 11:04:25,284 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 49 predicate places. [2025-03-17 11:04:25,284 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 263 transitions, 1276 flow [2025-03-17 11:04:25,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 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-17 11:04:25,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:25,285 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, 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-17 11:04:25,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:04:25,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1359088417, now seen corresponding path program 1 times [2025-03-17 11:04:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482512552] [2025-03-17 11:04:25,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:25,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:04:25,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:04:25,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:25,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:25,553 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-17 11:04:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482512552] [2025-03-17 11:04:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482512552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:04:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111113882] [2025-03-17 11:04:25,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:25,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:25,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:25,556 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-17 11:04:25,558 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-17 11:04:25,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:04:25,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:04:25,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:25,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:25,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:04:25,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:04:25,707 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-17 11:04:25,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:04:25,885 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-17 11:04:25,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111113882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:04:25,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:04:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-17 11:04:25,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809371796] [2025-03-17 11:04:25,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:04:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:04:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:25,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:04:25,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:04:25,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 149 [2025-03-17 11:04:25,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 263 transitions, 1276 flow. Second operand has 23 states, 23 states have (on average 136.08695652173913) internal successors, (3130), 23 states have internal predecessors, (3130), 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-17 11:04:25,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:25,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 149 [2025-03-17 11:04:25,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:26,334 INFO L124 PetriNetUnfolderBase]: 227/1138 cut-off events. [2025-03-17 11:04:26,334 INFO L125 PetriNetUnfolderBase]: For 974/1003 co-relation queries the response was YES. [2025-03-17 11:04:26,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 1138 events. 227/1138 cut-off events. For 974/1003 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7358 event pairs, 39 based on Foata normal form. 7/1131 useless extension candidates. Maximal degree in co-relation 2581. Up to 212 conditions per place. [2025-03-17 11:04:26,339 INFO L140 encePairwiseOnDemand]: 143/149 looper letters, 21 selfloop transitions, 30 changer transitions 0/280 dead transitions. [2025-03-17 11:04:26,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 280 transitions, 1500 flow [2025-03-17 11:04:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:04:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:04:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4074 transitions. [2025-03-17 11:04:26,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114093959731544 [2025-03-17 11:04:26,347 INFO L175 Difference]: Start difference. First operand has 199 places, 263 transitions, 1276 flow. Second operand 30 states and 4074 transitions. [2025-03-17 11:04:26,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 280 transitions, 1500 flow [2025-03-17 11:04:26,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 280 transitions, 1492 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:26,358 INFO L231 Difference]: Finished difference. Result has 232 places, 273 transitions, 1420 flow [2025-03-17 11:04:26,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1420, PETRI_PLACES=232, PETRI_TRANSITIONS=273} [2025-03-17 11:04:26,359 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 82 predicate places. [2025-03-17 11:04:26,359 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 273 transitions, 1420 flow [2025-03-17 11:04:26,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 136.08695652173913) internal successors, (3130), 23 states have internal predecessors, (3130), 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-17 11:04:26,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:26,361 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, 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-17 11:04:26,369 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-17 11:04:26,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:04:26,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 11:04:26,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -217844532, now seen corresponding path program 2 times [2025-03-17 11:04:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:26,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249493946] [2025-03-17 11:04:26,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:04:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:26,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-17 11:04:26,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 154 statements. [2025-03-17 11:04:26,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:04:26,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 11:04:26,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249493946] [2025-03-17 11:04:26,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249493946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:26,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:26,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:26,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026480112] [2025-03-17 11:04:26,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:26,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:26,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:26,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:26,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:27,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 149 [2025-03-17 11:04:27,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 273 transitions, 1420 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-17 11:04:27,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:27,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 149 [2025-03-17 11:04:27,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:27,330 INFO L124 PetriNetUnfolderBase]: 571/1827 cut-off events. [2025-03-17 11:04:27,330 INFO L125 PetriNetUnfolderBase]: For 2441/2489 co-relation queries the response was YES. [2025-03-17 11:04:27,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 1827 events. 571/1827 cut-off events. For 2441/2489 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12259 event pairs, 127 based on Foata normal form. 25/1827 useless extension candidates. Maximal degree in co-relation 5266. Up to 841 conditions per place. [2025-03-17 11:04:27,340 INFO L140 encePairwiseOnDemand]: 132/149 looper letters, 120 selfloop transitions, 58 changer transitions 39/365 dead transitions. [2025-03-17 11:04:27,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 365 transitions, 2378 flow [2025-03-17 11:04:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2025-03-17 11:04:27,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8970917225950783 [2025-03-17 11:04:27,343 INFO L175 Difference]: Start difference. First operand has 232 places, 273 transitions, 1420 flow. Second operand 6 states and 802 transitions. [2025-03-17 11:04:27,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 365 transitions, 2378 flow [2025-03-17 11:04:27,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 365 transitions, 2332 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-17 11:04:27,358 INFO L231 Difference]: Finished difference. Result has 223 places, 300 transitions, 1782 flow [2025-03-17 11:04:27,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1782, PETRI_PLACES=223, PETRI_TRANSITIONS=300} [2025-03-17 11:04:27,359 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 73 predicate places. [2025-03-17 11:04:27,359 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 300 transitions, 1782 flow [2025-03-17 11:04:27,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 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-17 11:04:27,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:27,360 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, 1, 1, 1, 1, 1, 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-17 11:04:27,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:04:27,360 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-17 11:04:27,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2109808397, now seen corresponding path program 1 times [2025-03-17 11:04:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:27,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068255772] [2025-03-17 11:04:27,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:27,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 11:04:27,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:04:27,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:27,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:04:27,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:04:27,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 11:04:27,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:04:27,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:27,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:04:27,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:04:27,447 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:04:27,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-17 11:04:27,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-17 11:04:27,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-17 11:04:27,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-17 11:04:27,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-17 11:04:27,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-17 11:04:27,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-17 11:04:27,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:04:27,450 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2025-03-17 11:04:27,497 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:04:27,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:04:27,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:04:27 BasicIcfg [2025-03-17 11:04:27,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:04:27,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:04:27,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:04:27,504 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:04:27,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:21" (3/4) ... [2025-03-17 11:04:27,505 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:04:27,556 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-03-17 11:04:27,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:04:27,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:04:27,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:04:27,598 INFO L158 Benchmark]: Toolchain (without parser) took 7117.92ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 104.2MB in the beginning and 151.1MB in the end (delta: -46.9MB). Peak memory consumption was 198.9MB. Max. memory is 16.1GB. [2025-03-17 11:04:27,598 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:04:27,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.22ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 82.8MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:04:27,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.28ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:04:27,598 INFO L158 Benchmark]: Boogie Preprocessor took 19.52ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 78.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:04:27,598 INFO L158 Benchmark]: IcfgBuilder took 437.64ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 58.7MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:04:27,598 INFO L158 Benchmark]: TraceAbstraction took 6226.83ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 57.6MB in the beginning and 164.5MB in the end (delta: -106.8MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. [2025-03-17 11:04:27,598 INFO L158 Benchmark]: Witness Printer took 93.34ms. Allocated memory is still 385.9MB. Free memory was 164.5MB in the beginning and 151.1MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:04:27,599 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.20ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.22ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 82.8MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.28ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.52ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 78.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 437.64ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 58.7MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6226.83ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 57.6MB in the beginning and 164.5MB in the end (delta: -106.8MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. * Witness Printer took 93.34ms. Allocated memory is still 385.9MB. Free memory was 164.5MB in the beginning and 151.1MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 700]: Data race detected Data race detected The following path leads to a data race: [L684] 0 int data[10]; VAL [data={1:0}] [L685] 0 pthread_mutex_t m[10]; VAL [data={1:0}, m={2:0}] [L693] 0 int i = 0; VAL [data={1:0}, i=0, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=1, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=2, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=3, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=4, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=5, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=6, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=7, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=8, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=9, m={2:0}] [L693] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L693] 0 i++ VAL [data={1:0}, i=10, m={2:0}] [L693] COND FALSE 0 !(i < 10) VAL [data={1:0}, m={2:0}] [L695] 0 int i = __VERIFIER_nondet_int(); VAL [data={1:0}, i=0, m={2:0}] [L696] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data={1:0}, m={2:0}] [L696] RET 0 assume_abort_if_not(0 <= i && i < 10) [L697] 0 pthread_t id; VAL [data={1:0}, i=0, m={2:0}] [L698] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data={1:0}, i=0, id=-1, m={2:0}] [L688] EXPR 1 data[4] VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L688] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L700] EXPR 0 data[4] VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=0, id=-1, m={2:0}] [L700] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=0, id=-1, m={2:0}] [L688] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L700] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=0, id=-1, m={2:0}] [L688] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L700] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, i=0, id=-1, m={2:0}] Now there is a data race (on the heap) between C: data[4]++ [688] and C: data[4]++ [700] - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: 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: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: 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, 176 locations, 176 edges, 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: 6.1s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 503 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1294 IncrementalHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 52 mSDtfsCounter, 1294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 691 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1782occurred in iteration=7, InterpolantAutomatonStates: 81, 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.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1370 NumberOfCodeBlocks, 1270 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1555 ConstructedInterpolants, 0 QuantifiedInterpolants, 2172 SizeOfPredicates, 22 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 365/758 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-17 11:04:27,613 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)