./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.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 e58f19518df0581d95f13f906b8c44b8c282310d0c51162e45cefa58addde8de --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:29:14,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:29:14,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:29:14,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:29:14,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:29:14,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:29:14,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:29:14,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:29:14,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:29:14,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:29:14,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:29:14,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:29:14,379 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:29:14,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:29:14,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:29:14,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:29:14,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:29:14,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:29:14,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:29:14,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:29:14,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:29:14,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:29:14,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:29:14,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:29:14,382 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 -> e58f19518df0581d95f13f906b8c44b8c282310d0c51162e45cefa58addde8de [2025-03-13 22:29:14,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:29:14,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:29:14,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:29:14,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:29:14,603 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:29:14,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2025-03-13 22:29:15,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec69746e/18ec95f0f7b4403b8a5002a3b9057165/FLAG7bb844908 [2025-03-13 22:29:16,076 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:29:16,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2025-03-13 22:29:16,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec69746e/18ec95f0f7b4403b8a5002a3b9057165/FLAG7bb844908 [2025-03-13 22:29:16,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ec69746e/18ec95f0f7b4403b8a5002a3b9057165 [2025-03-13 22:29:16,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:29:16,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:29:16,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:29:16,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:29:16,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:29:16,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72be87ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16, skipping insertion in model container [2025-03-13 22:29:16,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:29:16,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:29:16,499 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:29:16,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:29:16,577 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:29:16,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16 WrapperNode [2025-03-13 22:29:16,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:29:16,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:29:16,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:29:16,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:29:16,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,607 INFO L138 Inliner]: procedures = 267, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2025-03-13 22:29:16,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:29:16,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:29:16,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:29:16,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:29:16,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:29:16,632 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:29:16,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:29:16,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:29:16,633 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (1/1) ... [2025-03-13 22:29:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:29:16,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:16,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:29:16,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:29:16,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:29:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:29:16,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:29:16,682 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:29:16,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:29:16,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:29:17,032 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:29:17,033 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:29:17,033 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:29:17,051 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:29:17,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:17 BoogieIcfgContainer [2025-03-13 22:29:17,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:29:17,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:29:17,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:29:17,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:29:17,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:29:16" (1/3) ... [2025-03-13 22:29:17,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332ee7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:29:17, skipping insertion in model container [2025-03-13 22:29:17,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:16" (2/3) ... [2025-03-13 22:29:17,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332ee7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:29:17, skipping insertion in model container [2025-03-13 22:29:17,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:17" (3/3) ... [2025-03-13 22:29:17,059 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.i [2025-03-13 22:29:17,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:29:17,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-tid-join.i that has 2 procedures, 117 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-13 22:29:17,073 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:29:17,123 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:29:17,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 119 transitions, 245 flow [2025-03-13 22:29:17,209 INFO L124 PetriNetUnfolderBase]: 2/170 cut-off events. [2025-03-13 22:29:17,210 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:29:17,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 170 events. 2/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 79. Up to 3 conditions per place. [2025-03-13 22:29:17,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 119 transitions, 245 flow [2025-03-13 22:29:17,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 119 transitions, 245 flow [2025-03-13 22:29:17,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:29:17,238 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;@6ffe6173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:29:17,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 22:29:17,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:29:17,254 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-13 22:29:17,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:29:17,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:17,254 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] [2025-03-13 22:29:17,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:17,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1727080092, now seen corresponding path program 1 times [2025-03-13 22:29:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798322910] [2025-03-13 22:29:17,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:17,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:29:17,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:29:17,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:17,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:17,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:17,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798322910] [2025-03-13 22:29:17,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798322910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:17,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:17,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175014824] [2025-03-13 22:29:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:17,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:17,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:17,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:17,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 119 [2025-03-13 22:29:17,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:17,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:17,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 119 [2025-03-13 22:29:17,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:17,576 INFO L124 PetriNetUnfolderBase]: 8/212 cut-off events. [2025-03-13 22:29:17,576 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-13 22:29:17,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 212 events. 8/212 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 531 event pairs, 1 based on Foata normal form. 1/190 useless extension candidates. Maximal degree in co-relation 142. Up to 16 conditions per place. [2025-03-13 22:29:17,578 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 8 selfloop transitions, 3 changer transitions 2/122 dead transitions. [2025-03-13 22:29:17,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 275 flow [2025-03-13 22:29:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-03-13 22:29:17,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635854341736695 [2025-03-13 22:29:17,593 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 245 flow. Second operand 3 states and 344 transitions. [2025-03-13 22:29:17,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 275 flow [2025-03-13 22:29:17,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:17,602 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 263 flow [2025-03-13 22:29:17,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2025-03-13 22:29:17,606 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-03-13 22:29:17,606 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 263 flow [2025-03-13 22:29:17,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:17,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:17,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:17,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:29:17,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:17,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:17,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1489453352, now seen corresponding path program 1 times [2025-03-13 22:29:17,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:17,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199198033] [2025-03-13 22:29:17,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:17,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:29:17,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:29:17,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:17,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199198033] [2025-03-13 22:29:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199198033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:17,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453346991] [2025-03-13 22:29:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:17,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:29:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:17,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:29:17,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:29:17,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 119 [2025-03-13 22:29:17,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:17,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:17,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 119 [2025-03-13 22:29:17,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:17,981 INFO L124 PetriNetUnfolderBase]: 17/323 cut-off events. [2025-03-13 22:29:17,981 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:29:17,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 323 events. 17/323 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1163 event pairs, 1 based on Foata normal form. 1/299 useless extension candidates. Maximal degree in co-relation 311. Up to 49 conditions per place. [2025-03-13 22:29:17,983 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 15 selfloop transitions, 2 changer transitions 5/126 dead transitions. [2025-03-13 22:29:17,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 321 flow [2025-03-13 22:29:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-03-13 22:29:17,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977591036414566 [2025-03-13 22:29:17,985 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 263 flow. Second operand 6 states and 641 transitions. [2025-03-13 22:29:17,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 321 flow [2025-03-13 22:29:17,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:17,988 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 275 flow [2025-03-13 22:29:17,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=130, PETRI_TRANSITIONS=119} [2025-03-13 22:29:17,988 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2025-03-13 22:29:17,988 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 275 flow [2025-03-13 22:29:17,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:17,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:17,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:17,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:29:17,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:17,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1091823684, now seen corresponding path program 1 times [2025-03-13 22:29:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:17,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890664706] [2025-03-13 22:29:17,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:17,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:17,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:29:18,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:29:18,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:18,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890664706] [2025-03-13 22:29:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890664706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:18,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:18,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:18,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902170584] [2025-03-13 22:29:18,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:18,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:18,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:18,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:18,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 119 [2025-03-13 22:29:18,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 119 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:18,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:18,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 119 [2025-03-13 22:29:18,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:18,584 INFO L124 PetriNetUnfolderBase]: 46/420 cut-off events. [2025-03-13 22:29:18,585 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 22:29:18,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 420 events. 46/420 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1911 event pairs, 35 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 510. Up to 117 conditions per place. [2025-03-13 22:29:18,587 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 36 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-03-13 22:29:18,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 126 transitions, 371 flow [2025-03-13 22:29:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2025-03-13 22:29:18,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2025-03-13 22:29:18,588 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 275 flow. Second operand 6 states and 546 transitions. [2025-03-13 22:29:18,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 126 transitions, 371 flow [2025-03-13 22:29:18,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 357 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:18,591 INFO L231 Difference]: Finished difference. Result has 126 places, 118 transitions, 269 flow [2025-03-13 22:29:18,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=126, PETRI_TRANSITIONS=118} [2025-03-13 22:29:18,592 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 6 predicate places. [2025-03-13 22:29:18,592 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 118 transitions, 269 flow [2025-03-13 22:29:18,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:18,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:18,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:18,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:29:18,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:18,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1602215832, now seen corresponding path program 1 times [2025-03-13 22:29:18,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:18,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489974435] [2025-03-13 22:29:18,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:18,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:18,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:29:18,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:29:18,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:18,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489974435] [2025-03-13 22:29:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489974435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:18,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:18,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232452] [2025-03-13 22:29:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:18,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:18,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:18,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2025-03-13 22:29:18,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:18,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:18,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2025-03-13 22:29:18,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:19,016 INFO L124 PetriNetUnfolderBase]: 46/346 cut-off events. [2025-03-13 22:29:19,016 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:29:19,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 346 events. 46/346 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1576 event pairs, 19 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 407. Up to 112 conditions per place. [2025-03-13 22:29:19,018 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 34 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2025-03-13 22:29:19,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 125 transitions, 361 flow [2025-03-13 22:29:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2025-03-13 22:29:19,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787114845938375 [2025-03-13 22:29:19,020 INFO L175 Difference]: Start difference. First operand has 126 places, 118 transitions, 269 flow. Second operand 6 states and 556 transitions. [2025-03-13 22:29:19,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 125 transitions, 361 flow [2025-03-13 22:29:19,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 351 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:19,022 INFO L231 Difference]: Finished difference. Result has 125 places, 117 transitions, 267 flow [2025-03-13 22:29:19,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=125, PETRI_TRANSITIONS=117} [2025-03-13 22:29:19,023 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-03-13 22:29:19,023 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 117 transitions, 267 flow [2025-03-13 22:29:19,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:19,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:19,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:19,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:29:19,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:19,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:19,024 INFO L85 PathProgramCache]: Analyzing trace with hash -773651573, now seen corresponding path program 1 times [2025-03-13 22:29:19,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:19,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746734335] [2025-03-13 22:29:19,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:19,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:19,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:29:19,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:29:19,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:19,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:19,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:19,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746734335] [2025-03-13 22:29:19,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746734335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:19,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:19,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:19,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475073944] [2025-03-13 22:29:19,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:19,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:19,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:19,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:19,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:19,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 119 [2025-03-13 22:29:19,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:19,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:19,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 119 [2025-03-13 22:29:19,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:19,106 INFO L124 PetriNetUnfolderBase]: 5/216 cut-off events. [2025-03-13 22:29:19,106 INFO L125 PetriNetUnfolderBase]: For 18/31 co-relation queries the response was YES. [2025-03-13 22:29:19,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 216 events. 5/216 cut-off events. For 18/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 595 event pairs, 3 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 212. Up to 25 conditions per place. [2025-03-13 22:29:19,108 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 8 selfloop transitions, 4 changer transitions 3/120 dead transitions. [2025-03-13 22:29:19,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 303 flow [2025-03-13 22:29:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-13 22:29:19,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467787114845938 [2025-03-13 22:29:19,110 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 267 flow. Second operand 3 states and 338 transitions. [2025-03-13 22:29:19,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 303 flow [2025-03-13 22:29:19,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 293 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:19,111 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 279 flow [2025-03-13 22:29:19,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2025-03-13 22:29:19,112 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-03-13 22:29:19,112 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 279 flow [2025-03-13 22:29:19,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:19,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:19,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:19,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:29:19,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:19,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:19,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1679504555, now seen corresponding path program 1 times [2025-03-13 22:29:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:19,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825563168] [2025-03-13 22:29:19,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:19,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:29:19,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:29:19,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:19,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:19,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825563168] [2025-03-13 22:29:19,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825563168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:19,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:19,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296989217] [2025-03-13 22:29:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:19,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:19,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:19,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:19,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2025-03-13 22:29:19,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:19,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:19,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2025-03-13 22:29:19,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:19,710 INFO L124 PetriNetUnfolderBase]: 33/406 cut-off events. [2025-03-13 22:29:19,710 INFO L125 PetriNetUnfolderBase]: For 66/69 co-relation queries the response was YES. [2025-03-13 22:29:19,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 406 events. 33/406 cut-off events. For 66/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1816 event pairs, 23 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 511. Up to 79 conditions per place. [2025-03-13 22:29:19,712 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 31 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-13 22:29:19,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 363 flow [2025-03-13 22:29:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 566 transitions. [2025-03-13 22:29:19,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7927170868347339 [2025-03-13 22:29:19,714 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 279 flow. Second operand 6 states and 566 transitions. [2025-03-13 22:29:19,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 363 flow [2025-03-13 22:29:19,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:19,717 INFO L231 Difference]: Finished difference. Result has 125 places, 115 transitions, 277 flow [2025-03-13 22:29:19,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=125, PETRI_TRANSITIONS=115} [2025-03-13 22:29:19,718 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-03-13 22:29:19,718 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 115 transitions, 277 flow [2025-03-13 22:29:19,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:19,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:19,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:19,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:29:19,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:19,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1735450292, now seen corresponding path program 1 times [2025-03-13 22:29:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821655005] [2025-03-13 22:29:19,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:19,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:29:19,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:29:19,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:19,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:29:19,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:19,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821655005] [2025-03-13 22:29:19,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821655005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:19,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 22:29:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699445310] [2025-03-13 22:29:19,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:19,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:19,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:19,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:19,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:19,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 119 [2025-03-13 22:29:19,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:19,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:19,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 119 [2025-03-13 22:29:19,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:19,958 INFO L124 PetriNetUnfolderBase]: 10/238 cut-off events. [2025-03-13 22:29:19,959 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:29:19,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 238 events. 10/238 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 582 event pairs, 0 based on Foata normal form. 3/233 useless extension candidates. Maximal degree in co-relation 209. Up to 23 conditions per place. [2025-03-13 22:29:19,960 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 13 selfloop transitions, 5 changer transitions 9/116 dead transitions. [2025-03-13 22:29:19,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 116 transitions, 309 flow [2025-03-13 22:29:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2025-03-13 22:29:19,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8879551820728291 [2025-03-13 22:29:19,961 INFO L175 Difference]: Start difference. First operand has 125 places, 115 transitions, 277 flow. Second operand 6 states and 634 transitions. [2025-03-13 22:29:19,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 116 transitions, 309 flow [2025-03-13 22:29:19,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 285 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-03-13 22:29:19,964 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 231 flow [2025-03-13 22:29:19,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2025-03-13 22:29:19,964 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-03-13 22:29:19,964 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 231 flow [2025-03-13 22:29:19,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:19,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:19,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:19,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:29:19,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:19,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash 781559917, now seen corresponding path program 1 times [2025-03-13 22:29:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634909341] [2025-03-13 22:29:19,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:19,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:29:19,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:29:19,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:19,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:29:20,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:20,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634909341] [2025-03-13 22:29:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634909341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:20,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:20,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051739876] [2025-03-13 22:29:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:20,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:20,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:20,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:20,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2025-03-13 22:29:20,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 103 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:20,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:20,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2025-03-13 22:29:20,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:20,466 INFO L124 PetriNetUnfolderBase]: 28/299 cut-off events. [2025-03-13 22:29:20,466 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:29:20,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 299 events. 28/299 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1036 event pairs, 18 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 300. Up to 60 conditions per place. [2025-03-13 22:29:20,469 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 12 selfloop transitions, 0 changer transitions 38/110 dead transitions. [2025-03-13 22:29:20,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 301 flow [2025-03-13 22:29:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-03-13 22:29:20,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8473389355742297 [2025-03-13 22:29:20,472 INFO L175 Difference]: Start difference. First operand has 120 places, 103 transitions, 231 flow. Second operand 6 states and 605 transitions. [2025-03-13 22:29:20,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 301 flow [2025-03-13 22:29:20,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 293 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:29:20,474 INFO L231 Difference]: Finished difference. Result has 111 places, 72 transitions, 156 flow [2025-03-13 22:29:20,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=111, PETRI_TRANSITIONS=72} [2025-03-13 22:29:20,474 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -9 predicate places. [2025-03-13 22:29:20,475 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 72 transitions, 156 flow [2025-03-13 22:29:20,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:20,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:20,476 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-13 22:29:20,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:29:20,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:29:20,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:20,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1551377583, now seen corresponding path program 1 times [2025-03-13 22:29:20,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:20,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482256209] [2025-03-13 22:29:20,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:20,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-13 22:29:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 22:29:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:20,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:29:20,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-13 22:29:20,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 22:29:20,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:20,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:20,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:29:20,552 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:29:20,552 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-13 22:29:20,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-13 22:29:20,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-13 22:29:20,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-13 22:29:20,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-13 22:29:20,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-13 22:29:20,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-13 22:29:20,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-13 22:29:20,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-13 22:29:20,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:29:20,555 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:20,556 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:29:20,556 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:29:20,568 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:29:20,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 137 transitions, 290 flow [2025-03-13 22:29:20,591 INFO L124 PetriNetUnfolderBase]: 4/301 cut-off events. [2025-03-13 22:29:20,591 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:29:20,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 301 events. 4/301 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 594 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 172. Up to 6 conditions per place. [2025-03-13 22:29:20,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 137 transitions, 290 flow [2025-03-13 22:29:20,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 137 transitions, 290 flow [2025-03-13 22:29:20,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:29:20,595 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;@6ffe6173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:29:20,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 22:29:20,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:29:20,597 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-13 22:29:20,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:29:20,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:20,597 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] [2025-03-13 22:29:20,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:20,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash 14682556, now seen corresponding path program 1 times [2025-03-13 22:29:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:20,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116644563] [2025-03-13 22:29:20,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:20,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:29:20,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:29:20,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:20,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:20,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116644563] [2025-03-13 22:29:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116644563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:20,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:20,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43706776] [2025-03-13 22:29:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:20,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:20,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:20,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:20,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-03-13 22:29:20,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 137 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:20,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:20,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-03-13 22:29:20,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:20,733 INFO L124 PetriNetUnfolderBase]: 119/878 cut-off events. [2025-03-13 22:29:20,734 INFO L125 PetriNetUnfolderBase]: For 44/87 co-relation queries the response was YES. [2025-03-13 22:29:20,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 878 events. 119/878 cut-off events. For 44/87 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4815 event pairs, 50 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 837. Up to 139 conditions per place. [2025-03-13 22:29:20,738 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 16 selfloop transitions, 4 changer transitions 1/143 dead transitions. [2025-03-13 22:29:20,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 342 flow [2025-03-13 22:29:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-03-13 22:29:20,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513381995133819 [2025-03-13 22:29:20,739 INFO L175 Difference]: Start difference. First operand has 139 places, 137 transitions, 290 flow. Second operand 3 states and 391 transitions. [2025-03-13 22:29:20,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 342 flow [2025-03-13 22:29:20,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:20,741 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 316 flow [2025-03-13 22:29:20,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-03-13 22:29:20,743 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places. [2025-03-13 22:29:20,743 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 316 flow [2025-03-13 22:29:20,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:20,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:20,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:20,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:29:20,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:20,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash 847900008, now seen corresponding path program 1 times [2025-03-13 22:29:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:20,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664369396] [2025-03-13 22:29:20,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:20,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:29:20,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:29:20,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:20,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:20,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664369396] [2025-03-13 22:29:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664369396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:20,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263466563] [2025-03-13 22:29:20,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:29:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:20,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:29:20,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:29:20,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 137 [2025-03-13 22:29:20,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:20,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:20,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 137 [2025-03-13 22:29:20,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:21,025 INFO L124 PetriNetUnfolderBase]: 189/1374 cut-off events. [2025-03-13 22:29:21,025 INFO L125 PetriNetUnfolderBase]: For 72/73 co-relation queries the response was YES. [2025-03-13 22:29:21,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 1374 events. 189/1374 cut-off events. For 72/73 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9510 event pairs, 131 based on Foata normal form. 1/1256 useless extension candidates. Maximal degree in co-relation 1273. Up to 314 conditions per place. [2025-03-13 22:29:21,032 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 20 selfloop transitions, 2 changer transitions 5/146 dead transitions. [2025-03-13 22:29:21,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 386 flow [2025-03-13 22:29:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2025-03-13 22:29:21,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880778588807786 [2025-03-13 22:29:21,034 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 316 flow. Second operand 6 states and 730 transitions. [2025-03-13 22:29:21,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 386 flow [2025-03-13 22:29:21,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:21,037 INFO L231 Difference]: Finished difference. Result has 149 places, 139 transitions, 330 flow [2025-03-13 22:29:21,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=149, PETRI_TRANSITIONS=139} [2025-03-13 22:29:21,037 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 10 predicate places. [2025-03-13 22:29:21,037 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 330 flow [2025-03-13 22:29:21,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:21,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:21,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:21,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:29:21,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:21,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1616460659, now seen corresponding path program 1 times [2025-03-13 22:29:21,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:21,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791869089] [2025-03-13 22:29:21,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:21,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:21,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:29:21,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:29:21,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:21,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:21,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791869089] [2025-03-13 22:29:21,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791869089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:21,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:21,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182659671] [2025-03-13 22:29:21,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:21,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:21,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:21,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:21,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 137 [2025-03-13 22:29:21,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 139 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:21,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:21,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 137 [2025-03-13 22:29:21,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:21,537 INFO L124 PetriNetUnfolderBase]: 448/2416 cut-off events. [2025-03-13 22:29:21,537 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-03-13 22:29:21,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 2416 events. 448/2416 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20046 event pairs, 342 based on Foata normal form. 0/2149 useless extension candidates. Maximal degree in co-relation 3409. Up to 657 conditions per place. [2025-03-13 22:29:21,549 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 49 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2025-03-13 22:29:21,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 154 transitions, 468 flow [2025-03-13 22:29:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2025-03-13 22:29:21,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.781021897810219 [2025-03-13 22:29:21,550 INFO L175 Difference]: Start difference. First operand has 149 places, 139 transitions, 330 flow. Second operand 6 states and 642 transitions. [2025-03-13 22:29:21,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 154 transitions, 468 flow [2025-03-13 22:29:21,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 154 transitions, 456 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:29:21,553 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 326 flow [2025-03-13 22:29:21,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2025-03-13 22:29:21,553 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2025-03-13 22:29:21,553 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 326 flow [2025-03-13 22:29:21,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:21,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:21,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:21,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:29:21,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 446511681, now seen corresponding path program 1 times [2025-03-13 22:29:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:21,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880458176] [2025-03-13 22:29:21,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:21,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:29:21,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:29:21,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:21,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:21,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880458176] [2025-03-13 22:29:21,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880458176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:21,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:21,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436207958] [2025-03-13 22:29:21,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:21,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:21,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:21,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:21,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:21,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 137 [2025-03-13 22:29:21,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:21,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:21,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 137 [2025-03-13 22:29:21,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:22,085 INFO L124 PetriNetUnfolderBase]: 446/2418 cut-off events. [2025-03-13 22:29:22,085 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-13 22:29:22,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3494 conditions, 2418 events. 446/2418 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 20065 event pairs, 264 based on Foata normal form. 0/2139 useless extension candidates. Maximal degree in co-relation 2137. Up to 633 conditions per place. [2025-03-13 22:29:22,096 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 46 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2025-03-13 22:29:22,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 458 flow [2025-03-13 22:29:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2025-03-13 22:29:22,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7931873479318735 [2025-03-13 22:29:22,097 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 326 flow. Second operand 6 states and 652 transitions. [2025-03-13 22:29:22,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 458 flow [2025-03-13 22:29:22,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 448 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:22,099 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 324 flow [2025-03-13 22:29:22,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-03-13 22:29:22,101 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-03-13 22:29:22,101 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 324 flow [2025-03-13 22:29:22,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:22,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:22,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:22,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:29:22,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash -278956412, now seen corresponding path program 1 times [2025-03-13 22:29:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492123509] [2025-03-13 22:29:22,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:22,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:29:22,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:29:22,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:22,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492123509] [2025-03-13 22:29:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492123509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:22,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776985162] [2025-03-13 22:29:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:22,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:22,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:22,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2025-03-13 22:29:22,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:22,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:22,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2025-03-13 22:29:22,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:22,220 INFO L124 PetriNetUnfolderBase]: 165/1189 cut-off events. [2025-03-13 22:29:22,220 INFO L125 PetriNetUnfolderBase]: For 192/359 co-relation queries the response was YES. [2025-03-13 22:29:22,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 1189 events. 165/1189 cut-off events. For 192/359 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8120 event pairs, 88 based on Foata normal form. 3/1059 useless extension candidates. Maximal degree in co-relation 1425. Up to 269 conditions per place. [2025-03-13 22:29:22,225 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 7 changer transitions 0/146 dead transitions. [2025-03-13 22:29:22,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 408 flow [2025-03-13 22:29:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-03-13 22:29:22,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2025-03-13 22:29:22,227 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 324 flow. Second operand 3 states and 387 transitions. [2025-03-13 22:29:22,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 408 flow [2025-03-13 22:29:22,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 146 transitions, 398 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:22,228 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 370 flow [2025-03-13 22:29:22,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2025-03-13 22:29:22,230 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places. [2025-03-13 22:29:22,230 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 370 flow [2025-03-13 22:29:22,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:22,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:22,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:22,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:29:22,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:22,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash -841010396, now seen corresponding path program 1 times [2025-03-13 22:29:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758930009] [2025-03-13 22:29:22,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:22,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:29:22,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:29:22,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:22,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:22,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758930009] [2025-03-13 22:29:22,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758930009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:22,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:22,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:22,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166635415] [2025-03-13 22:29:22,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:22,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:22,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:22,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:22,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 137 [2025-03-13 22:29:22,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:22,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:22,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 137 [2025-03-13 22:29:22,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:22,784 INFO L124 PetriNetUnfolderBase]: 463/2595 cut-off events. [2025-03-13 22:29:22,784 INFO L125 PetriNetUnfolderBase]: For 408/466 co-relation queries the response was YES. [2025-03-13 22:29:22,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 2595 events. 463/2595 cut-off events. For 408/466 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 22427 event pairs, 251 based on Foata normal form. 3/2378 useless extension candidates. Maximal degree in co-relation 3254. Up to 490 conditions per place. [2025-03-13 22:29:22,797 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 43 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-03-13 22:29:22,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 494 flow [2025-03-13 22:29:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2025-03-13 22:29:22,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.805352798053528 [2025-03-13 22:29:22,799 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 370 flow. Second operand 6 states and 662 transitions. [2025-03-13 22:29:22,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 494 flow [2025-03-13 22:29:22,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:22,803 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 362 flow [2025-03-13 22:29:22,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2025-03-13 22:29:22,803 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-03-13 22:29:22,803 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 362 flow [2025-03-13 22:29:22,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:22,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:22,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:22,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:29:22,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:22,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash -985564059, now seen corresponding path program 1 times [2025-03-13 22:29:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:22,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235439751] [2025-03-13 22:29:22,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:22,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:22,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:29:22,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:29:22,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:22,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:29:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235439751] [2025-03-13 22:29:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235439751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:22,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 22:29:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927497687] [2025-03-13 22:29:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:22,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:22,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:22,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:22,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2025-03-13 22:29:22,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:22,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:22,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2025-03-13 22:29:22,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:23,076 INFO L124 PetriNetUnfolderBase]: 145/1371 cut-off events. [2025-03-13 22:29:23,076 INFO L125 PetriNetUnfolderBase]: For 142/170 co-relation queries the response was YES. [2025-03-13 22:29:23,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 1371 events. 145/1371 cut-off events. For 142/170 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 9261 event pairs, 75 based on Foata normal form. 15/1306 useless extension candidates. Maximal degree in co-relation 1061. Up to 195 conditions per place. [2025-03-13 22:29:23,082 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 26 selfloop transitions, 6 changer transitions 3/153 dead transitions. [2025-03-13 22:29:23,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 462 flow [2025-03-13 22:29:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2025-03-13 22:29:23,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905109489051095 [2025-03-13 22:29:23,084 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 362 flow. Second operand 6 states and 732 transitions. [2025-03-13 22:29:23,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 462 flow [2025-03-13 22:29:23,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:23,086 INFO L231 Difference]: Finished difference. Result has 147 places, 141 transitions, 372 flow [2025-03-13 22:29:23,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=147, PETRI_TRANSITIONS=141} [2025-03-13 22:29:23,088 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-03-13 22:29:23,088 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 141 transitions, 372 flow [2025-03-13 22:29:23,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:23,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:23,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:23,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:29:23,088 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:23,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1531446150, now seen corresponding path program 1 times [2025-03-13 22:29:23,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:23,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759662559] [2025-03-13 22:29:23,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:23,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:29:23,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:29:23,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:23,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:29:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759662559] [2025-03-13 22:29:23,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759662559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:23,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:23,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:23,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327291724] [2025-03-13 22:29:23,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:23,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:23,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:23,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:23,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:23,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2025-03-13 22:29:23,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 141 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:23,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:23,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2025-03-13 22:29:23,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:23,598 INFO L124 PetriNetUnfolderBase]: 329/1886 cut-off events. [2025-03-13 22:29:23,598 INFO L125 PetriNetUnfolderBase]: For 141/176 co-relation queries the response was YES. [2025-03-13 22:29:23,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 1886 events. 329/1886 cut-off events. For 141/176 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14535 event pairs, 186 based on Foata normal form. 0/1757 useless extension candidates. Maximal degree in co-relation 2181. Up to 364 conditions per place. [2025-03-13 22:29:23,607 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 36 selfloop transitions, 5 changer transitions 1/156 dead transitions. [2025-03-13 22:29:23,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 484 flow [2025-03-13 22:29:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2025-03-13 22:29:23,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2025-03-13 22:29:23,609 INFO L175 Difference]: Start difference. First operand has 147 places, 141 transitions, 372 flow. Second operand 6 states and 702 transitions. [2025-03-13 22:29:23,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 484 flow [2025-03-13 22:29:23,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:29:23,613 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 368 flow [2025-03-13 22:29:23,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2025-03-13 22:29:23,614 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-03-13 22:29:23,614 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 368 flow [2025-03-13 22:29:23,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:23,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:23,615 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-13 22:29:23,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:29:23,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:23,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash 568969079, now seen corresponding path program 1 times [2025-03-13 22:29:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:23,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858074799] [2025-03-13 22:29:23,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:23,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:23,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-13 22:29:23,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-13 22:29:23,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:23,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:29:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:23,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858074799] [2025-03-13 22:29:23,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858074799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:23,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:23,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473768118] [2025-03-13 22:29:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:23,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:23,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:23,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:23,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2025-03-13 22:29:23,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:23,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:23,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2025-03-13 22:29:23,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:23,728 INFO L124 PetriNetUnfolderBase]: 56/879 cut-off events. [2025-03-13 22:29:23,729 INFO L125 PetriNetUnfolderBase]: For 231/459 co-relation queries the response was YES. [2025-03-13 22:29:23,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 879 events. 56/879 cut-off events. For 231/459 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5322 event pairs, 30 based on Foata normal form. 2/855 useless extension candidates. Maximal degree in co-relation 1138. Up to 119 conditions per place. [2025-03-13 22:29:23,734 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 7 changer transitions 1/146 dead transitions. [2025-03-13 22:29:23,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 445 flow [2025-03-13 22:29:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-03-13 22:29:23,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391727493917275 [2025-03-13 22:29:23,736 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 368 flow. Second operand 3 states and 386 transitions. [2025-03-13 22:29:23,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 445 flow [2025-03-13 22:29:23,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 435 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:23,738 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 408 flow [2025-03-13 22:29:23,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-03-13 22:29:23,741 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-03-13 22:29:23,741 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 408 flow [2025-03-13 22:29:23,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:23,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:23,741 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:23,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:29:23,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:23,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1040538817, now seen corresponding path program 1 times [2025-03-13 22:29:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:23,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783920626] [2025-03-13 22:29:23,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:23,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:29:23,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:29:23,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:23,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:29:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:23,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783920626] [2025-03-13 22:29:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783920626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:23,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:29:23,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473229130] [2025-03-13 22:29:23,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:23,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:23,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:23,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:23,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:23,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 137 [2025-03-13 22:29:23,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:23,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:23,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 137 [2025-03-13 22:29:23,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:23,883 INFO L124 PetriNetUnfolderBase]: 12/474 cut-off events. [2025-03-13 22:29:23,883 INFO L125 PetriNetUnfolderBase]: For 119/146 co-relation queries the response was YES. [2025-03-13 22:29:23,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 474 events. 12/474 cut-off events. For 119/146 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1852 event pairs, 5 based on Foata normal form. 4/472 useless extension candidates. Maximal degree in co-relation 510. Up to 25 conditions per place. [2025-03-13 22:29:23,884 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 8 selfloop transitions, 4 changer transitions 4/143 dead transitions. [2025-03-13 22:29:23,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 429 flow [2025-03-13 22:29:23,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-13 22:29:23,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2025-03-13 22:29:23,886 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 408 flow. Second operand 3 states and 395 transitions. [2025-03-13 22:29:23,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 429 flow [2025-03-13 22:29:23,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 417 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:23,889 INFO L231 Difference]: Finished difference. Result has 147 places, 136 transitions, 368 flow [2025-03-13 22:29:23,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=147, PETRI_TRANSITIONS=136} [2025-03-13 22:29:23,890 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-03-13 22:29:23,890 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 136 transitions, 368 flow [2025-03-13 22:29:23,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:23,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:23,891 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-13 22:29:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:29:23,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:29:23,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash 343188605, now seen corresponding path program 1 times [2025-03-13 22:29:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:23,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855802646] [2025-03-13 22:29:23,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:23,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-13 22:29:23,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-13 22:29:23,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:23,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:23,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:29:23,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-13 22:29:23,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-13 22:29:23,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:23,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:23,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:29:23,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:29:23,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 22:29:23,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 22:29:23,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:29:23,969 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:23,970 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:29:23,970 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:29:23,992 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:29:23,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 155 transitions, 337 flow [2025-03-13 22:29:24,035 INFO L124 PetriNetUnfolderBase]: 9/515 cut-off events. [2025-03-13 22:29:24,035 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 22:29:24,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 515 events. 9/515 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1345 event pairs, 1 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 309. Up to 12 conditions per place. [2025-03-13 22:29:24,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 155 transitions, 337 flow [2025-03-13 22:29:24,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 155 transitions, 337 flow [2025-03-13 22:29:24,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:29:24,041 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;@6ffe6173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:29:24,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-13 22:29:24,046 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:29:24,046 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-13 22:29:24,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:29:24,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:24,047 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] [2025-03-13 22:29:24,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:24,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:24,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1055560476, now seen corresponding path program 1 times [2025-03-13 22:29:24,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:24,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579093806] [2025-03-13 22:29:24,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:24,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:29:24,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:29:24,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:24,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579093806] [2025-03-13 22:29:24,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579093806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:24,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607311550] [2025-03-13 22:29:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:24,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:24,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:24,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:24,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 155 [2025-03-13 22:29:24,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:24,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:24,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 155 [2025-03-13 22:29:24,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:24,469 INFO L124 PetriNetUnfolderBase]: 1071/4747 cut-off events. [2025-03-13 22:29:24,469 INFO L125 PetriNetUnfolderBase]: For 439/826 co-relation queries the response was YES. [2025-03-13 22:29:24,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 4747 events. 1071/4747 cut-off events. For 439/826 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 41988 event pairs, 542 based on Foata normal form. 1/4219 useless extension candidates. Maximal degree in co-relation 5220. Up to 1110 conditions per place. [2025-03-13 22:29:24,483 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 23 selfloop transitions, 5 changer transitions 1/164 dead transitions. [2025-03-13 22:29:24,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 411 flow [2025-03-13 22:29:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-03-13 22:29:24,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419354838709677 [2025-03-13 22:29:24,484 INFO L175 Difference]: Start difference. First operand has 158 places, 155 transitions, 337 flow. Second operand 3 states and 438 transitions. [2025-03-13 22:29:24,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 411 flow [2025-03-13 22:29:24,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:24,486 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 371 flow [2025-03-13 22:29:24,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-03-13 22:29:24,486 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 4 predicate places. [2025-03-13 22:29:24,487 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 371 flow [2025-03-13 22:29:24,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:24,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:24,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:24,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:29:24,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:24,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash 404206120, now seen corresponding path program 1 times [2025-03-13 22:29:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:24,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201897381] [2025-03-13 22:29:24,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:24,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:29:24,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:29:24,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:24,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201897381] [2025-03-13 22:29:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201897381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096940988] [2025-03-13 22:29:24,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:24,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:29:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:24,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:29:24,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:29:24,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 155 [2025-03-13 22:29:24,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:24,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:24,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 155 [2025-03-13 22:29:24,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:25,077 INFO L124 PetriNetUnfolderBase]: 1404/6861 cut-off events. [2025-03-13 22:29:25,077 INFO L125 PetriNetUnfolderBase]: For 440/455 co-relation queries the response was YES. [2025-03-13 22:29:25,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9759 conditions, 6861 events. 1404/6861 cut-off events. For 440/455 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 66692 event pairs, 1086 based on Foata normal form. 1/6146 useless extension candidates. Maximal degree in co-relation 6125. Up to 1847 conditions per place. [2025-03-13 22:29:25,102 INFO L140 encePairwiseOnDemand]: 147/155 looper letters, 24 selfloop transitions, 2 changer transitions 5/165 dead transitions. [2025-03-13 22:29:25,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 165 transitions, 449 flow [2025-03-13 22:29:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2025-03-13 22:29:25,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8795698924731182 [2025-03-13 22:29:25,104 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 371 flow. Second operand 6 states and 818 transitions. [2025-03-13 22:29:25,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 165 transitions, 449 flow [2025-03-13 22:29:25,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 165 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:25,108 INFO L231 Difference]: Finished difference. Result has 168 places, 158 transitions, 383 flow [2025-03-13 22:29:25,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=168, PETRI_TRANSITIONS=158} [2025-03-13 22:29:25,108 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 10 predicate places. [2025-03-13 22:29:25,108 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 383 flow [2025-03-13 22:29:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:25,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:25,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:25,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:29:25,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:25,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1808898152, now seen corresponding path program 1 times [2025-03-13 22:29:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:25,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915133767] [2025-03-13 22:29:25,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:25,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:29:25,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:29:25,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:25,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915133767] [2025-03-13 22:29:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915133767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987876567] [2025-03-13 22:29:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:25,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:25,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:25,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:25,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 155 [2025-03-13 22:29:25,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 158 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:25,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:25,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 155 [2025-03-13 22:29:25,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:26,429 INFO L124 PetriNetUnfolderBase]: 3152/13178 cut-off events. [2025-03-13 22:29:26,430 INFO L125 PetriNetUnfolderBase]: For 507/508 co-relation queries the response was YES. [2025-03-13 22:29:26,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19322 conditions, 13178 events. 3152/13178 cut-off events. For 507/508 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 142701 event pairs, 2465 based on Foata normal form. 0/11518 useless extension candidates. Maximal degree in co-relation 19209. Up to 3699 conditions per place. [2025-03-13 22:29:26,498 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 61 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2025-03-13 22:29:26,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 561 flow [2025-03-13 22:29:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2025-03-13 22:29:26,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7935483870967742 [2025-03-13 22:29:26,500 INFO L175 Difference]: Start difference. First operand has 168 places, 158 transitions, 383 flow. Second operand 6 states and 738 transitions. [2025-03-13 22:29:26,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 561 flow [2025-03-13 22:29:26,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 181 transitions, 549 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:29:26,505 INFO L231 Difference]: Finished difference. Result has 165 places, 157 transitions, 379 flow [2025-03-13 22:29:26,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=165, PETRI_TRANSITIONS=157} [2025-03-13 22:29:26,506 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 7 predicate places. [2025-03-13 22:29:26,506 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 157 transitions, 379 flow [2025-03-13 22:29:26,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:26,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:26,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:26,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:29:26,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:26,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:26,507 INFO L85 PathProgramCache]: Analyzing trace with hash -986437316, now seen corresponding path program 1 times [2025-03-13 22:29:26,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924785298] [2025-03-13 22:29:26,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:26,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:29:26,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:29:26,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:26,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:26,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924785298] [2025-03-13 22:29:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924785298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:26,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:26,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:26,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387765126] [2025-03-13 22:29:26,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:26,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:26,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:26,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:26,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 155 [2025-03-13 22:29:26,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 157 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:26,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:26,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 155 [2025-03-13 22:29:26,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:27,688 INFO L124 PetriNetUnfolderBase]: 3180/13177 cut-off events. [2025-03-13 22:29:27,688 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-03-13 22:29:27,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19214 conditions, 13177 events. 3180/13177 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 143024 event pairs, 1609 based on Foata normal form. 0/11456 useless extension candidates. Maximal degree in co-relation 12505. Up to 3627 conditions per place. [2025-03-13 22:29:27,735 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 58 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-03-13 22:29:27,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 551 flow [2025-03-13 22:29:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2025-03-13 22:29:27,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8043010752688172 [2025-03-13 22:29:27,737 INFO L175 Difference]: Start difference. First operand has 165 places, 157 transitions, 379 flow. Second operand 6 states and 748 transitions. [2025-03-13 22:29:27,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 551 flow [2025-03-13 22:29:27,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 541 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:27,741 INFO L231 Difference]: Finished difference. Result has 164 places, 156 transitions, 377 flow [2025-03-13 22:29:27,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=164, PETRI_TRANSITIONS=156} [2025-03-13 22:29:27,741 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2025-03-13 22:29:27,742 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 156 transitions, 377 flow [2025-03-13 22:29:27,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:27,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:27,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:27,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:29:27,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:27,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1152247121, now seen corresponding path program 1 times [2025-03-13 22:29:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:27,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597844098] [2025-03-13 22:29:27,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:27,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:27,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:29:27,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:29:27,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:27,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597844098] [2025-03-13 22:29:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597844098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:27,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051525888] [2025-03-13 22:29:27,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:27,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:27,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:27,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:27,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-03-13 22:29:27,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 156 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:27,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:27,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-03-13 22:29:27,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:28,346 INFO L124 PetriNetUnfolderBase]: 1743/7668 cut-off events. [2025-03-13 22:29:28,346 INFO L125 PetriNetUnfolderBase]: For 1543/2997 co-relation queries the response was YES. [2025-03-13 22:29:28,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11998 conditions, 7668 events. 1743/7668 cut-off events. For 1543/2997 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 78515 event pairs, 967 based on Foata normal form. 9/6727 useless extension candidates. Maximal degree in co-relation 10027. Up to 2242 conditions per place. [2025-03-13 22:29:28,374 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 29 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2025-03-13 22:29:28,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 511 flow [2025-03-13 22:29:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2025-03-13 22:29:28,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376344086021505 [2025-03-13 22:29:28,375 INFO L175 Difference]: Start difference. First operand has 164 places, 156 transitions, 377 flow. Second operand 3 states and 436 transitions. [2025-03-13 22:29:28,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 511 flow [2025-03-13 22:29:28,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 171 transitions, 501 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:28,378 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 443 flow [2025-03-13 22:29:28,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=163, PETRI_TRANSITIONS=163} [2025-03-13 22:29:28,379 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 5 predicate places. [2025-03-13 22:29:28,379 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 443 flow [2025-03-13 22:29:28,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:28,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:28,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:28,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:29:28,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 284354991, now seen corresponding path program 1 times [2025-03-13 22:29:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859981380] [2025-03-13 22:29:28,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:28,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:29:28,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:29:28,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:28,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:28,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:28,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859981380] [2025-03-13 22:29:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859981380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:28,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:28,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038562418] [2025-03-13 22:29:28,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:28,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:28,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:28,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:28,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 155 [2025-03-13 22:29:28,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:28,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:28,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 155 [2025-03-13 22:29:28,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:29,978 INFO L124 PetriNetUnfolderBase]: 3779/14522 cut-off events. [2025-03-13 22:29:29,978 INFO L125 PetriNetUnfolderBase]: For 2116/2667 co-relation queries the response was YES. [2025-03-13 22:29:30,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23789 conditions, 14522 events. 3779/14522 cut-off events. For 2116/2667 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 163663 event pairs, 1889 based on Foata normal form. 17/12972 useless extension candidates. Maximal degree in co-relation 18569. Up to 2793 conditions per place. [2025-03-13 22:29:30,073 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 55 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-03-13 22:29:30,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 185 transitions, 607 flow [2025-03-13 22:29:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2025-03-13 22:29:30,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8150537634408602 [2025-03-13 22:29:30,075 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 443 flow. Second operand 6 states and 758 transitions. [2025-03-13 22:29:30,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 185 transitions, 607 flow [2025-03-13 22:29:30,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 185 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:30,087 INFO L231 Difference]: Finished difference. Result has 164 places, 161 transitions, 431 flow [2025-03-13 22:29:30,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=164, PETRI_TRANSITIONS=161} [2025-03-13 22:29:30,087 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2025-03-13 22:29:30,087 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 161 transitions, 431 flow [2025-03-13 22:29:30,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:30,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:30,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:29:30,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:30,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash 640876784, now seen corresponding path program 1 times [2025-03-13 22:29:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779120518] [2025-03-13 22:29:30,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:30,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:30,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:29:30,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:29:30,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:30,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:29:30,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779120518] [2025-03-13 22:29:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779120518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:30,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:30,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 22:29:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362651369] [2025-03-13 22:29:30,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:30,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:30,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:30,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:30,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 155 [2025-03-13 22:29:30,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 161 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:30,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:30,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 155 [2025-03-13 22:29:30,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:30,926 INFO L124 PetriNetUnfolderBase]: 1302/7697 cut-off events. [2025-03-13 22:29:30,926 INFO L125 PetriNetUnfolderBase]: For 964/1221 co-relation queries the response was YES. [2025-03-13 22:29:30,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11596 conditions, 7697 events. 1302/7697 cut-off events. For 964/1221 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 79478 event pairs, 530 based on Foata normal form. 65/7066 useless extension candidates. Maximal degree in co-relation 5585. Up to 1223 conditions per place. [2025-03-13 22:29:30,952 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 38 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2025-03-13 22:29:30,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 568 flow [2025-03-13 22:29:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2025-03-13 22:29:30,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870967741935484 [2025-03-13 22:29:30,953 INFO L175 Difference]: Start difference. First operand has 164 places, 161 transitions, 431 flow. Second operand 6 states and 825 transitions. [2025-03-13 22:29:30,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 568 flow [2025-03-13 22:29:30,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:30,957 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 447 flow [2025-03-13 22:29:30,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2025-03-13 22:29:30,958 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-03-13 22:29:30,958 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 447 flow [2025-03-13 22:29:30,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:30,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:30,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:30,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:29:30,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:30,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:30,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1015912433, now seen corresponding path program 1 times [2025-03-13 22:29:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:30,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013547080] [2025-03-13 22:29:30,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:30,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:29:30,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:29:30,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:30,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:29:31,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:31,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013547080] [2025-03-13 22:29:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013547080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550427204] [2025-03-13 22:29:31,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:31,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:31,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:31,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:31,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:31,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 155 [2025-03-13 22:29:31,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:31,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:31,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 155 [2025-03-13 22:29:31,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:31,943 INFO L124 PetriNetUnfolderBase]: 2701/10581 cut-off events. [2025-03-13 22:29:31,943 INFO L125 PetriNetUnfolderBase]: For 982/1400 co-relation queries the response was YES. [2025-03-13 22:29:31,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17027 conditions, 10581 events. 2701/10581 cut-off events. For 982/1400 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 112748 event pairs, 1410 based on Foata normal form. 11/9539 useless extension candidates. Maximal degree in co-relation 12583. Up to 2113 conditions per place. [2025-03-13 22:29:31,995 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 48 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2025-03-13 22:29:31,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 186 transitions, 599 flow [2025-03-13 22:29:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2025-03-13 22:29:31,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8580645161290322 [2025-03-13 22:29:31,996 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 447 flow. Second operand 6 states and 798 transitions. [2025-03-13 22:29:31,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 186 transitions, 599 flow [2025-03-13 22:29:31,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 186 transitions, 591 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:29:31,999 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 447 flow [2025-03-13 22:29:31,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2025-03-13 22:29:31,999 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 9 predicate places. [2025-03-13 22:29:31,999 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 447 flow [2025-03-13 22:29:31,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:31,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:32,000 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-13 22:29:32,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:29:32,000 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:32,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash -599120233, now seen corresponding path program 1 times [2025-03-13 22:29:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972506467] [2025-03-13 22:29:32,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:32,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-13 22:29:32,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-13 22:29:32,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:29:32,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972506467] [2025-03-13 22:29:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972506467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:32,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:32,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:32,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108144310] [2025-03-13 22:29:32,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:32,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:32,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:32,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:32,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:32,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-03-13 22:29:32,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:32,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:32,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-03-13 22:29:32,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:32,556 INFO L124 PetriNetUnfolderBase]: 1086/6184 cut-off events. [2025-03-13 22:29:32,556 INFO L125 PetriNetUnfolderBase]: For 2452/4123 co-relation queries the response was YES. [2025-03-13 22:29:32,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 6184 events. 1086/6184 cut-off events. For 2452/4123 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 65888 event pairs, 589 based on Foata normal form. 13/5734 useless extension candidates. Maximal degree in co-relation 9427. Up to 1450 conditions per place. [2025-03-13 22:29:32,583 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 31 selfloop transitions, 13 changer transitions 0/178 dead transitions. [2025-03-13 22:29:32,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 178 transitions, 608 flow [2025-03-13 22:29:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2025-03-13 22:29:32,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-03-13 22:29:32,584 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 447 flow. Second operand 3 states and 435 transitions. [2025-03-13 22:29:32,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 178 transitions, 608 flow [2025-03-13 22:29:32,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 178 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:32,587 INFO L231 Difference]: Finished difference. Result has 166 places, 171 transitions, 555 flow [2025-03-13 22:29:32,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=166, PETRI_TRANSITIONS=171} [2025-03-13 22:29:32,589 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-03-13 22:29:32,589 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 171 transitions, 555 flow [2025-03-13 22:29:32,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:32,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:32,589 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:32,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:29:32,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:32,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:32,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1611320021, now seen corresponding path program 1 times [2025-03-13 22:29:32,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491646598] [2025-03-13 22:29:32,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:32,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:29:32,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:29:32,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:32,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:29:32,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491646598] [2025-03-13 22:29:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491646598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:32,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:32,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:29:32,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851183116] [2025-03-13 22:29:32,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:32,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:32,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:32,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:32,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 155 [2025-03-13 22:29:32,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 171 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:32,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:32,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 155 [2025-03-13 22:29:32,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:32,815 INFO L124 PetriNetUnfolderBase]: 124/2155 cut-off events. [2025-03-13 22:29:32,815 INFO L125 PetriNetUnfolderBase]: For 705/828 co-relation queries the response was YES. [2025-03-13 22:29:32,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 2155 events. 124/2155 cut-off events. For 705/828 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17096 event pairs, 20 based on Foata normal form. 26/2104 useless extension candidates. Maximal degree in co-relation 1243. Up to 142 conditions per place. [2025-03-13 22:29:32,823 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 12 selfloop transitions, 6 changer transitions 0/166 dead transitions. [2025-03-13 22:29:32,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 528 flow [2025-03-13 22:29:32,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-03-13 22:29:32,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548387096774194 [2025-03-13 22:29:32,824 INFO L175 Difference]: Start difference. First operand has 166 places, 171 transitions, 555 flow. Second operand 3 states and 444 transitions. [2025-03-13 22:29:32,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 528 flow [2025-03-13 22:29:32,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 166 transitions, 514 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:32,828 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 459 flow [2025-03-13 22:29:32,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-03-13 22:29:32,828 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-03-13 22:29:32,828 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 459 flow [2025-03-13 22:29:32,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:32,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:32,829 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-13 22:29:32,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:29:32,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:32,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1518124718, now seen corresponding path program 1 times [2025-03-13 22:29:32,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:32,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800189888] [2025-03-13 22:29:32,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:32,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-13 22:29:32,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:29:32,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:32,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-13 22:29:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800189888] [2025-03-13 22:29:32,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800189888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:32,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:32,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:32,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532380352] [2025-03-13 22:29:32,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:32,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:32,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:32,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:32,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:32,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-03-13 22:29:32,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:32,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:32,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-03-13 22:29:32,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:33,041 INFO L124 PetriNetUnfolderBase]: 203/2144 cut-off events. [2025-03-13 22:29:33,042 INFO L125 PetriNetUnfolderBase]: For 1365/1860 co-relation queries the response was YES. [2025-03-13 22:29:33,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3710 conditions, 2144 events. 203/2144 cut-off events. For 1365/1860 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17686 event pairs, 134 based on Foata normal form. 3/1995 useless extension candidates. Maximal degree in co-relation 3042. Up to 435 conditions per place. [2025-03-13 22:29:33,049 INFO L140 encePairwiseOnDemand]: 150/155 looper letters, 25 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-03-13 22:29:33,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 541 flow [2025-03-13 22:29:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2025-03-13 22:29:33,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204301075268817 [2025-03-13 22:29:33,050 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 459 flow. Second operand 3 states and 428 transitions. [2025-03-13 22:29:33,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 541 flow [2025-03-13 22:29:33,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:29:33,052 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 493 flow [2025-03-13 22:29:33,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=169, PETRI_TRANSITIONS=164} [2025-03-13 22:29:33,053 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 11 predicate places. [2025-03-13 22:29:33,053 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 493 flow [2025-03-13 22:29:33,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:33,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:33,054 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-13 22:29:33,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:29:33,054 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:29:33,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash 129004564, now seen corresponding path program 1 times [2025-03-13 22:29:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:33,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923345634] [2025-03-13 22:29:33,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:33,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-13 22:29:33,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-13 22:29:33,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:33,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:33,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:29:33,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-13 22:29:33,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-13 22:29:33,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:33,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:33,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:29:33,126 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:29:33,126 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-13 22:29:33,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-13 22:29:33,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-13 22:29:33,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-13 22:29:33,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-13 22:29:33,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-13 22:29:33,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-13 22:29:33,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-13 22:29:33,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-13 22:29:33,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-13 22:29:33,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-13 22:29:33,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:29:33,127 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:33,128 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:29:33,128 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 22:29:33,143 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 22:29:33,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 173 transitions, 386 flow [2025-03-13 22:29:33,197 INFO L124 PetriNetUnfolderBase]: 22/897 cut-off events. [2025-03-13 22:29:33,198 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-13 22:29:33,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 897 events. 22/897 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3098 event pairs, 6 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 535. Up to 32 conditions per place. [2025-03-13 22:29:33,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 173 transitions, 386 flow [2025-03-13 22:29:33,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 173 transitions, 386 flow [2025-03-13 22:29:33,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:29:33,204 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;@6ffe6173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:29:33,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:29:33,206 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:29:33,206 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-13 22:29:33,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:29:33,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:33,206 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] [2025-03-13 22:29:33,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:29:33,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:33,207 INFO L85 PathProgramCache]: Analyzing trace with hash 554746556, now seen corresponding path program 1 times [2025-03-13 22:29:33,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:33,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509827770] [2025-03-13 22:29:33,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:33,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:33,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:29:33,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:29:33,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:33,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:33,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:33,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509827770] [2025-03-13 22:29:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509827770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:33,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:33,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:33,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740008551] [2025-03-13 22:29:33,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:33,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:33,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:33,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:33,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:33,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 173 [2025-03-13 22:29:33,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 173 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:33,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:33,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 173 [2025-03-13 22:29:33,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:35,472 INFO L124 PetriNetUnfolderBase]: 7859/26538 cut-off events. [2025-03-13 22:29:35,473 INFO L125 PetriNetUnfolderBase]: For 2850/5575 co-relation queries the response was YES. [2025-03-13 22:29:35,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38888 conditions, 26538 events. 7859/26538 cut-off events. For 2850/5575 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 305897 event pairs, 4292 based on Foata normal form. 1/23810 useless extension candidates. Maximal degree in co-relation 30851. Up to 7653 conditions per place. [2025-03-13 22:29:35,611 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 30 selfloop transitions, 6 changer transitions 1/185 dead transitions. [2025-03-13 22:29:35,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 482 flow [2025-03-13 22:29:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-13 22:29:35,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344894026974951 [2025-03-13 22:29:35,612 INFO L175 Difference]: Start difference. First operand has 177 places, 173 transitions, 386 flow. Second operand 3 states and 485 transitions. [2025-03-13 22:29:35,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 482 flow [2025-03-13 22:29:35,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:35,617 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 428 flow [2025-03-13 22:29:35,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2025-03-13 22:29:35,617 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 4 predicate places. [2025-03-13 22:29:35,617 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 428 flow [2025-03-13 22:29:35,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:35,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:35,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:35,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 22:29:35,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:29:35,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash 158371688, now seen corresponding path program 1 times [2025-03-13 22:29:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732061265] [2025-03-13 22:29:35,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:35,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:29:35,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:29:35,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:35,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:35,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-13 22:29:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732061265] [2025-03-13 22:29:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732061265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519813514] [2025-03-13 22:29:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:35,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:29:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:35,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:29:35,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:29:35,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2025-03-13 22:29:35,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:35,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:35,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2025-03-13 22:29:35,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:39,010 INFO L124 PetriNetUnfolderBase]: 9343/35816 cut-off events. [2025-03-13 22:29:39,010 INFO L125 PetriNetUnfolderBase]: For 2632/2756 co-relation queries the response was YES. [2025-03-13 22:29:39,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52733 conditions, 35816 events. 9343/35816 cut-off events. For 2632/2756 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 443793 event pairs, 7523 based on Foata normal form. 1/31567 useless extension candidates. Maximal degree in co-relation 32440. Up to 10778 conditions per place. [2025-03-13 22:29:39,234 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 28 selfloop transitions, 2 changer transitions 5/184 dead transitions. [2025-03-13 22:29:39,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 514 flow [2025-03-13 22:29:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions. [2025-03-13 22:29:39,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8728323699421965 [2025-03-13 22:29:39,235 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 428 flow. Second operand 6 states and 906 transitions. [2025-03-13 22:29:39,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 514 flow [2025-03-13 22:29:39,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 184 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:39,271 INFO L231 Difference]: Finished difference. Result has 187 places, 177 transitions, 438 flow [2025-03-13 22:29:39,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=187, PETRI_TRANSITIONS=177} [2025-03-13 22:29:39,272 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 10 predicate places. [2025-03-13 22:29:39,272 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 177 transitions, 438 flow [2025-03-13 22:29:39,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:39,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:39,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:39,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 22:29:39,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:29:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1517001771, now seen corresponding path program 1 times [2025-03-13 22:29:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:39,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185071940] [2025-03-13 22:29:39,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:39,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:29:39,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:29:39,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:39,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185071940] [2025-03-13 22:29:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185071940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479378643] [2025-03-13 22:29:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:39,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:39,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:39,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 173 [2025-03-13 22:29:39,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 177 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:39,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:39,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 173 [2025-03-13 22:29:39,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:46,558 INFO L124 PetriNetUnfolderBase]: 20475/70474 cut-off events. [2025-03-13 22:29:46,558 INFO L125 PetriNetUnfolderBase]: For 2766/2782 co-relation queries the response was YES. [2025-03-13 22:29:46,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105344 conditions, 70474 events. 20475/70474 cut-off events. For 2766/2782 co-relation queries the response was YES. Maximal size of possible extension queue 1691. Compared 937870 event pairs, 16494 based on Foata normal form. 0/60691 useless extension candidates. Maximal degree in co-relation 105230. Up to 21481 conditions per place. [2025-03-13 22:29:47,062 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 73 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2025-03-13 22:29:47,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 208 transitions, 656 flow [2025-03-13 22:29:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2025-03-13 22:29:47,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8034682080924855 [2025-03-13 22:29:47,064 INFO L175 Difference]: Start difference. First operand has 187 places, 177 transitions, 438 flow. Second operand 6 states and 834 transitions. [2025-03-13 22:29:47,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 208 transitions, 656 flow [2025-03-13 22:29:47,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 208 transitions, 644 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:29:47,109 INFO L231 Difference]: Finished difference. Result has 184 places, 176 transitions, 434 flow [2025-03-13 22:29:47,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=184, PETRI_TRANSITIONS=176} [2025-03-13 22:29:47,109 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 7 predicate places. [2025-03-13 22:29:47,109 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 176 transitions, 434 flow [2025-03-13 22:29:47,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:47,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:47,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:47,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 22:29:47,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:29:47,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:47,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1598336137, now seen corresponding path program 1 times [2025-03-13 22:29:47,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:47,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488132250] [2025-03-13 22:29:47,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:47,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:29:47,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:29:47,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:47,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488132250] [2025-03-13 22:29:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488132250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:47,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:47,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:47,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182315161] [2025-03-13 22:29:47,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:47,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:47,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:47,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:47,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 173 [2025-03-13 22:29:47,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 176 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:47,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:47,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 173 [2025-03-13 22:29:47,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:52,856 INFO L124 PetriNetUnfolderBase]: 21685/51607 cut-off events. [2025-03-13 22:29:52,856 INFO L125 PetriNetUnfolderBase]: For 2346/2346 co-relation queries the response was YES. [2025-03-13 22:29:53,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86514 conditions, 51607 events. 21685/51607 cut-off events. For 2346/2346 co-relation queries the response was YES. Maximal size of possible extension queue 1964. Compared 585275 event pairs, 3534 based on Foata normal form. 0/45288 useless extension candidates. Maximal degree in co-relation 15703. Up to 25048 conditions per place. [2025-03-13 22:29:53,249 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 70 selfloop transitions, 5 changer transitions 0/207 dead transitions. [2025-03-13 22:29:53,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 207 transitions, 646 flow [2025-03-13 22:29:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-03-13 22:29:53,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8131021194605009 [2025-03-13 22:29:53,250 INFO L175 Difference]: Start difference. First operand has 184 places, 176 transitions, 434 flow. Second operand 6 states and 844 transitions. [2025-03-13 22:29:53,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 207 transitions, 646 flow [2025-03-13 22:29:53,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 207 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:53,256 INFO L231 Difference]: Finished difference. Result has 183 places, 175 transitions, 432 flow [2025-03-13 22:29:53,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=183, PETRI_TRANSITIONS=175} [2025-03-13 22:29:53,256 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 6 predicate places. [2025-03-13 22:29:53,256 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 175 transitions, 432 flow [2025-03-13 22:29:53,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:53,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:53,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:53,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 22:29:53,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:29:53,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:53,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1425479612, now seen corresponding path program 1 times [2025-03-13 22:29:53,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:53,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224784964] [2025-03-13 22:29:53,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:53,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:29:53,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:29:53,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:53,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:53,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224784964] [2025-03-13 22:29:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224784964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:53,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:53,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785804790] [2025-03-13 22:29:53,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:53,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:53,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:53,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:53,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 173 [2025-03-13 22:29:53,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 175 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:53,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:53,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 173 [2025-03-13 22:29:53,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:58,035 INFO L124 PetriNetUnfolderBase]: 13641/46120 cut-off events. [2025-03-13 22:29:58,035 INFO L125 PetriNetUnfolderBase]: For 11665/23311 co-relation queries the response was YES. [2025-03-13 22:29:58,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75500 conditions, 46120 events. 13641/46120 cut-off events. For 11665/23311 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 590456 event pairs, 7860 based on Foata normal form. 33/40368 useless extension candidates. Maximal degree in co-relation 62457. Up to 15890 conditions per place. [2025-03-13 22:29:58,389 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 39 selfloop transitions, 11 changer transitions 0/196 dead transitions. [2025-03-13 22:29:58,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 196 transitions, 618 flow [2025-03-13 22:29:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-13 22:29:58,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344894026974951 [2025-03-13 22:29:58,390 INFO L175 Difference]: Start difference. First operand has 183 places, 175 transitions, 432 flow. Second operand 3 states and 485 transitions. [2025-03-13 22:29:58,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 196 transitions, 618 flow [2025-03-13 22:29:58,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 196 transitions, 608 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:58,396 INFO L231 Difference]: Finished difference. Result has 182 places, 184 transitions, 518 flow [2025-03-13 22:29:58,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=182, PETRI_TRANSITIONS=184} [2025-03-13 22:29:58,397 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 5 predicate places. [2025-03-13 22:29:58,397 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 184 transitions, 518 flow [2025-03-13 22:29:58,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:58,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:58,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:58,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 22:29:58,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:29:58,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash 760633420, now seen corresponding path program 1 times [2025-03-13 22:29:58,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:58,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123776237] [2025-03-13 22:29:58,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:58,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:58,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:29:58,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:29:58,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:58,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123776237] [2025-03-13 22:29:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123776237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:58,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:58,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:58,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623310082] [2025-03-13 22:29:58,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:58,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:58,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:58,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:58,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:58,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 173 [2025-03-13 22:29:58,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 184 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:58,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:58,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 173 [2025-03-13 22:29:58,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand