./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-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-?-e2fb8be-m [2025-03-08 22:10:57,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:10:57,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:10:57,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:10:57,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:10:57,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:10:57,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:10:57,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:10:57,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:10:57,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:10:57,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:10:57,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:10:57,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:10:57,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:10:57,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:10:57,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:10:57,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:10:57,645 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:10:57,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:10:57,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:10:57,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:10:57,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:10:57,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:10:57,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:10:57,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:10:57,645 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-08 22:10:57,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:10:57,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:10:57,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:10:57,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:10:57,875 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:10:57,876 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-08 22:10:59,005 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6b945b7/a6a1d039d653441c9e652bbd5b8df750/FLAGbf771831d [2025-03-08 22:10:59,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:10:59,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2025-03-08 22:10:59,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6b945b7/a6a1d039d653441c9e652bbd5b8df750/FLAGbf771831d [2025-03-08 22:10:59,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6b945b7/a6a1d039d653441c9e652bbd5b8df750 [2025-03-08 22:10:59,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:10:59,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:10:59,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:10:59,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:10:59,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:10:59,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bcf7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59, skipping insertion in model container [2025-03-08 22:10:59,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:10:59,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:10:59,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:10:59,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:10:59,667 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:10:59,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59 WrapperNode [2025-03-08 22:10:59,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:10:59,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:10:59,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:10:59,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:10:59,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,706 INFO L138 Inliner]: procedures = 267, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2025-03-08 22:10:59,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:10:59,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:10:59,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:10:59,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:10:59,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:10:59,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:10:59,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:10:59,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:10:59,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (1/1) ... [2025-03-08 22:10:59,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:10:59,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:10:59,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:10:59,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:10:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-08 22:10:59,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-08 22:10:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:10:59,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:10:59,771 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:10:59,868 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:10:59,870 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:11:00,115 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:11:00,115 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:11:00,129 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:11:00,129 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:11:00,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:00 BoogieIcfgContainer [2025-03-08 22:11:00,129 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:11:00,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:11:00,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:11:00,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:11:00,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:10:59" (1/3) ... [2025-03-08 22:11:00,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4518db65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:00, skipping insertion in model container [2025-03-08 22:11:00,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:10:59" (2/3) ... [2025-03-08 22:11:00,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4518db65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:00, skipping insertion in model container [2025-03-08 22:11:00,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:00" (3/3) ... [2025-03-08 22:11:00,139 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.i [2025-03-08 22:11:00,152 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:11:00,154 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-08 22:11:00,155 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:11:00,214 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:11:00,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 119 transitions, 245 flow [2025-03-08 22:11:00,303 INFO L124 PetriNetUnfolderBase]: 2/170 cut-off events. [2025-03-08 22:11:00,307 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:11:00,310 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-08 22:11:00,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 119 transitions, 245 flow [2025-03-08 22:11:00,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 119 transitions, 245 flow [2025-03-08 22:11:00,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:00,335 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;@7e96ed52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:00,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-08 22:11:00,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:00,352 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-08 22:11:00,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:00,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:00,353 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-08 22:11:00,354 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-08 22:11:00,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1727080092, now seen corresponding path program 1 times [2025-03-08 22:11:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:00,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441333350] [2025-03-08 22:11:00,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:00,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:11:00,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:11:00,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:00,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:00,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:00,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441333350] [2025-03-08 22:11:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441333350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786003552] [2025-03-08 22:11:00,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:00,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:00,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:00,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:00,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:00,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 119 [2025-03-08 22:11:00,559 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-08 22:11:00,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:00,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 119 [2025-03-08 22:11:00,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:00,633 INFO L124 PetriNetUnfolderBase]: 8/212 cut-off events. [2025-03-08 22:11:00,634 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-08 22:11:00,634 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-08 22:11:00,637 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 8 selfloop transitions, 3 changer transitions 2/122 dead transitions. [2025-03-08 22:11:00,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 275 flow [2025-03-08 22:11:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-03-08 22:11:00,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635854341736695 [2025-03-08 22:11:00,649 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 245 flow. Second operand 3 states and 344 transitions. [2025-03-08 22:11:00,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 275 flow [2025-03-08 22:11:00,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:00,656 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 263 flow [2025-03-08 22:11:00,658 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-08 22:11:00,660 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-03-08 22:11:00,660 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 263 flow [2025-03-08 22:11:00,660 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-08 22:11:00,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:00,660 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-08 22:11:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:11:00,660 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-08 22:11:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1489453352, now seen corresponding path program 1 times [2025-03-08 22:11:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114971859] [2025-03-08 22:11:00,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:00,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:11:00,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:11:00,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:00,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114971859] [2025-03-08 22:11:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114971859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:00,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:00,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:00,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703767974] [2025-03-08 22:11:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:00,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:11:00,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:00,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:11:00,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:11:00,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 119 [2025-03-08 22:11:00,936 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-08 22:11:00,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:00,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 119 [2025-03-08 22:11:00,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:00,999 INFO L124 PetriNetUnfolderBase]: 17/323 cut-off events. [2025-03-08 22:11:00,999 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 22:11:01,001 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-08 22:11:01,002 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 15 selfloop transitions, 2 changer transitions 5/126 dead transitions. [2025-03-08 22:11:01,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 321 flow [2025-03-08 22:11:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-03-08 22:11:01,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977591036414566 [2025-03-08 22:11:01,007 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 263 flow. Second operand 6 states and 641 transitions. [2025-03-08 22:11:01,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 321 flow [2025-03-08 22:11:01,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:01,012 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 275 flow [2025-03-08 22:11:01,012 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-08 22:11:01,012 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2025-03-08 22:11:01,012 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 275 flow [2025-03-08 22:11:01,013 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-08 22:11:01,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:01,013 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-08 22:11:01,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:11:01,013 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-08 22:11:01,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1091823684, now seen corresponding path program 1 times [2025-03-08 22:11:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060011825] [2025-03-08 22:11:01,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:01,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:11:01,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:11:01,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:01,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060011825] [2025-03-08 22:11:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060011825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:01,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:01,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682334373] [2025-03-08 22:11:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:01,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:01,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:01,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:01,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 119 [2025-03-08 22:11:01,626 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-08 22:11:01,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:01,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 119 [2025-03-08 22:11:01,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:01,684 INFO L124 PetriNetUnfolderBase]: 46/420 cut-off events. [2025-03-08 22:11:01,684 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:11:01,685 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-08 22:11:01,686 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 36 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-03-08 22:11:01,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 126 transitions, 371 flow [2025-03-08 22:11:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2025-03-08 22:11:01,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2025-03-08 22:11:01,703 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 275 flow. Second operand 6 states and 546 transitions. [2025-03-08 22:11:01,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 126 transitions, 371 flow [2025-03-08 22:11:01,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 357 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:01,706 INFO L231 Difference]: Finished difference. Result has 126 places, 118 transitions, 269 flow [2025-03-08 22:11:01,706 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-08 22:11:01,707 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 6 predicate places. [2025-03-08 22:11:01,707 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 118 transitions, 269 flow [2025-03-08 22:11:01,707 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-08 22:11:01,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:01,707 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-08 22:11:01,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:11:01,707 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-08 22:11:01,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1602215832, now seen corresponding path program 1 times [2025-03-08 22:11:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:01,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464231455] [2025-03-08 22:11:01,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:01,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:01,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:11:01,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:11:01,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:01,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:01,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464231455] [2025-03-08 22:11:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464231455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:01,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913922244] [2025-03-08 22:11:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:01,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:01,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:01,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:02,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2025-03-08 22:11:02,066 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-08 22:11:02,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:02,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2025-03-08 22:11:02,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:02,112 INFO L124 PetriNetUnfolderBase]: 46/346 cut-off events. [2025-03-08 22:11:02,112 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:11:02,113 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-08 22:11:02,114 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 34 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2025-03-08 22:11:02,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 125 transitions, 361 flow [2025-03-08 22:11:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2025-03-08 22:11:02,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787114845938375 [2025-03-08 22:11:02,115 INFO L175 Difference]: Start difference. First operand has 126 places, 118 transitions, 269 flow. Second operand 6 states and 556 transitions. [2025-03-08 22:11:02,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 125 transitions, 361 flow [2025-03-08 22:11:02,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 351 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:02,118 INFO L231 Difference]: Finished difference. Result has 125 places, 117 transitions, 267 flow [2025-03-08 22:11:02,119 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-08 22:11:02,120 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-03-08 22:11:02,121 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 117 transitions, 267 flow [2025-03-08 22:11:02,121 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-08 22:11:02,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:02,121 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-08 22:11:02,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:11:02,121 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-08 22:11:02,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:02,122 INFO L85 PathProgramCache]: Analyzing trace with hash -773651573, now seen corresponding path program 1 times [2025-03-08 22:11:02,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:02,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038317022] [2025-03-08 22:11:02,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:02,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:02,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:11:02,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:11:02,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:02,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038317022] [2025-03-08 22:11:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038317022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425090122] [2025-03-08 22:11:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:02,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:02,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:02,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 119 [2025-03-08 22:11:02,172 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-08 22:11:02,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:02,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 119 [2025-03-08 22:11:02,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:02,199 INFO L124 PetriNetUnfolderBase]: 5/216 cut-off events. [2025-03-08 22:11:02,199 INFO L125 PetriNetUnfolderBase]: For 18/31 co-relation queries the response was YES. [2025-03-08 22:11:02,200 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-08 22:11:02,201 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 8 selfloop transitions, 4 changer transitions 3/120 dead transitions. [2025-03-08 22:11:02,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 303 flow [2025-03-08 22:11:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-08 22:11:02,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467787114845938 [2025-03-08 22:11:02,202 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 267 flow. Second operand 3 states and 338 transitions. [2025-03-08 22:11:02,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 303 flow [2025-03-08 22:11:02,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 293 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:02,204 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 279 flow [2025-03-08 22:11:02,204 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-08 22:11:02,205 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-03-08 22:11:02,205 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 279 flow [2025-03-08 22:11:02,205 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-08 22:11:02,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:02,205 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-08 22:11:02,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:11:02,206 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-08 22:11:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1679504555, now seen corresponding path program 1 times [2025-03-08 22:11:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474371259] [2025-03-08 22:11:02,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:02,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:11:02,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:11:02,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:02,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:02,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:02,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474371259] [2025-03-08 22:11:02,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474371259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:02,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:02,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:02,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980926951] [2025-03-08 22:11:02,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:02,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:02,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:02,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:02,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:02,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2025-03-08 22:11:02,714 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-08 22:11:02,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:02,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2025-03-08 22:11:02,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:02,781 INFO L124 PetriNetUnfolderBase]: 33/406 cut-off events. [2025-03-08 22:11:02,781 INFO L125 PetriNetUnfolderBase]: For 66/69 co-relation queries the response was YES. [2025-03-08 22:11:02,782 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-08 22:11:02,783 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 31 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-08 22:11:02,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 363 flow [2025-03-08 22:11:02,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 566 transitions. [2025-03-08 22:11:02,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7927170868347339 [2025-03-08 22:11:02,789 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 279 flow. Second operand 6 states and 566 transitions. [2025-03-08 22:11:02,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 363 flow [2025-03-08 22:11:02,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:02,792 INFO L231 Difference]: Finished difference. Result has 125 places, 115 transitions, 277 flow [2025-03-08 22:11:02,792 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-08 22:11:02,792 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-03-08 22:11:02,792 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 115 transitions, 277 flow [2025-03-08 22:11:02,793 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-08 22:11:02,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:02,793 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-08 22:11:02,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:11:02,793 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-08 22:11:02,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1735450292, now seen corresponding path program 1 times [2025-03-08 22:11:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:02,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267816062] [2025-03-08 22:11:02,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:02,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:11:02,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:11:02,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:02,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:02,920 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-08 22:11:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:02,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267816062] [2025-03-08 22:11:02,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267816062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:02,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:02,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124874371] [2025-03-08 22:11:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:02,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:02,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:02,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:02,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:03,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 119 [2025-03-08 22:11:03,010 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-08 22:11:03,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:03,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 119 [2025-03-08 22:11:03,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:03,062 INFO L124 PetriNetUnfolderBase]: 10/238 cut-off events. [2025-03-08 22:11:03,063 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 22:11:03,063 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-08 22:11:03,064 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 13 selfloop transitions, 5 changer transitions 9/116 dead transitions. [2025-03-08 22:11:03,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 116 transitions, 309 flow [2025-03-08 22:11:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2025-03-08 22:11:03,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8879551820728291 [2025-03-08 22:11:03,066 INFO L175 Difference]: Start difference. First operand has 125 places, 115 transitions, 277 flow. Second operand 6 states and 634 transitions. [2025-03-08 22:11:03,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 116 transitions, 309 flow [2025-03-08 22:11:03,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 285 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-03-08 22:11:03,069 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 231 flow [2025-03-08 22:11:03,069 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-08 22:11:03,071 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-03-08 22:11:03,071 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 231 flow [2025-03-08 22:11:03,071 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-08 22:11:03,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:03,072 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-08 22:11:03,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:11:03,072 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-08 22:11:03,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 781559917, now seen corresponding path program 1 times [2025-03-08 22:11:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429870766] [2025-03-08 22:11:03,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:03,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:11:03,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:11:03,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:03,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:03,363 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-08 22:11:03,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429870766] [2025-03-08 22:11:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429870766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:03,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:03,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571144028] [2025-03-08 22:11:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:03,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:03,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:03,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:03,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2025-03-08 22:11:03,496 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-08 22:11:03,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:03,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2025-03-08 22:11:03,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:03,540 INFO L124 PetriNetUnfolderBase]: 28/299 cut-off events. [2025-03-08 22:11:03,541 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 22:11:03,542 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-08 22:11:03,543 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 12 selfloop transitions, 0 changer transitions 38/110 dead transitions. [2025-03-08 22:11:03,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 301 flow [2025-03-08 22:11:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-03-08 22:11:03,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8473389355742297 [2025-03-08 22:11:03,545 INFO L175 Difference]: Start difference. First operand has 120 places, 103 transitions, 231 flow. Second operand 6 states and 605 transitions. [2025-03-08 22:11:03,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 301 flow [2025-03-08 22:11:03,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 293 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:11:03,547 INFO L231 Difference]: Finished difference. Result has 111 places, 72 transitions, 156 flow [2025-03-08 22:11:03,548 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-08 22:11:03,548 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -9 predicate places. [2025-03-08 22:11:03,549 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 72 transitions, 156 flow [2025-03-08 22:11:03,550 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-08 22:11:03,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:03,550 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-08 22:11:03,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:11:03,550 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-08 22:11:03,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1551377583, now seen corresponding path program 1 times [2025-03-08 22:11:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630406423] [2025-03-08 22:11:03,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 22:11:03,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:11:03,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:03,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:03,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:03,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 22:11:03,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:11:03,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:03,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:03,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:03,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:03,625 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-08 22:11:03,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-08 22:11:03,627 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-08 22:11:03,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-08 22:11:03,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-08 22:11:03,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-08 22:11:03,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-08 22:11:03,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-08 22:11:03,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-08 22:11:03,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:11:03,629 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:03,630 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:03,630 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:11:03,654 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:11:03,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 137 transitions, 290 flow [2025-03-08 22:11:03,677 INFO L124 PetriNetUnfolderBase]: 4/301 cut-off events. [2025-03-08 22:11:03,677 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:11:03,678 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-08 22:11:03,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 137 transitions, 290 flow [2025-03-08 22:11:03,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 137 transitions, 290 flow [2025-03-08 22:11:03,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:03,680 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;@7e96ed52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:03,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-08 22:11:03,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:03,683 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-08 22:11:03,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:03,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:03,683 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-08 22:11:03,683 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-08 22:11:03,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 14682556, now seen corresponding path program 1 times [2025-03-08 22:11:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404071612] [2025-03-08 22:11:03,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:03,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:03,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:11:03,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:11:03,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:03,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404071612] [2025-03-08 22:11:03,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404071612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:03,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:03,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474268959] [2025-03-08 22:11:03,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:03,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:03,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:03,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:03,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:03,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-03-08 22:11:03,715 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-08 22:11:03,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:03,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-03-08 22:11:03,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:03,811 INFO L124 PetriNetUnfolderBase]: 119/878 cut-off events. [2025-03-08 22:11:03,811 INFO L125 PetriNetUnfolderBase]: For 60/103 co-relation queries the response was YES. [2025-03-08 22:11:03,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 878 events. 119/878 cut-off events. For 60/103 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-08 22:11:03,816 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 16 selfloop transitions, 4 changer transitions 1/143 dead transitions. [2025-03-08 22:11:03,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 342 flow [2025-03-08 22:11:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-03-08 22:11:03,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513381995133819 [2025-03-08 22:11:03,818 INFO L175 Difference]: Start difference. First operand has 139 places, 137 transitions, 290 flow. Second operand 3 states and 391 transitions. [2025-03-08 22:11:03,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 342 flow [2025-03-08 22:11:03,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:03,820 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 316 flow [2025-03-08 22:11:03,820 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-08 22:11:03,822 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places. [2025-03-08 22:11:03,822 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 316 flow [2025-03-08 22:11:03,822 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-08 22:11:03,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:03,822 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-08 22:11:03,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:11:03,822 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-08 22:11:03,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash 847900008, now seen corresponding path program 1 times [2025-03-08 22:11:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:03,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501418055] [2025-03-08 22:11:03,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:03,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:11:03,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:11:03,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:03,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:03,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501418055] [2025-03-08 22:11:03,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501418055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:03,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:03,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95201207] [2025-03-08 22:11:03,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:03,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:11:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:03,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:11:03,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:11:03,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 137 [2025-03-08 22:11:03,971 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-08 22:11:03,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:03,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 137 [2025-03-08 22:11:03,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:04,094 INFO L124 PetriNetUnfolderBase]: 189/1374 cut-off events. [2025-03-08 22:11:04,094 INFO L125 PetriNetUnfolderBase]: For 72/73 co-relation queries the response was YES. [2025-03-08 22:11:04,098 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-08 22:11:04,101 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 20 selfloop transitions, 2 changer transitions 5/146 dead transitions. [2025-03-08 22:11:04,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 386 flow [2025-03-08 22:11:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2025-03-08 22:11:04,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880778588807786 [2025-03-08 22:11:04,103 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 316 flow. Second operand 6 states and 730 transitions. [2025-03-08 22:11:04,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 386 flow [2025-03-08 22:11:04,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:04,105 INFO L231 Difference]: Finished difference. Result has 149 places, 139 transitions, 330 flow [2025-03-08 22:11:04,105 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-08 22:11:04,106 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 10 predicate places. [2025-03-08 22:11:04,106 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 330 flow [2025-03-08 22:11:04,106 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-08 22:11:04,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:04,106 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-08 22:11:04,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:11:04,106 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-08 22:11:04,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1616460659, now seen corresponding path program 1 times [2025-03-08 22:11:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:04,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219272989] [2025-03-08 22:11:04,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:04,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:11:04,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:11:04,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:04,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219272989] [2025-03-08 22:11:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219272989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:04,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274514133] [2025-03-08 22:11:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:04,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:04,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:04,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:04,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 137 [2025-03-08 22:11:04,382 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-08 22:11:04,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:04,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 137 [2025-03-08 22:11:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:04,619 INFO L124 PetriNetUnfolderBase]: 448/2416 cut-off events. [2025-03-08 22:11:04,619 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-03-08 22:11:04,623 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-08 22:11:04,628 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 49 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2025-03-08 22:11:04,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 154 transitions, 468 flow [2025-03-08 22:11:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2025-03-08 22:11:04,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.781021897810219 [2025-03-08 22:11:04,629 INFO L175 Difference]: Start difference. First operand has 149 places, 139 transitions, 330 flow. Second operand 6 states and 642 transitions. [2025-03-08 22:11:04,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 154 transitions, 468 flow [2025-03-08 22:11:04,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 154 transitions, 456 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-08 22:11:04,633 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 326 flow [2025-03-08 22:11:04,633 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-08 22:11:04,634 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2025-03-08 22:11:04,634 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 326 flow [2025-03-08 22:11:04,634 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-08 22:11:04,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:04,634 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-08 22:11:04,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:11:04,635 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-08 22:11:04,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash 446511681, now seen corresponding path program 1 times [2025-03-08 22:11:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:04,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527106017] [2025-03-08 22:11:04,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:04,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:11:04,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:11:04,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:04,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:04,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:04,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527106017] [2025-03-08 22:11:04,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527106017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:04,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:04,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:04,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112788730] [2025-03-08 22:11:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:04,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:04,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:04,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:04,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 137 [2025-03-08 22:11:04,919 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-08 22:11:04,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:04,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 137 [2025-03-08 22:11:04,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:05,129 INFO L124 PetriNetUnfolderBase]: 446/2418 cut-off events. [2025-03-08 22:11:05,129 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-08 22:11:05,132 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-08 22:11:05,137 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 46 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2025-03-08 22:11:05,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 458 flow [2025-03-08 22:11:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2025-03-08 22:11:05,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7931873479318735 [2025-03-08 22:11:05,139 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 326 flow. Second operand 6 states and 652 transitions. [2025-03-08 22:11:05,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 458 flow [2025-03-08 22:11:05,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 448 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:05,141 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 324 flow [2025-03-08 22:11:05,141 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-08 22:11:05,142 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-03-08 22:11:05,142 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 324 flow [2025-03-08 22:11:05,142 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-08 22:11:05,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:05,142 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-08 22:11:05,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:11:05,143 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-08 22:11:05,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash -278956412, now seen corresponding path program 1 times [2025-03-08 22:11:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:05,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000005006] [2025-03-08 22:11:05,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:05,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:11:05,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:11:05,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:05,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:05,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000005006] [2025-03-08 22:11:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000005006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206325958] [2025-03-08 22:11:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:05,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:05,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:05,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:05,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2025-03-08 22:11:05,179 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-08 22:11:05,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:05,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2025-03-08 22:11:05,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:05,268 INFO L124 PetriNetUnfolderBase]: 165/1189 cut-off events. [2025-03-08 22:11:05,268 INFO L125 PetriNetUnfolderBase]: For 192/359 co-relation queries the response was YES. [2025-03-08 22:11:05,270 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-08 22:11:05,274 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 7 changer transitions 0/146 dead transitions. [2025-03-08 22:11:05,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 408 flow [2025-03-08 22:11:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-03-08 22:11:05,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2025-03-08 22:11:05,275 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 324 flow. Second operand 3 states and 387 transitions. [2025-03-08 22:11:05,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 408 flow [2025-03-08 22:11:05,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 146 transitions, 398 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:05,278 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 370 flow [2025-03-08 22:11:05,278 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-08 22:11:05,278 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places. [2025-03-08 22:11:05,278 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 370 flow [2025-03-08 22:11:05,279 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-08 22:11:05,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:05,279 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-08 22:11:05,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:11:05,279 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-08 22:11:05,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:05,280 INFO L85 PathProgramCache]: Analyzing trace with hash -841010396, now seen corresponding path program 1 times [2025-03-08 22:11:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:05,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238945432] [2025-03-08 22:11:05,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:05,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:11:05,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:11:05,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:05,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:05,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:05,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238945432] [2025-03-08 22:11:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238945432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:05,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:05,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:05,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267429973] [2025-03-08 22:11:05,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:05,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:05,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:05,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:05,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:05,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 137 [2025-03-08 22:11:05,603 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-08 22:11:05,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:05,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 137 [2025-03-08 22:11:05,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:05,875 INFO L124 PetriNetUnfolderBase]: 463/2595 cut-off events. [2025-03-08 22:11:05,875 INFO L125 PetriNetUnfolderBase]: For 408/466 co-relation queries the response was YES. [2025-03-08 22:11:05,881 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-08 22:11:05,888 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 43 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-03-08 22:11:05,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 494 flow [2025-03-08 22:11:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2025-03-08 22:11:05,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.805352798053528 [2025-03-08 22:11:05,890 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 370 flow. Second operand 6 states and 662 transitions. [2025-03-08 22:11:05,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 494 flow [2025-03-08 22:11:05,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:05,894 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 362 flow [2025-03-08 22:11:05,895 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-08 22:11:05,896 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-03-08 22:11:05,896 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 362 flow [2025-03-08 22:11:05,896 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-08 22:11:05,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:05,896 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-08 22:11:05,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:11:05,897 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-08 22:11:05,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash -985564059, now seen corresponding path program 1 times [2025-03-08 22:11:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:05,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83327248] [2025-03-08 22:11:05,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:05,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:11:05,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:11:05,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:05,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:05,973 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-08 22:11:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83327248] [2025-03-08 22:11:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83327248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:05,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:05,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144016147] [2025-03-08 22:11:05,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:05,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:05,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:05,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:06,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2025-03-08 22:11:06,054 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-08 22:11:06,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:06,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2025-03-08 22:11:06,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:06,165 INFO L124 PetriNetUnfolderBase]: 145/1371 cut-off events. [2025-03-08 22:11:06,165 INFO L125 PetriNetUnfolderBase]: For 142/170 co-relation queries the response was YES. [2025-03-08 22:11:06,168 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-08 22:11:06,172 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 26 selfloop transitions, 6 changer transitions 3/153 dead transitions. [2025-03-08 22:11:06,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 462 flow [2025-03-08 22:11:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2025-03-08 22:11:06,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905109489051095 [2025-03-08 22:11:06,173 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 362 flow. Second operand 6 states and 732 transitions. [2025-03-08 22:11:06,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 462 flow [2025-03-08 22:11:06,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:06,176 INFO L231 Difference]: Finished difference. Result has 147 places, 141 transitions, 372 flow [2025-03-08 22:11:06,176 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-08 22:11:06,176 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-03-08 22:11:06,176 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 141 transitions, 372 flow [2025-03-08 22:11:06,177 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-08 22:11:06,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:06,177 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-08 22:11:06,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:11:06,177 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-08 22:11:06,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1531446150, now seen corresponding path program 1 times [2025-03-08 22:11:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:06,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614864614] [2025-03-08 22:11:06,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:06,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:06,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:11:06,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:11:06,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:06,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:06,351 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-08 22:11:06,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:06,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614864614] [2025-03-08 22:11:06,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614864614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:06,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:06,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229378196] [2025-03-08 22:11:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:06,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:06,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:06,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:06,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:06,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2025-03-08 22:11:06,507 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-08 22:11:06,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:06,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2025-03-08 22:11:06,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:06,657 INFO L124 PetriNetUnfolderBase]: 329/1886 cut-off events. [2025-03-08 22:11:06,657 INFO L125 PetriNetUnfolderBase]: For 141/176 co-relation queries the response was YES. [2025-03-08 22:11:06,661 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-08 22:11:06,665 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 36 selfloop transitions, 5 changer transitions 1/156 dead transitions. [2025-03-08 22:11:06,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 484 flow [2025-03-08 22:11:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2025-03-08 22:11:06,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2025-03-08 22:11:06,667 INFO L175 Difference]: Start difference. First operand has 147 places, 141 transitions, 372 flow. Second operand 6 states and 702 transitions. [2025-03-08 22:11:06,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 484 flow [2025-03-08 22:11:06,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:06,670 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 368 flow [2025-03-08 22:11:06,670 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-08 22:11:06,671 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-03-08 22:11:06,671 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 368 flow [2025-03-08 22:11:06,671 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-08 22:11:06,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:06,671 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-08 22:11:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:11:06,671 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-08 22:11:06,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 568969079, now seen corresponding path program 1 times [2025-03-08 22:11:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862449488] [2025-03-08 22:11:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:06,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 22:11:06,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:11:06,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:06,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:06,704 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-08 22:11:06,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:06,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862449488] [2025-03-08 22:11:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862449488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:06,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:06,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972720229] [2025-03-08 22:11:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:06,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:06,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:06,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:06,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:06,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2025-03-08 22:11:06,716 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-08 22:11:06,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:06,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2025-03-08 22:11:06,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:06,783 INFO L124 PetriNetUnfolderBase]: 56/879 cut-off events. [2025-03-08 22:11:06,783 INFO L125 PetriNetUnfolderBase]: For 231/459 co-relation queries the response was YES. [2025-03-08 22:11:06,785 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-08 22:11:06,787 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 7 changer transitions 1/146 dead transitions. [2025-03-08 22:11:06,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 445 flow [2025-03-08 22:11:06,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-03-08 22:11:06,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391727493917275 [2025-03-08 22:11:06,788 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 368 flow. Second operand 3 states and 386 transitions. [2025-03-08 22:11:06,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 445 flow [2025-03-08 22:11:06,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 435 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:06,791 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 408 flow [2025-03-08 22:11:06,791 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-08 22:11:06,792 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-03-08 22:11:06,792 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 408 flow [2025-03-08 22:11:06,792 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-08 22:11:06,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:06,792 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-08 22:11:06,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:11:06,792 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-08 22:11:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1040538817, now seen corresponding path program 1 times [2025-03-08 22:11:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:06,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968995340] [2025-03-08 22:11:06,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:06,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 22:11:06,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 22:11:06,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:06,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:06,864 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-08 22:11:06,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:06,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968995340] [2025-03-08 22:11:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968995340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:06,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:06,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:11:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204016495] [2025-03-08 22:11:06,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:06,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:06,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:06,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:06,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 137 [2025-03-08 22:11:06,873 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-08 22:11:06,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:06,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 137 [2025-03-08 22:11:06,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:06,913 INFO L124 PetriNetUnfolderBase]: 12/474 cut-off events. [2025-03-08 22:11:06,914 INFO L125 PetriNetUnfolderBase]: For 119/146 co-relation queries the response was YES. [2025-03-08 22:11:06,914 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-08 22:11:06,916 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 8 selfloop transitions, 4 changer transitions 4/143 dead transitions. [2025-03-08 22:11:06,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 429 flow [2025-03-08 22:11:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-08 22:11:06,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2025-03-08 22:11:06,917 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 408 flow. Second operand 3 states and 395 transitions. [2025-03-08 22:11:06,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 429 flow [2025-03-08 22:11:06,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 417 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:06,919 INFO L231 Difference]: Finished difference. Result has 147 places, 136 transitions, 368 flow [2025-03-08 22:11:06,919 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-08 22:11:06,921 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-03-08 22:11:06,921 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 136 transitions, 368 flow [2025-03-08 22:11:06,921 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-08 22:11:06,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:06,921 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-08 22:11:06,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:11:06,921 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-08 22:11:06,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash 343188605, now seen corresponding path program 1 times [2025-03-08 22:11:06,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:06,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694798174] [2025-03-08 22:11:06,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:06,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 22:11:06,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 22:11:06,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:06,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:06,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:06,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 22:11:06,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 22:11:06,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:06,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:06,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:06,994 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-08 22:11:06,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-08 22:11:06,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:11:06,994 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:06,995 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:06,995 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 22:11:07,017 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:11:07,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 155 transitions, 337 flow [2025-03-08 22:11:07,048 INFO L124 PetriNetUnfolderBase]: 9/515 cut-off events. [2025-03-08 22:11:07,048 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:11:07,049 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-08 22:11:07,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 155 transitions, 337 flow [2025-03-08 22:11:07,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 155 transitions, 337 flow [2025-03-08 22:11:07,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:07,052 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;@7e96ed52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:07,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 22:11:07,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:07,054 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-08 22:11:07,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:07,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:07,054 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-08 22:11:07,054 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-08 22:11:07,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1055560476, now seen corresponding path program 1 times [2025-03-08 22:11:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135396576] [2025-03-08 22:11:07,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:07,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:11:07,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:11:07,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:07,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135396576] [2025-03-08 22:11:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135396576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:07,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:07,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:07,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257778128] [2025-03-08 22:11:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:07,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:07,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:07,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 155 [2025-03-08 22:11:07,082 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-08 22:11:07,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:07,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 155 [2025-03-08 22:11:07,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:07,477 INFO L124 PetriNetUnfolderBase]: 1071/4747 cut-off events. [2025-03-08 22:11:07,477 INFO L125 PetriNetUnfolderBase]: For 407/794 co-relation queries the response was YES. [2025-03-08 22:11:07,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 4747 events. 1071/4747 cut-off events. For 407/794 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-08 22:11:07,498 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 23 selfloop transitions, 5 changer transitions 1/164 dead transitions. [2025-03-08 22:11:07,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 411 flow [2025-03-08 22:11:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-03-08 22:11:07,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419354838709677 [2025-03-08 22:11:07,499 INFO L175 Difference]: Start difference. First operand has 158 places, 155 transitions, 337 flow. Second operand 3 states and 438 transitions. [2025-03-08 22:11:07,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 411 flow [2025-03-08 22:11:07,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:07,502 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 371 flow [2025-03-08 22:11:07,502 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-08 22:11:07,503 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 4 predicate places. [2025-03-08 22:11:07,503 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 371 flow [2025-03-08 22:11:07,503 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-08 22:11:07,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:07,503 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-08 22:11:07,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:11:07,503 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-08 22:11:07,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 404206120, now seen corresponding path program 1 times [2025-03-08 22:11:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023150146] [2025-03-08 22:11:07,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:07,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:11:07,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:11:07,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:07,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:07,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:07,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023150146] [2025-03-08 22:11:07,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023150146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:07,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:07,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666649810] [2025-03-08 22:11:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:07,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:11:07,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:07,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:11:07,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:11:07,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 155 [2025-03-08 22:11:07,614 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-08 22:11:07,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:07,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 155 [2025-03-08 22:11:07,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:08,106 INFO L124 PetriNetUnfolderBase]: 1404/6861 cut-off events. [2025-03-08 22:11:08,106 INFO L125 PetriNetUnfolderBase]: For 440/455 co-relation queries the response was YES. [2025-03-08 22:11:08,121 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-08 22:11:08,136 INFO L140 encePairwiseOnDemand]: 147/155 looper letters, 24 selfloop transitions, 2 changer transitions 5/165 dead transitions. [2025-03-08 22:11:08,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 165 transitions, 449 flow [2025-03-08 22:11:08,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2025-03-08 22:11:08,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8795698924731182 [2025-03-08 22:11:08,138 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 371 flow. Second operand 6 states and 818 transitions. [2025-03-08 22:11:08,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 165 transitions, 449 flow [2025-03-08 22:11:08,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 165 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:08,145 INFO L231 Difference]: Finished difference. Result has 168 places, 158 transitions, 383 flow [2025-03-08 22:11:08,145 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-08 22:11:08,146 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 10 predicate places. [2025-03-08 22:11:08,146 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 383 flow [2025-03-08 22:11:08,146 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-08 22:11:08,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:08,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:08,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:11:08,146 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-08 22:11:08,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1808898152, now seen corresponding path program 1 times [2025-03-08 22:11:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:08,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700469549] [2025-03-08 22:11:08,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:08,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:11:08,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:11:08,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:08,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:08,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:08,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700469549] [2025-03-08 22:11:08,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700469549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:08,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:08,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:08,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130623903] [2025-03-08 22:11:08,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:08,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:08,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:08,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:08,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:08,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 155 [2025-03-08 22:11:08,412 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-08 22:11:08,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:08,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 155 [2025-03-08 22:11:08,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:09,375 INFO L124 PetriNetUnfolderBase]: 3152/13178 cut-off events. [2025-03-08 22:11:09,376 INFO L125 PetriNetUnfolderBase]: For 507/508 co-relation queries the response was YES. [2025-03-08 22:11:09,400 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-08 22:11:09,430 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 61 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2025-03-08 22:11:09,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 561 flow [2025-03-08 22:11:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2025-03-08 22:11:09,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7935483870967742 [2025-03-08 22:11:09,433 INFO L175 Difference]: Start difference. First operand has 168 places, 158 transitions, 383 flow. Second operand 6 states and 738 transitions. [2025-03-08 22:11:09,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 561 flow [2025-03-08 22:11:09,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 181 transitions, 549 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-08 22:11:09,437 INFO L231 Difference]: Finished difference. Result has 165 places, 157 transitions, 379 flow [2025-03-08 22:11:09,438 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-08 22:11:09,438 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 7 predicate places. [2025-03-08 22:11:09,438 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 157 transitions, 379 flow [2025-03-08 22:11:09,438 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-08 22:11:09,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:09,439 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-08 22:11:09,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:11:09,439 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-08 22:11:09,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -986437316, now seen corresponding path program 1 times [2025-03-08 22:11:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:09,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929533172] [2025-03-08 22:11:09,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:09,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:11:09,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:11:09,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:09,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:09,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929533172] [2025-03-08 22:11:09,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929533172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:09,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242833167] [2025-03-08 22:11:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:09,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:09,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:09,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:09,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 155 [2025-03-08 22:11:09,642 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-08 22:11:09,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:09,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 155 [2025-03-08 22:11:09,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:10,865 INFO L124 PetriNetUnfolderBase]: 3180/13177 cut-off events. [2025-03-08 22:11:10,865 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-03-08 22:11:10,885 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-08 22:11:10,911 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 58 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-03-08 22:11:10,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 551 flow [2025-03-08 22:11:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2025-03-08 22:11:10,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8043010752688172 [2025-03-08 22:11:10,913 INFO L175 Difference]: Start difference. First operand has 165 places, 157 transitions, 379 flow. Second operand 6 states and 748 transitions. [2025-03-08 22:11:10,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 551 flow [2025-03-08 22:11:10,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 541 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:10,916 INFO L231 Difference]: Finished difference. Result has 164 places, 156 transitions, 377 flow [2025-03-08 22:11:10,916 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-08 22:11:10,916 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2025-03-08 22:11:10,917 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 156 transitions, 377 flow [2025-03-08 22:11:10,917 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-08 22:11:10,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:10,917 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-08 22:11:10,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:11:10,917 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-08 22:11:10,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1152247121, now seen corresponding path program 1 times [2025-03-08 22:11:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405923198] [2025-03-08 22:11:10,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:10,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:11:10,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:11:10,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:10,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:10,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:10,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405923198] [2025-03-08 22:11:10,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405923198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:10,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:10,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569745717] [2025-03-08 22:11:10,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:10,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:10,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:10,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:10,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-03-08 22:11:10,953 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-08 22:11:10,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:10,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-03-08 22:11:10,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:11,516 INFO L124 PetriNetUnfolderBase]: 1743/7668 cut-off events. [2025-03-08 22:11:11,516 INFO L125 PetriNetUnfolderBase]: For 1543/2997 co-relation queries the response was YES. [2025-03-08 22:11:11,530 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-08 22:11:11,545 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 29 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2025-03-08 22:11:11,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 511 flow [2025-03-08 22:11:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2025-03-08 22:11:11,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376344086021505 [2025-03-08 22:11:11,547 INFO L175 Difference]: Start difference. First operand has 164 places, 156 transitions, 377 flow. Second operand 3 states and 436 transitions. [2025-03-08 22:11:11,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 511 flow [2025-03-08 22:11:11,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 171 transitions, 501 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:11,550 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 443 flow [2025-03-08 22:11:11,550 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-08 22:11:11,550 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 5 predicate places. [2025-03-08 22:11:11,550 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 443 flow [2025-03-08 22:11:11,551 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-08 22:11:11,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:11,551 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-08 22:11:11,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:11:11,551 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-08 22:11:11,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash 284354991, now seen corresponding path program 1 times [2025-03-08 22:11:11,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:11,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564697977] [2025-03-08 22:11:11,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:11,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:11,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:11:11,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:11:11,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:11,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:11,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:11,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564697977] [2025-03-08 22:11:11,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564697977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:11,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:11,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61503287] [2025-03-08 22:11:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:11,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:11,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:11,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:11,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 155 [2025-03-08 22:11:11,874 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-08 22:11:11,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:11,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 155 [2025-03-08 22:11:11,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:13,033 INFO L124 PetriNetUnfolderBase]: 3779/14522 cut-off events. [2025-03-08 22:11:13,033 INFO L125 PetriNetUnfolderBase]: For 2116/2667 co-relation queries the response was YES. [2025-03-08 22:11:13,065 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-08 22:11:13,106 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 55 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-03-08 22:11:13,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 185 transitions, 607 flow [2025-03-08 22:11:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2025-03-08 22:11:13,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8150537634408602 [2025-03-08 22:11:13,108 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 443 flow. Second operand 6 states and 758 transitions. [2025-03-08 22:11:13,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 185 transitions, 607 flow [2025-03-08 22:11:13,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 185 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:13,119 INFO L231 Difference]: Finished difference. Result has 164 places, 161 transitions, 431 flow [2025-03-08 22:11:13,119 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-08 22:11:13,120 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2025-03-08 22:11:13,120 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 161 transitions, 431 flow [2025-03-08 22:11:13,120 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-08 22:11:13,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:13,120 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-08 22:11:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:11:13,121 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-08 22:11:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash 640876784, now seen corresponding path program 1 times [2025-03-08 22:11:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714443804] [2025-03-08 22:11:13,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:13,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:11:13,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:11:13,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:13,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:13,194 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-08 22:11:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714443804] [2025-03-08 22:11:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714443804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:13,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581830265] [2025-03-08 22:11:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:13,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:13,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:13,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 155 [2025-03-08 22:11:13,292 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-08 22:11:13,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:13,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 155 [2025-03-08 22:11:13,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:14,014 INFO L124 PetriNetUnfolderBase]: 1302/7697 cut-off events. [2025-03-08 22:11:14,014 INFO L125 PetriNetUnfolderBase]: For 964/1221 co-relation queries the response was YES. [2025-03-08 22:11:14,036 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-08 22:11:14,054 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 38 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2025-03-08 22:11:14,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 568 flow [2025-03-08 22:11:14,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2025-03-08 22:11:14,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870967741935484 [2025-03-08 22:11:14,056 INFO L175 Difference]: Start difference. First operand has 164 places, 161 transitions, 431 flow. Second operand 6 states and 825 transitions. [2025-03-08 22:11:14,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 568 flow [2025-03-08 22:11:14,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:14,061 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 447 flow [2025-03-08 22:11:14,061 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-08 22:11:14,061 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-03-08 22:11:14,061 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 447 flow [2025-03-08 22:11:14,061 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-08 22:11:14,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:14,061 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-08 22:11:14,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:11:14,062 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-08 22:11:14,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1015912433, now seen corresponding path program 1 times [2025-03-08 22:11:14,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:14,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128810550] [2025-03-08 22:11:14,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:14,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:14,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:11:14,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:11:14,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:14,272 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-08 22:11:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128810550] [2025-03-08 22:11:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128810550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:14,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443739796] [2025-03-08 22:11:14,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:14,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:14,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:14,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:14,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 155 [2025-03-08 22:11:14,395 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-08 22:11:14,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:14,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 155 [2025-03-08 22:11:14,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:15,274 INFO L124 PetriNetUnfolderBase]: 2701/10581 cut-off events. [2025-03-08 22:11:15,274 INFO L125 PetriNetUnfolderBase]: For 982/1400 co-relation queries the response was YES. [2025-03-08 22:11:15,299 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-08 22:11:15,319 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 48 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2025-03-08 22:11:15,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 186 transitions, 599 flow [2025-03-08 22:11:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2025-03-08 22:11:15,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8580645161290322 [2025-03-08 22:11:15,321 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 447 flow. Second operand 6 states and 798 transitions. [2025-03-08 22:11:15,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 186 transitions, 599 flow [2025-03-08 22:11:15,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 186 transitions, 591 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:15,324 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 447 flow [2025-03-08 22:11:15,324 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-08 22:11:15,324 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 9 predicate places. [2025-03-08 22:11:15,324 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 447 flow [2025-03-08 22:11:15,324 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-08 22:11:15,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:15,324 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-08 22:11:15,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:11:15,325 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-08 22:11:15,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash -599120233, now seen corresponding path program 1 times [2025-03-08 22:11:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:15,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190035125] [2025-03-08 22:11:15,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:15,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 22:11:15,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:11:15,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:15,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:15,352 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-08 22:11:15,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:15,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190035125] [2025-03-08 22:11:15,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190035125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:15,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:15,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623491120] [2025-03-08 22:11:15,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:15,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:15,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:15,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:15,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-03-08 22:11:15,365 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-08 22:11:15,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:15,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-03-08 22:11:15,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:15,841 INFO L124 PetriNetUnfolderBase]: 1086/6184 cut-off events. [2025-03-08 22:11:15,841 INFO L125 PetriNetUnfolderBase]: For 2452/4123 co-relation queries the response was YES. [2025-03-08 22:11:15,859 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-08 22:11:15,872 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 31 selfloop transitions, 13 changer transitions 0/178 dead transitions. [2025-03-08 22:11:15,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 178 transitions, 608 flow [2025-03-08 22:11:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2025-03-08 22:11:15,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-03-08 22:11:15,873 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 447 flow. Second operand 3 states and 435 transitions. [2025-03-08 22:11:15,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 178 transitions, 608 flow [2025-03-08 22:11:15,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 178 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:15,877 INFO L231 Difference]: Finished difference. Result has 166 places, 171 transitions, 555 flow [2025-03-08 22:11:15,877 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-08 22:11:15,877 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-03-08 22:11:15,878 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 171 transitions, 555 flow [2025-03-08 22:11:15,878 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-08 22:11:15,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:15,878 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-08 22:11:15,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:11:15,878 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-08 22:11:15,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:15,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1611320021, now seen corresponding path program 1 times [2025-03-08 22:11:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913636291] [2025-03-08 22:11:15,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:15,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:15,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 22:11:15,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 22:11:15,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:15,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:15,935 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-08 22:11:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913636291] [2025-03-08 22:11:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913636291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:15,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:15,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:11:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238570699] [2025-03-08 22:11:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:15,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:15,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:15,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:15,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 155 [2025-03-08 22:11:15,943 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-08 22:11:15,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:15,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 155 [2025-03-08 22:11:15,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:16,097 INFO L124 PetriNetUnfolderBase]: 124/2155 cut-off events. [2025-03-08 22:11:16,097 INFO L125 PetriNetUnfolderBase]: For 705/828 co-relation queries the response was YES. [2025-03-08 22:11:16,102 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-08 22:11:16,104 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 12 selfloop transitions, 6 changer transitions 0/166 dead transitions. [2025-03-08 22:11:16,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 528 flow [2025-03-08 22:11:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-03-08 22:11:16,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548387096774194 [2025-03-08 22:11:16,105 INFO L175 Difference]: Start difference. First operand has 166 places, 171 transitions, 555 flow. Second operand 3 states and 444 transitions. [2025-03-08 22:11:16,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 528 flow [2025-03-08 22:11:16,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 166 transitions, 514 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:16,108 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 459 flow [2025-03-08 22:11:16,108 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-08 22:11:16,108 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-03-08 22:11:16,108 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 459 flow [2025-03-08 22:11:16,109 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-08 22:11:16,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:16,109 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-08 22:11:16,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:11:16,109 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-08 22:11:16,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1518124718, now seen corresponding path program 1 times [2025-03-08 22:11:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:16,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607795440] [2025-03-08 22:11:16,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:16,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:11:16,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:11:16,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:16,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:16,153 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-08 22:11:16,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:16,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607795440] [2025-03-08 22:11:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607795440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:16,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:16,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564472852] [2025-03-08 22:11:16,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:16,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:16,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:16,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:16,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-03-08 22:11:16,167 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-08 22:11:16,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:16,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-03-08 22:11:16,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:16,384 INFO L124 PetriNetUnfolderBase]: 203/2144 cut-off events. [2025-03-08 22:11:16,385 INFO L125 PetriNetUnfolderBase]: For 1365/1860 co-relation queries the response was YES. [2025-03-08 22:11:16,389 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-08 22:11:16,391 INFO L140 encePairwiseOnDemand]: 150/155 looper letters, 25 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-03-08 22:11:16,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 541 flow [2025-03-08 22:11:16,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2025-03-08 22:11:16,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204301075268817 [2025-03-08 22:11:16,392 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 459 flow. Second operand 3 states and 428 transitions. [2025-03-08 22:11:16,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 541 flow [2025-03-08 22:11:16,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:11:16,394 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 493 flow [2025-03-08 22:11:16,395 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-08 22:11:16,396 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 11 predicate places. [2025-03-08 22:11:16,396 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 493 flow [2025-03-08 22:11:16,396 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-08 22:11:16,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:16,396 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-08 22:11:16,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:11:16,397 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-08 22:11:16,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash 129004564, now seen corresponding path program 1 times [2025-03-08 22:11:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080585115] [2025-03-08 22:11:16,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:16,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 22:11:16,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 22:11:16,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:16,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:16,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:16,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 22:11:16,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 22:11:16,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:16,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:16,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:16,478 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-08 22:11:16,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-08 22:11:16,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:11:16,480 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:16,480 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:16,480 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 22:11:16,498 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 22:11:16,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 173 transitions, 386 flow [2025-03-08 22:11:16,554 INFO L124 PetriNetUnfolderBase]: 22/897 cut-off events. [2025-03-08 22:11:16,555 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-08 22:11:16,556 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-08 22:11:16,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 173 transitions, 386 flow [2025-03-08 22:11:16,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 173 transitions, 386 flow [2025-03-08 22:11:16,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:16,561 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;@7e96ed52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:16,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-08 22:11:16,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:16,563 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-08 22:11:16,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:16,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:16,563 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-08 22:11:16,563 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-08 22:11:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 554746556, now seen corresponding path program 1 times [2025-03-08 22:11:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490533602] [2025-03-08 22:11:16,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:16,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:11:16,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:11:16,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:16,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490533602] [2025-03-08 22:11:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490533602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:16,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:16,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748453115] [2025-03-08 22:11:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:16,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:16,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:16,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:16,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:16,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 173 [2025-03-08 22:11:16,596 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-08 22:11:16,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:16,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 173 [2025-03-08 22:11:16,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:18,892 INFO L124 PetriNetUnfolderBase]: 7859/26538 cut-off events. [2025-03-08 22:11:18,893 INFO L125 PetriNetUnfolderBase]: For 2850/5575 co-relation queries the response was YES. [2025-03-08 22:11:18,949 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-08 22:11:19,026 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 30 selfloop transitions, 6 changer transitions 1/185 dead transitions. [2025-03-08 22:11:19,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 482 flow [2025-03-08 22:11:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-08 22:11:19,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344894026974951 [2025-03-08 22:11:19,028 INFO L175 Difference]: Start difference. First operand has 177 places, 173 transitions, 386 flow. Second operand 3 states and 485 transitions. [2025-03-08 22:11:19,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 482 flow [2025-03-08 22:11:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:19,032 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 428 flow [2025-03-08 22:11:19,032 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-08 22:11:19,033 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 4 predicate places. [2025-03-08 22:11:19,033 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 428 flow [2025-03-08 22:11:19,033 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-08 22:11:19,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:19,033 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-08 22:11:19,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:11:19,033 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-08 22:11:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 158371688, now seen corresponding path program 1 times [2025-03-08 22:11:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329365587] [2025-03-08 22:11:19,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:19,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:11:19,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:11:19,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:19,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329365587] [2025-03-08 22:11:19,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329365587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539940136] [2025-03-08 22:11:19,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:19,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:11:19,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:19,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:11:19,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:11:19,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2025-03-08 22:11:19,156 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-08 22:11:19,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:19,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2025-03-08 22:11:19,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:23,080 INFO L124 PetriNetUnfolderBase]: 9343/35816 cut-off events. [2025-03-08 22:11:23,080 INFO L125 PetriNetUnfolderBase]: For 2632/2756 co-relation queries the response was YES. [2025-03-08 22:11:23,186 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-08 22:11:23,307 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 28 selfloop transitions, 2 changer transitions 5/184 dead transitions. [2025-03-08 22:11:23,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 514 flow [2025-03-08 22:11:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions. [2025-03-08 22:11:23,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8728323699421965 [2025-03-08 22:11:23,308 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 428 flow. Second operand 6 states and 906 transitions. [2025-03-08 22:11:23,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 514 flow [2025-03-08 22:11:23,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 184 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:23,346 INFO L231 Difference]: Finished difference. Result has 187 places, 177 transitions, 438 flow [2025-03-08 22:11:23,346 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-08 22:11:23,346 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 10 predicate places. [2025-03-08 22:11:23,346 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 177 transitions, 438 flow [2025-03-08 22:11:23,347 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-08 22:11:23,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:23,347 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-08 22:11:23,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:11:23,347 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-08 22:11:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1517001771, now seen corresponding path program 1 times [2025-03-08 22:11:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668326359] [2025-03-08 22:11:23,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:23,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:11:23,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:11:23,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:23,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:23,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:23,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668326359] [2025-03-08 22:11:23,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668326359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:23,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:23,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230607226] [2025-03-08 22:11:23,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:23,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:23,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:23,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:23,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 173 [2025-03-08 22:11:23,550 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-08 22:11:23,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:23,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 173 [2025-03-08 22:11:23,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:30,935 INFO L124 PetriNetUnfolderBase]: 20475/70474 cut-off events. [2025-03-08 22:11:30,935 INFO L125 PetriNetUnfolderBase]: For 2766/2782 co-relation queries the response was YES. [2025-03-08 22:11:31,185 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-08 22:11:31,446 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 73 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2025-03-08 22:11:31,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 208 transitions, 656 flow [2025-03-08 22:11:31,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2025-03-08 22:11:31,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8034682080924855 [2025-03-08 22:11:31,448 INFO L175 Difference]: Start difference. First operand has 187 places, 177 transitions, 438 flow. Second operand 6 states and 834 transitions. [2025-03-08 22:11:31,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 208 transitions, 656 flow [2025-03-08 22:11:31,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 208 transitions, 644 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-08 22:11:31,493 INFO L231 Difference]: Finished difference. Result has 184 places, 176 transitions, 434 flow [2025-03-08 22:11:31,493 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-08 22:11:31,493 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 7 predicate places. [2025-03-08 22:11:31,494 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 176 transitions, 434 flow [2025-03-08 22:11:31,494 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-08 22:11:31,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:31,494 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-08 22:11:31,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:11:31,494 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-08 22:11:31,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:31,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1598336137, now seen corresponding path program 1 times [2025-03-08 22:11:31,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:31,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61734365] [2025-03-08 22:11:31,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:31,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:31,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:11:31,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:11:31,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:31,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61734365] [2025-03-08 22:11:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61734365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061700267] [2025-03-08 22:11:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:31,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:31,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:31,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:31,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 173 [2025-03-08 22:11:31,742 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-08 22:11:31,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:31,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 173 [2025-03-08 22:11:31,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:36,978 INFO L124 PetriNetUnfolderBase]: 21685/51607 cut-off events. [2025-03-08 22:11:36,978 INFO L125 PetriNetUnfolderBase]: For 2346/2346 co-relation queries the response was YES. [2025-03-08 22:11:37,169 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-08 22:11:37,345 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 70 selfloop transitions, 5 changer transitions 0/207 dead transitions. [2025-03-08 22:11:37,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 207 transitions, 646 flow [2025-03-08 22:11:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-03-08 22:11:37,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8131021194605009 [2025-03-08 22:11:37,346 INFO L175 Difference]: Start difference. First operand has 184 places, 176 transitions, 434 flow. Second operand 6 states and 844 transitions. [2025-03-08 22:11:37,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 207 transitions, 646 flow [2025-03-08 22:11:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 207 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:37,351 INFO L231 Difference]: Finished difference. Result has 183 places, 175 transitions, 432 flow [2025-03-08 22:11:37,351 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-08 22:11:37,351 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 6 predicate places. [2025-03-08 22:11:37,351 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 175 transitions, 432 flow [2025-03-08 22:11:37,351 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-08 22:11:37,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,351 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-08 22:11:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:11:37,352 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-08 22:11:37,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1425479612, now seen corresponding path program 1 times [2025-03-08 22:11:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432895521] [2025-03-08 22:11:37,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:11:37,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:11:37,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:37,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:37,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432895521] [2025-03-08 22:11:37,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432895521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:37,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:37,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806880886] [2025-03-08 22:11:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:37,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:37,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 173 [2025-03-08 22:11:37,393 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-08 22:11:37,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:37,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 173 [2025-03-08 22:11:37,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:42,179 INFO L124 PetriNetUnfolderBase]: 13641/46120 cut-off events. [2025-03-08 22:11:42,179 INFO L125 PetriNetUnfolderBase]: For 11665/23311 co-relation queries the response was YES. [2025-03-08 22:11:42,330 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-08 22:11:42,470 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 39 selfloop transitions, 11 changer transitions 0/196 dead transitions. [2025-03-08 22:11:42,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 196 transitions, 618 flow [2025-03-08 22:11:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-08 22:11:42,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344894026974951 [2025-03-08 22:11:42,471 INFO L175 Difference]: Start difference. First operand has 183 places, 175 transitions, 432 flow. Second operand 3 states and 485 transitions. [2025-03-08 22:11:42,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 196 transitions, 618 flow [2025-03-08 22:11:42,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 196 transitions, 608 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:42,477 INFO L231 Difference]: Finished difference. Result has 182 places, 184 transitions, 518 flow [2025-03-08 22:11:42,477 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-08 22:11:42,477 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 5 predicate places. [2025-03-08 22:11:42,477 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 184 transitions, 518 flow [2025-03-08 22:11:42,477 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-08 22:11:42,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:42,477 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-08 22:11:42,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:11:42,477 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-08 22:11:42,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash 760633420, now seen corresponding path program 1 times [2025-03-08 22:11:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:42,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979409310] [2025-03-08 22:11:42,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:42,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:11:42,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:11:42,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:42,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979409310] [2025-03-08 22:11:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979409310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:42,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:42,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478043902] [2025-03-08 22:11:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:42,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:42,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:42,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:42,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 173 [2025-03-08 22:11:42,751 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-08 22:11:42,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:42,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 173 [2025-03-08 22:11:42,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:49,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([717] L1026-3-->L1026-1: Formula: (= |v_#race~data~0_6| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_6|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 59#L1026-1true, 157#L1027-3true, 213#true, 153#L1025true, 174#true, 208#true, 177#true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 58#L1044-2true, 176#true]) [2025-03-08 22:11:49,313 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2025-03-08 22:11:49,313 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-08 22:11:49,313 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-08 22:11:49,313 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-08 22:11:49,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([765] L1026-3-->L1026-1: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_6|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_6|} AuxVars[] AssignedVars[#race~data~0][211], [120#L1026-2true, Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 26#L1026-1true, 172#true, 59#L1026-1true, 213#true, 173#true, 208#true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 58#L1044-2true, 176#true, 178#true]) [2025-03-08 22:11:49,467 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-03-08 22:11:49,467 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-08 22:11:49,467 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-08 22:11:49,467 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-08 22:11:49,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([717] L1026-3-->L1026-1: Formula: (= |v_#race~data~0_6| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_6|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [30#L1026-1true, Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 33#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 59#L1026-1true, 213#true, 174#true, 177#true, 208#true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 58#L1044-2true, 176#true]) [2025-03-08 22:11:49,549 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-03-08 22:11:49,549 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-08 22:11:49,549 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-03-08 22:11:49,550 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event