./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:37:04,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:37:04,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:37:04,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:37:04,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:37:04,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:37:04,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:37:04,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:37:04,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:37:04,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:37:04,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:37:04,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:37:04,800 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:37:04,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:37:04,801 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:37:04,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:37:04,802 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:37:04,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:37:04,802 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:37:04,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:37:04,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:37:04,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:37:04,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:37:04,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:37:04,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:37:04,803 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-08 21:37:05,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:37:05,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:37:05,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:37:05,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:37:05,041 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:37:05,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-08 21:37:06,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed914eca7/9f0764cfd35e407aa4fa17a9b8546ba6/FLAG3b89dfd82 [2025-03-08 21:37:06,434 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:37:06,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-08 21:37:06,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed914eca7/9f0764cfd35e407aa4fa17a9b8546ba6/FLAG3b89dfd82 [2025-03-08 21:37:06,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed914eca7/9f0764cfd35e407aa4fa17a9b8546ba6 [2025-03-08 21:37:06,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:37:06,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:37:06,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:37:06,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:37:06,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:37:06,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f67cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06, skipping insertion in model container [2025-03-08 21:37:06,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:37:06,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:37:06,684 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:37:06,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:37:06,754 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:37:06,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06 WrapperNode [2025-03-08 21:37:06,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:37:06,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:37:06,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:37:06,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:37:06,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,790 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2025-03-08 21:37:06,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:37:06,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:37:06,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:37:06,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:37:06,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:37:06,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:37:06,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:37:06,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:37:06,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (1/1) ... [2025-03-08 21:37:06,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:37:06,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:06,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:37:06,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:37:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:37:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 21:37:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 21:37:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:37:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:37:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:37:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:37:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:37:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:37:06,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:37:06,872 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:37:06,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:37:06,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:37:07,148 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:37:07,149 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:37:07,169 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:37:07,170 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:37:07,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:07 BoogieIcfgContainer [2025-03-08 21:37:07,170 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:37:07,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:37:07,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:37:07,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:37:07,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:37:06" (1/3) ... [2025-03-08 21:37:07,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b684392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:07, skipping insertion in model container [2025-03-08 21:37:07,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:06" (2/3) ... [2025-03-08 21:37:07,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b684392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:07, skipping insertion in model container [2025-03-08 21:37:07,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:07" (3/3) ... [2025-03-08 21:37:07,177 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-08 21:37:07,189 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:37:07,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 114 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-08 21:37:07,192 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:37:07,259 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:07,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 120 transitions, 244 flow [2025-03-08 21:37:07,339 INFO L124 PetriNetUnfolderBase]: 6/127 cut-off events. [2025-03-08 21:37:07,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:07,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2025-03-08 21:37:07,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 120 transitions, 244 flow [2025-03-08 21:37:07,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 120 transitions, 244 flow [2025-03-08 21:37:07,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:07,366 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;@3cef3981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:07,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-08 21:37:07,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:07,381 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:07,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:07,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:07,382 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] [2025-03-08 21:37:07,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:07,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash -280794531, now seen corresponding path program 1 times [2025-03-08 21:37:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:07,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226601600] [2025-03-08 21:37:07,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:07,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:07,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:07,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:07,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:08,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:08,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226601600] [2025-03-08 21:37:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226601600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090506052] [2025-03-08 21:37:08,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:08,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:08,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:08,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:08,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2025-03-08 21:37:08,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:08,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:08,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2025-03-08 21:37:08,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:08,291 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2025-03-08 21:37:08,291 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:37:08,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 113 events. 3/113 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 13/117 useless extension candidates. Maximal degree in co-relation 75. Up to 16 conditions per place. [2025-03-08 21:37:08,293 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 15 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-08 21:37:08,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 264 flow [2025-03-08 21:37:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:37:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:37:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2025-03-08 21:37:08,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-03-08 21:37:08,309 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 244 flow. Second operand 6 states and 583 transitions. [2025-03-08 21:37:08,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 264 flow [2025-03-08 21:37:08,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:37:08,316 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 234 flow [2025-03-08 21:37:08,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2025-03-08 21:37:08,324 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-03-08 21:37:08,325 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 234 flow [2025-03-08 21:37:08,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:08,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:08,326 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:08,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:37:08,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:08,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash -714229618, now seen corresponding path program 1 times [2025-03-08 21:37:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:08,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777694576] [2025-03-08 21:37:08,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:08,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:37:08,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:37:08,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:08,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:08,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:08,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777694576] [2025-03-08 21:37:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777694576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:08,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:37:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545541300] [2025-03-08 21:37:08,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:08,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:08,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:08,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:08,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:37:08,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-03-08 21:37:08,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:08,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:08,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-03-08 21:37:08,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:08,435 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2025-03-08 21:37:08,435 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:37:08,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 125 events. 3/125 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 90. Up to 11 conditions per place. [2025-03-08 21:37:08,436 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 9 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-08 21:37:08,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 260 flow [2025-03-08 21:37:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-03-08 21:37:08,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-03-08 21:37:08,439 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 234 flow. Second operand 3 states and 324 transitions. [2025-03-08 21:37:08,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 260 flow [2025-03-08 21:37:08,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 111 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:37:08,442 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 236 flow [2025-03-08 21:37:08,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2025-03-08 21:37:08,443 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-03-08 21:37:08,443 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 236 flow [2025-03-08 21:37:08,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:08,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:08,444 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:08,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:37:08,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1376890318, now seen corresponding path program 1 times [2025-03-08 21:37:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:08,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120093657] [2025-03-08 21:37:08,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:08,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 21:37:08,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 21:37:08,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:08,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:08,534 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-08 21:37:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120093657] [2025-03-08 21:37:08,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120093657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160719415] [2025-03-08 21:37:08,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:08,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:08,539 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-08 21:37:08,540 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-08 21:37:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 21:37:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 21:37:08,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:08,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:37:08,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:08,689 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-08 21:37:08,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:08,736 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-08 21:37:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160719415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:08,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:08,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:37:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362891939] [2025-03-08 21:37:08,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:08,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:37:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:08,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:37:08,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:37:08,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-03-08 21:37:08,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 236 flow. Second operand has 10 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:08,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:08,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-03-08 21:37:08,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:08,906 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2025-03-08 21:37:08,906 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:37:08,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 140 events. 3/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 125. Up to 11 conditions per place. [2025-03-08 21:37:08,907 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 13 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2025-03-08 21:37:08,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 298 flow [2025-03-08 21:37:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:37:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:37:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2025-03-08 21:37:08,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8638888888888889 [2025-03-08 21:37:08,910 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 236 flow. Second operand 9 states and 933 transitions. [2025-03-08 21:37:08,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 298 flow [2025-03-08 21:37:08,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:08,912 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 284 flow [2025-03-08 21:37:08,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=284, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2025-03-08 21:37:08,913 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-03-08 21:37:08,913 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 284 flow [2025-03-08 21:37:08,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:08,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:08,914 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:08,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:37:09,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:09,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:09,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1215666098, now seen corresponding path program 2 times [2025-03-08 21:37:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:09,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048221650] [2025-03-08 21:37:09,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:09,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-08 21:37:09,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 21:37:09,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:09,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:09,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048221650] [2025-03-08 21:37:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048221650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681893787] [2025-03-08 21:37:09,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:09,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:09,310 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-08 21:37:09,312 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-08 21:37:09,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-08 21:37:09,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 21:37:09,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:09,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:09,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:37:09,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:09,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681893787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:09,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:37:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408972000] [2025-03-08 21:37:09,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:09,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:37:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:09,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:37:09,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:37:09,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-03-08 21:37:09,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 284 flow. Second operand has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:09,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:09,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-03-08 21:37:09,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:09,819 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2025-03-08 21:37:09,819 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-08 21:37:09,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 179 events. 3/179 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 185. Up to 11 conditions per place. [2025-03-08 21:37:09,820 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 16 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2025-03-08 21:37:09,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 426 flow [2025-03-08 21:37:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:37:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:37:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1855 transitions. [2025-03-08 21:37:09,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8587962962962963 [2025-03-08 21:37:09,825 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 284 flow. Second operand 18 states and 1855 transitions. [2025-03-08 21:37:09,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 426 flow [2025-03-08 21:37:09,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 131 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:09,830 INFO L231 Difference]: Finished difference. Result has 143 places, 127 transitions, 384 flow [2025-03-08 21:37:09,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=384, PETRI_PLACES=143, PETRI_TRANSITIONS=127} [2025-03-08 21:37:09,831 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-03-08 21:37:09,831 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 127 transitions, 384 flow [2025-03-08 21:37:09,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:09,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:09,833 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:09,841 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-08 21:37:10,033 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-08 21:37:10,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:10,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1620490254, now seen corresponding path program 3 times [2025-03-08 21:37:10,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:10,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849572847] [2025-03-08 21:37:10,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:37:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:10,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-03-08 21:37:10,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 21:37:10,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 21:37:10,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:10,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:37:10,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 21:37:10,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 21:37:10,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:10,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:10,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:37:10,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:37:10,141 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-08 21:37:10,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-08 21:37:10,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-08 21:37:10,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-08 21:37:10,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-08 21:37:10,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-08 21:37:10,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-08 21:37:10,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-08 21:37:10,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-08 21:37:10,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-08 21:37:10,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:37:10,143 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-08 21:37:10,145 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:37:10,145 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 21:37:10,176 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:10,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 188 transitions, 386 flow [2025-03-08 21:37:10,193 INFO L124 PetriNetUnfolderBase]: 11/204 cut-off events. [2025-03-08 21:37:10,193 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:37:10,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 204 events. 11/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 393 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2025-03-08 21:37:10,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 188 transitions, 386 flow [2025-03-08 21:37:10,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 188 transitions, 386 flow [2025-03-08 21:37:10,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:10,196 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;@3cef3981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:10,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-08 21:37:10,199 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:10,199 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:10,199 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:10,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:10,199 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] [2025-03-08 21:37:10,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:10,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash 201509785, now seen corresponding path program 1 times [2025-03-08 21:37:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:10,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867770276] [2025-03-08 21:37:10,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:10,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:10,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:10,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:10,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:10,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867770276] [2025-03-08 21:37:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867770276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:10,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:10,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:10,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013029915] [2025-03-08 21:37:10,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:10,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:10,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:10,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:10,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:10,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2025-03-08 21:37:10,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:10,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:10,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2025-03-08 21:37:10,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:10,590 INFO L124 PetriNetUnfolderBase]: 104/725 cut-off events. [2025-03-08 21:37:10,590 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-08 21:37:10,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 725 events. 104/725 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3754 event pairs, 72 based on Foata normal form. 136/754 useless extension candidates. Maximal degree in co-relation 669. Up to 185 conditions per place. [2025-03-08 21:37:10,597 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 24 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2025-03-08 21:37:10,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 414 flow [2025-03-08 21:37:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:37:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:37:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 925 transitions. [2025-03-08 21:37:10,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200354609929078 [2025-03-08 21:37:10,600 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 386 flow. Second operand 6 states and 925 transitions. [2025-03-08 21:37:10,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 414 flow [2025-03-08 21:37:10,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 173 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:37:10,603 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 366 flow [2025-03-08 21:37:10,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2025-03-08 21:37:10,604 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-03-08 21:37:10,605 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 366 flow [2025-03-08 21:37:10,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:10,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:10,605 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:10,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:37:10,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:10,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1506341509, now seen corresponding path program 1 times [2025-03-08 21:37:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585846947] [2025-03-08 21:37:10,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:10,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 21:37:10,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 21:37:10,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:10,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585846947] [2025-03-08 21:37:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585846947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:10,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:37:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077296881] [2025-03-08 21:37:10,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:10,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:10,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:10,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:10,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:37:10,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 188 [2025-03-08 21:37:10,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:10,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:10,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 188 [2025-03-08 21:37:10,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:10,705 INFO L124 PetriNetUnfolderBase]: 33/489 cut-off events. [2025-03-08 21:37:10,706 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-08 21:37:10,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 489 events. 33/489 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2027 event pairs, 20 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 514. Up to 56 conditions per place. [2025-03-08 21:37:10,709 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2025-03-08 21:37:10,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 174 transitions, 402 flow [2025-03-08 21:37:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-03-08 21:37:10,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-08 21:37:10,714 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 366 flow. Second operand 3 states and 506 transitions. [2025-03-08 21:37:10,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 174 transitions, 402 flow [2025-03-08 21:37:10,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:37:10,716 INFO L231 Difference]: Finished difference. Result has 176 places, 174 transitions, 368 flow [2025-03-08 21:37:10,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=176, PETRI_TRANSITIONS=174} [2025-03-08 21:37:10,717 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-03-08 21:37:10,717 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 174 transitions, 368 flow [2025-03-08 21:37:10,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:10,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:10,718 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:10,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:37:10,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:10,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash -398308635, now seen corresponding path program 1 times [2025-03-08 21:37:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464807655] [2025-03-08 21:37:10,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:10,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 21:37:10,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 21:37:10,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:10,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:10,789 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-08 21:37:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464807655] [2025-03-08 21:37:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464807655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753896875] [2025-03-08 21:37:10,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:10,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:10,792 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-08 21:37:10,794 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-08 21:37:10,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 21:37:10,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 21:37:10,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:10,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:10,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:37:10,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:10,876 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-08 21:37:10,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:10,904 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-08 21:37:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753896875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:10,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:10,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:37:10,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407473718] [2025-03-08 21:37:10,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:10,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:37:10,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:10,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:37:10,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:37:10,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-08 21:37:10,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 174 transitions, 368 flow. Second operand has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:10,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:10,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-08 21:37:10,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:11,054 INFO L124 PetriNetUnfolderBase]: 33/504 cut-off events. [2025-03-08 21:37:11,055 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-08 21:37:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 504 events. 33/504 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1998 event pairs, 20 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 549. Up to 56 conditions per place. [2025-03-08 21:37:11,058 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 18 selfloop transitions, 9 changer transitions 0/182 dead transitions. [2025-03-08 21:37:11,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 440 flow [2025-03-08 21:37:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:37:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:37:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1469 transitions. [2025-03-08 21:37:11,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682033096926713 [2025-03-08 21:37:11,061 INFO L175 Difference]: Start difference. First operand has 176 places, 174 transitions, 368 flow. Second operand 9 states and 1469 transitions. [2025-03-08 21:37:11,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 440 flow [2025-03-08 21:37:11,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:11,063 INFO L231 Difference]: Finished difference. Result has 186 places, 180 transitions, 416 flow [2025-03-08 21:37:11,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=416, PETRI_PLACES=186, PETRI_TRANSITIONS=180} [2025-03-08 21:37:11,064 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-03-08 21:37:11,064 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 416 flow [2025-03-08 21:37:11,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:11,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:11,066 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:11,072 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-08 21:37:11,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:11,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:11,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1404752155, now seen corresponding path program 2 times [2025-03-08 21:37:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481384699] [2025-03-08 21:37:11,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:11,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-08 21:37:11,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:37:11,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:11,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:11,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481384699] [2025-03-08 21:37:11,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481384699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:11,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126006866] [2025-03-08 21:37:11,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:11,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:11,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:11,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:11,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:37:11,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-08 21:37:11,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:37:11,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:11,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:11,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:37:11,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:11,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:11,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126006866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:11,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:11,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:37:11,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13839498] [2025-03-08 21:37:11,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:11,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:37:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:11,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:37:11,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:37:11,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-08 21:37:11,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 180 transitions, 416 flow. Second operand has 15 states, 15 states have (on average 162.13333333333333) internal successors, (2432), 15 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:11,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:11,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-08 21:37:11,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:11,947 INFO L124 PetriNetUnfolderBase]: 33/543 cut-off events. [2025-03-08 21:37:11,948 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-08 21:37:11,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 543 events. 33/543 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1972 event pairs, 20 based on Foata normal form. 3/497 useless extension candidates. Maximal degree in co-relation 511. Up to 56 conditions per place. [2025-03-08 21:37:11,951 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 21 selfloop transitions, 18 changer transitions 0/194 dead transitions. [2025-03-08 21:37:11,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 194 transitions, 568 flow [2025-03-08 21:37:11,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:37:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:37:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2922 transitions. [2025-03-08 21:37:11,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8634751773049646 [2025-03-08 21:37:11,957 INFO L175 Difference]: Start difference. First operand has 186 places, 180 transitions, 416 flow. Second operand 18 states and 2922 transitions. [2025-03-08 21:37:11,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 194 transitions, 568 flow [2025-03-08 21:37:11,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:11,961 INFO L231 Difference]: Finished difference. Result has 206 places, 190 transitions, 516 flow [2025-03-08 21:37:11,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=516, PETRI_PLACES=206, PETRI_TRANSITIONS=190} [2025-03-08 21:37:11,963 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-03-08 21:37:11,963 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 190 transitions, 516 flow [2025-03-08 21:37:11,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 162.13333333333333) internal successors, (2432), 15 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:11,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:11,964 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:11,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 21:37:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:12,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1979172485, now seen corresponding path program 3 times [2025-03-08 21:37:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227029704] [2025-03-08 21:37:12,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:37:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:12,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-08 21:37:12,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 21:37:12,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 21:37:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:12,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:37:12,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 21:37:12,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 21:37:12,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:12,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:12,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:37:12,245 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:37:12,245 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-08 21:37:12,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-08 21:37:12,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-08 21:37:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:37:12,246 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-08 21:37:12,247 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:37:12,247 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 21:37:12,281 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:12,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 256 transitions, 530 flow [2025-03-08 21:37:12,305 INFO L124 PetriNetUnfolderBase]: 16/281 cut-off events. [2025-03-08 21:37:12,306 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 21:37:12,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 281 events. 16/281 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 762 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 210. Up to 4 conditions per place. [2025-03-08 21:37:12,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 256 transitions, 530 flow [2025-03-08 21:37:12,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 256 transitions, 530 flow [2025-03-08 21:37:12,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:12,312 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;@3cef3981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:12,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-08 21:37:12,314 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:12,314 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:12,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:12,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:12,314 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] [2025-03-08 21:37:12,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1954851993, now seen corresponding path program 1 times [2025-03-08 21:37:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30413286] [2025-03-08 21:37:12,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:12,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:12,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:12,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:12,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:12,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:12,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30413286] [2025-03-08 21:37:12,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30413286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:12,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:12,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030432103] [2025-03-08 21:37:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:12,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:12,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:12,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:12,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 256 [2025-03-08 21:37:12,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 256 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:12,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:12,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 256 [2025-03-08 21:37:12,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:13,287 INFO L124 PetriNetUnfolderBase]: 1746/6791 cut-off events. [2025-03-08 21:37:13,288 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2025-03-08 21:37:13,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9602 conditions, 6791 events. 1746/6791 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 67121 event pairs, 1368 based on Foata normal form. 1463/7182 useless extension candidates. Maximal degree in co-relation 6429. Up to 2449 conditions per place. [2025-03-08 21:37:13,337 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 33 selfloop transitions, 5 changer transitions 0/236 dead transitions. [2025-03-08 21:37:13,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 236 transitions, 566 flow [2025-03-08 21:37:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:37:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:37:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1267 transitions. [2025-03-08 21:37:13,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8248697916666666 [2025-03-08 21:37:13,340 INFO L175 Difference]: Start difference. First operand has 247 places, 256 transitions, 530 flow. Second operand 6 states and 1267 transitions. [2025-03-08 21:37:13,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 236 transitions, 566 flow [2025-03-08 21:37:13,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 236 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-08 21:37:13,344 INFO L231 Difference]: Finished difference. Result has 241 places, 236 transitions, 498 flow [2025-03-08 21:37:13,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=241, PETRI_TRANSITIONS=236} [2025-03-08 21:37:13,345 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-03-08 21:37:13,345 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 236 transitions, 498 flow [2025-03-08 21:37:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:13,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:13,346 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-03-08 21:37:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:37:13,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:13,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash -462206525, now seen corresponding path program 1 times [2025-03-08 21:37:13,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:13,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991560091] [2025-03-08 21:37:13,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:13,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 21:37:13,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 21:37:13,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:13,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991560091] [2025-03-08 21:37:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991560091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:13,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:13,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:37:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245883230] [2025-03-08 21:37:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:13,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:13,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:37:13,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 256 [2025-03-08 21:37:13,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 236 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:13,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:13,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 256 [2025-03-08 21:37:13,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:13,686 INFO L124 PetriNetUnfolderBase]: 283/2409 cut-off events. [2025-03-08 21:37:13,686 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-08 21:37:13,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 2409 events. 283/2409 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19674 event pairs, 220 based on Foata normal form. 1/2155 useless extension candidates. Maximal degree in co-relation 2834. Up to 381 conditions per place. [2025-03-08 21:37:13,704 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 19 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2025-03-08 21:37:13,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 237 transitions, 544 flow [2025-03-08 21:37:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-08 21:37:13,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2025-03-08 21:37:13,708 INFO L175 Difference]: Start difference. First operand has 241 places, 236 transitions, 498 flow. Second operand 3 states and 688 transitions. [2025-03-08 21:37:13,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 237 transitions, 544 flow [2025-03-08 21:37:13,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 237 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:37:13,712 INFO L231 Difference]: Finished difference. Result has 239 places, 237 transitions, 500 flow [2025-03-08 21:37:13,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=239, PETRI_TRANSITIONS=237} [2025-03-08 21:37:13,714 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-03-08 21:37:13,714 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 237 transitions, 500 flow [2025-03-08 21:37:13,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:13,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:13,714 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-03-08 21:37:13,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:37:13,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:13,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1312957661, now seen corresponding path program 1 times [2025-03-08 21:37:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697164190] [2025-03-08 21:37:13,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:13,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:13,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 21:37:13,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 21:37:13,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:13,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:13,768 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-08 21:37:13,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697164190] [2025-03-08 21:37:13,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697164190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040593024] [2025-03-08 21:37:13,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:13,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:13,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:13,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:13,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 21:37:13,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 21:37:13,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 21:37:13,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:13,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:13,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:37:13,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:13,875 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-08 21:37:13,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:13,908 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-08 21:37:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040593024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:13,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:13,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:37:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191868300] [2025-03-08 21:37:13,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:13,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:37:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:13,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:37:13,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:37:13,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-03-08 21:37:13,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 237 transitions, 500 flow. Second operand has 10 states, 10 states have (on average 221.1) internal successors, (2211), 10 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:13,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:13,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-03-08 21:37:13,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:14,325 INFO L124 PetriNetUnfolderBase]: 283/2424 cut-off events. [2025-03-08 21:37:14,325 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-08 21:37:14,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 2424 events. 283/2424 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19658 event pairs, 220 based on Foata normal form. 2/2171 useless extension candidates. Maximal degree in co-relation 2869. Up to 381 conditions per place. [2025-03-08 21:37:14,336 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 23 selfloop transitions, 9 changer transitions 0/245 dead transitions. [2025-03-08 21:37:14,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 245 transitions, 582 flow [2025-03-08 21:37:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:37:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:37:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2005 transitions. [2025-03-08 21:37:14,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702256944444444 [2025-03-08 21:37:14,339 INFO L175 Difference]: Start difference. First operand has 239 places, 237 transitions, 500 flow. Second operand 9 states and 2005 transitions. [2025-03-08 21:37:14,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 245 transitions, 582 flow [2025-03-08 21:37:14,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:14,342 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 548 flow [2025-03-08 21:37:14,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=548, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2025-03-08 21:37:14,343 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-03-08 21:37:14,343 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 548 flow [2025-03-08 21:37:14,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 221.1) internal successors, (2211), 10 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:14,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:14,344 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 21:37:14,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 21:37:14,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 21:37:14,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1824530211, now seen corresponding path program 2 times [2025-03-08 21:37:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608765136] [2025-03-08 21:37:14,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:14,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-08 21:37:14,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 21:37:14,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:14,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608765136] [2025-03-08 21:37:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608765136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718835451] [2025-03-08 21:37:14,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:14,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:14,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:14,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:14,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 21:37:14,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-08 21:37:14,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 21:37:14,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:14,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:37:14,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:14,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718835451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:14,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:37:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671298765] [2025-03-08 21:37:14,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:14,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:37:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:14,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:37:14,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:37:14,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-03-08 21:37:14,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 548 flow. Second operand has 15 states, 15 states have (on average 221.2) internal successors, (3318), 15 states have internal predecessors, (3318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:14,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:14,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-03-08 21:37:14,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:15,327 INFO L124 PetriNetUnfolderBase]: 283/2463 cut-off events. [2025-03-08 21:37:15,327 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-08 21:37:15,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 2463 events. 283/2463 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19584 event pairs, 220 based on Foata normal form. 3/2211 useless extension candidates. Maximal degree in co-relation 2831. Up to 381 conditions per place. [2025-03-08 21:37:15,338 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 26 selfloop transitions, 18 changer transitions 0/257 dead transitions. [2025-03-08 21:37:15,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 257 transitions, 710 flow [2025-03-08 21:37:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:37:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:37:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3989 transitions. [2025-03-08 21:37:15,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656684027777778 [2025-03-08 21:37:15,345 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 548 flow. Second operand 18 states and 3989 transitions. [2025-03-08 21:37:15,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 257 transitions, 710 flow [2025-03-08 21:37:15,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 257 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:15,350 INFO L231 Difference]: Finished difference. Result has 269 places, 253 transitions, 648 flow [2025-03-08 21:37:15,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=648, PETRI_PLACES=269, PETRI_TRANSITIONS=253} [2025-03-08 21:37:15,351 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-03-08 21:37:15,351 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 253 transitions, 648 flow [2025-03-08 21:37:15,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 221.2) internal successors, (3318), 15 states have internal predecessors, (3318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:15,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:15,353 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 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] [2025-03-08 21:37:15,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 21:37:15,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:15,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:15,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash -73925181, now seen corresponding path program 3 times [2025-03-08 21:37:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036550868] [2025-03-08 21:37:15,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:37:15,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:15,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-03-08 21:37:15,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 21:37:15,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 21:37:15,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:15,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:37:15,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 21:37:15,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 21:37:15,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:15,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:15,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:37:15,649 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:37:15,649 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-08 21:37:15,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-08 21:37:15,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-08 21:37:15,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-08 21:37:15,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-08 21:37:15,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-08 21:37:15,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-08 21:37:15,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-08 21:37:15,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-08 21:37:15,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-08 21:37:15,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-08 21:37:15,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-08 21:37:15,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-08 21:37:15,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-08 21:37:15,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-08 21:37:15,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-08 21:37:15,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-08 21:37:15,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-08 21:37:15,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:37:15,651 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-08 21:37:15,652 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:37:15,652 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 21:37:15,681 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:15,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 324 transitions, 676 flow [2025-03-08 21:37:15,709 INFO L124 PetriNetUnfolderBase]: 21/358 cut-off events. [2025-03-08 21:37:15,710 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 21:37:15,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 358 events. 21/358 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1178 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 289. Up to 5 conditions per place. [2025-03-08 21:37:15,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 324 transitions, 676 flow [2025-03-08 21:37:15,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 324 transitions, 676 flow [2025-03-08 21:37:15,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:15,716 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;@3cef3981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:15,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-08 21:37:15,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:15,717 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:15,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:15,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:15,718 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] [2025-03-08 21:37:15,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:15,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash 684264797, now seen corresponding path program 1 times [2025-03-08 21:37:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6075436] [2025-03-08 21:37:15,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:15,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:15,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:15,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:15,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6075436] [2025-03-08 21:37:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6075436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223946134] [2025-03-08 21:37:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:15,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:15,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:15,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:16,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-03-08 21:37:16,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 324 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:16,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:16,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-03-08 21:37:16,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:22,810 INFO L124 PetriNetUnfolderBase]: 23093/67604 cut-off events. [2025-03-08 21:37:22,810 INFO L125 PetriNetUnfolderBase]: For 7852/7852 co-relation queries the response was YES. [2025-03-08 21:37:23,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101026 conditions, 67604 events. 23093/67604 cut-off events. For 7852/7852 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 897180 event pairs, 18864 based on Foata normal form. 15545/73239 useless extension candidates. Maximal degree in co-relation 60573. Up to 29414 conditions per place. [2025-03-08 21:37:23,653 INFO L140 encePairwiseOnDemand]: 305/324 looper letters, 42 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-03-08 21:37:23,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 720 flow [2025-03-08 21:37:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:37:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:37:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1609 transitions. [2025-03-08 21:37:23,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8276748971193416 [2025-03-08 21:37:23,656 INFO L175 Difference]: Start difference. First operand has 312 places, 324 transitions, 676 flow. Second operand 6 states and 1609 transitions. [2025-03-08 21:37:23,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 720 flow [2025-03-08 21:37:23,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 21:37:23,664 INFO L231 Difference]: Finished difference. Result has 304 places, 299 transitions, 630 flow [2025-03-08 21:37:23,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=304, PETRI_TRANSITIONS=299} [2025-03-08 21:37:23,665 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-08 21:37:23,665 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 299 transitions, 630 flow [2025-03-08 21:37:23,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:23,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:23,666 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:23,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:37:23,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:23,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash -998798520, now seen corresponding path program 1 times [2025-03-08 21:37:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:23,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773947599] [2025-03-08 21:37:23,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:23,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 21:37:23,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 21:37:23,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:23,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773947599] [2025-03-08 21:37:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773947599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:23,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:23,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:37:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111177828] [2025-03-08 21:37:23,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:23,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:23,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:23,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:37:23,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 324 [2025-03-08 21:37:23,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 299 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:23,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:23,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 324 [2025-03-08 21:37:23,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:25,237 INFO L124 PetriNetUnfolderBase]: 2033/12509 cut-off events. [2025-03-08 21:37:25,237 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-08 21:37:25,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15499 conditions, 12509 events. 2033/12509 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147666 event pairs, 1720 based on Foata normal form. 1/11224 useless extension candidates. Maximal degree in co-relation 15434. Up to 2506 conditions per place. [2025-03-08 21:37:25,362 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 24 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-03-08 21:37:25,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 300 transitions, 686 flow [2025-03-08 21:37:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2025-03-08 21:37:25,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950617283950617 [2025-03-08 21:37:25,363 INFO L175 Difference]: Start difference. First operand has 304 places, 299 transitions, 630 flow. Second operand 3 states and 870 transitions. [2025-03-08 21:37:25,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 300 transitions, 686 flow [2025-03-08 21:37:25,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 300 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:37:25,369 INFO L231 Difference]: Finished difference. Result has 302 places, 300 transitions, 632 flow [2025-03-08 21:37:25,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=302, PETRI_TRANSITIONS=300} [2025-03-08 21:37:25,370 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-08 21:37:25,370 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 300 transitions, 632 flow [2025-03-08 21:37:25,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:25,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:25,370 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:25,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:37:25,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:25,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:25,371 INFO L85 PathProgramCache]: Analyzing trace with hash 9651948, now seen corresponding path program 1 times [2025-03-08 21:37:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:25,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568450372] [2025-03-08 21:37:25,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:25,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:37:25,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:37:25,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:25,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:25,407 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-08 21:37:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:25,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568450372] [2025-03-08 21:37:25,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568450372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37875024] [2025-03-08 21:37:25,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:25,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:25,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 21:37:25,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:37:25,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:37:25,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:25,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:25,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:37:25,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:25,519 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-08 21:37:25,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:25,550 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-08 21:37:25,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37875024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:25,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:25,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:37:25,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276420326] [2025-03-08 21:37:25,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:25,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:37:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:25,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:37:25,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:37:25,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-03-08 21:37:25,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 300 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 280.2) internal successors, (2802), 10 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:25,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:25,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-03-08 21:37:25,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:27,136 INFO L124 PetriNetUnfolderBase]: 2033/12524 cut-off events. [2025-03-08 21:37:27,137 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-03-08 21:37:27,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15522 conditions, 12524 events. 2033/12524 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147597 event pairs, 1720 based on Foata normal form. 2/11240 useless extension candidates. Maximal degree in co-relation 15469. Up to 2506 conditions per place. [2025-03-08 21:37:27,268 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 28 selfloop transitions, 9 changer transitions 0/308 dead transitions. [2025-03-08 21:37:27,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 308 transitions, 724 flow [2025-03-08 21:37:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:37:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:37:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2541 transitions. [2025-03-08 21:37:27,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8713991769547325 [2025-03-08 21:37:27,272 INFO L175 Difference]: Start difference. First operand has 302 places, 300 transitions, 632 flow. Second operand 9 states and 2541 transitions. [2025-03-08 21:37:27,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 308 transitions, 724 flow [2025-03-08 21:37:27,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:27,278 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 680 flow [2025-03-08 21:37:27,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=680, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-03-08 21:37:27,279 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 0 predicate places. [2025-03-08 21:37:27,279 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 680 flow [2025-03-08 21:37:27,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 280.2) internal successors, (2802), 10 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:27,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:27,280 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 21:37:27,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 21:37:27,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:27,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:27,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 742083692, now seen corresponding path program 2 times [2025-03-08 21:37:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:27,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981082927] [2025-03-08 21:37:27,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:27,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-08 21:37:27,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 21:37:27,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:27,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:27,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981082927] [2025-03-08 21:37:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981082927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846997152] [2025-03-08 21:37:27,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:27,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:27,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:27,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:27,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 21:37:27,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-08 21:37:27,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 21:37:27,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:27,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:27,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:37:27,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:27,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846997152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:27,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:37:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501474250] [2025-03-08 21:37:27,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:27,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:37:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:27,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:37:27,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:37:27,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-03-08 21:37:27,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 680 flow. Second operand has 15 states, 15 states have (on average 280.26666666666665) internal successors, (4204), 15 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:27,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:27,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-03-08 21:37:27,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:29,934 INFO L124 PetriNetUnfolderBase]: 2033/12563 cut-off events. [2025-03-08 21:37:29,935 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-03-08 21:37:30,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15615 conditions, 12563 events. 2033/12563 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147610 event pairs, 1720 based on Foata normal form. 3/11280 useless extension candidates. Maximal degree in co-relation 15431. Up to 2506 conditions per place. [2025-03-08 21:37:30,105 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 31 selfloop transitions, 18 changer transitions 0/320 dead transitions. [2025-03-08 21:37:30,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 320 transitions, 852 flow [2025-03-08 21:37:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:37:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:37:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5056 transitions. [2025-03-08 21:37:30,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669410150891632 [2025-03-08 21:37:30,109 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 680 flow. Second operand 18 states and 5056 transitions. [2025-03-08 21:37:30,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 320 transitions, 852 flow [2025-03-08 21:37:30,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 320 transitions, 840 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:30,118 INFO L231 Difference]: Finished difference. Result has 332 places, 316 transitions, 780 flow [2025-03-08 21:37:30,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=780, PETRI_PLACES=332, PETRI_TRANSITIONS=316} [2025-03-08 21:37:30,119 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 20 predicate places. [2025-03-08 21:37:30,119 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 316 transitions, 780 flow [2025-03-08 21:37:30,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 280.26666666666665) internal successors, (4204), 15 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:30,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:30,121 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:37:30,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 21:37:30,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:30,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:30,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:30,326 INFO L85 PathProgramCache]: Analyzing trace with hash 837176008, now seen corresponding path program 3 times [2025-03-08 21:37:30,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:30,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149082966] [2025-03-08 21:37:30,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:37:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:30,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 7 equivalence classes. [2025-03-08 21:37:30,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 21:37:30,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 21:37:30,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:30,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:37:30,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 21:37:30,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 21:37:30,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:30,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:30,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:37:30,396 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:37:30,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-08 21:37:30,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-08 21:37:30,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-08 21:37:30,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:37:30,397 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-08 21:37:30,399 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:37:30,399 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-08 21:37:30,443 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:30,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 392 transitions, 824 flow [2025-03-08 21:37:30,505 INFO L124 PetriNetUnfolderBase]: 26/435 cut-off events. [2025-03-08 21:37:30,505 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-08 21:37:30,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 435 events. 26/435 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1594 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 371. Up to 6 conditions per place. [2025-03-08 21:37:30,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 392 transitions, 824 flow [2025-03-08 21:37:30,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 392 transitions, 824 flow [2025-03-08 21:37:30,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:30,517 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;@3cef3981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:30,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 21:37:30,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:30,520 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:30,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:30,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:30,520 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] [2025-03-08 21:37:30,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:37:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash 684715493, now seen corresponding path program 1 times [2025-03-08 21:37:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216052768] [2025-03-08 21:37:30,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:30,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:30,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:30,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:30,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:30,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216052768] [2025-03-08 21:37:30,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216052768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:30,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:30,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:30,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508438320] [2025-03-08 21:37:30,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:30,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:30,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:30,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:30,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 392 [2025-03-08 21:37:30,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 392 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:30,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:30,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 392 [2025-03-08 21:37:30,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand