./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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-lit/sssc12.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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:29:52,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:29:52,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:29:52,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:29:52,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:29:52,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:29:52,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:29:52,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:29:52,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:29:52,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:29:52,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:29:52,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:29:52,997 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:29:52,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:29:52,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:29:52,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:29:52,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:29:52,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:29:52,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:29:52,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:29:52,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:29:52,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:29:53,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:29:53,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:29:53,000 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-03-14 01:29:53,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:29:53,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:29:53,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:29:53,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:29:53,261 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:29:53,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-14 01:29:54,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be08f5b7/b764d4186a7c49118d70c9d3522cefe6/FLAG138e4f16b [2025-03-14 01:29:54,776 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:29:54,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-14 01:29:54,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be08f5b7/b764d4186a7c49118d70c9d3522cefe6/FLAG138e4f16b [2025-03-14 01:29:54,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be08f5b7/b764d4186a7c49118d70c9d3522cefe6 [2025-03-14 01:29:54,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:29:54,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:29:54,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:29:54,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:29:54,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:29:54,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:29:54" (1/1) ... [2025-03-14 01:29:54,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:54, skipping insertion in model container [2025-03-14 01:29:54,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:29:54" (1/1) ... [2025-03-14 01:29:54,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:29:55,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:29:55,216 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:29:55,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:29:55,294 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:29:55,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55 WrapperNode [2025-03-14 01:29:55,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:29:55,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:29:55,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:29:55,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:29:55,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,328 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-03-14 01:29:55,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:29:55,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:29:55,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:29:55,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:29:55,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:29:55,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:29:55,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:29:55,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:29:55,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (1/1) ... [2025-03-14 01:29:55,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:29:55,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:29:55,388 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-14 01:29:55,393 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-14 01:29:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-14 01:29:55,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-14 01:29:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:29:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:29:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:29:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:29:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:29:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:29:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:29:55,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:29:55,411 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:29:55,510 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:29:55,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:29:55,736 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:29:55,737 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:29:55,737 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:29:55,758 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:29:55,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:29:55 BoogieIcfgContainer [2025-03-14 01:29:55,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:29:55,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:29:55,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:29:55,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:29:55,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:29:54" (1/3) ... [2025-03-14 01:29:55,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad4e60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:29:55, skipping insertion in model container [2025-03-14 01:29:55,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:55" (2/3) ... [2025-03-14 01:29:55,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad4e60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:29:55, skipping insertion in model container [2025-03-14 01:29:55,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:29:55" (3/3) ... [2025-03-14 01:29:55,768 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-03-14 01:29:55,781 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:29:55,782 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 138 locations, 1 initial locations, 2 loop locations, and 14 error locations. [2025-03-14 01:29:55,784 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:29:55,852 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:29:55,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 145 transitions, 294 flow [2025-03-14 01:29:55,938 INFO L124 PetriNetUnfolderBase]: 7/153 cut-off events. [2025-03-14 01:29:55,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:55,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 153 events. 7/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-03-14 01:29:55,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 145 transitions, 294 flow [2025-03-14 01:29:55,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 145 transitions, 294 flow [2025-03-14 01:29:55,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:29:55,966 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;@40b7e1b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:29:55,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-14 01:29:55,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:29:55,976 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-14 01:29:55,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:55,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:55,977 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] [2025-03-14 01:29:55,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:29:55,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:55,985 INFO L85 PathProgramCache]: Analyzing trace with hash -594565006, now seen corresponding path program 1 times [2025-03-14 01:29:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:55,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024962227] [2025-03-14 01:29:55,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:55,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:56,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:29:56,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:29:56,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:56,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:56,168 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-14 01:29:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:56,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024962227] [2025-03-14 01:29:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024962227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:56,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:56,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118981953] [2025-03-14 01:29:56,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:56,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:56,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:56,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 145 [2025-03-14 01:29:56,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 145 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-14 01:29:56,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:56,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 145 [2025-03-14 01:29:56,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:56,288 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2025-03-14 01:29:56,288 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:29:56,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 4/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 11/129 useless extension candidates. Maximal degree in co-relation 76. Up to 11 conditions per place. [2025-03-14 01:29:56,290 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 10 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-03-14 01:29:56,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 296 flow [2025-03-14 01:29:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-14 01:29:56,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-03-14 01:29:56,309 INFO L175 Difference]: Start difference. First operand has 141 places, 145 transitions, 294 flow. Second operand 3 states and 395 transitions. [2025-03-14 01:29:56,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 296 flow [2025-03-14 01:29:56,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:29:56,350 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 274 flow [2025-03-14 01:29:56,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-03-14 01:29:56,359 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -6 predicate places. [2025-03-14 01:29:56,359 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 274 flow [2025-03-14 01:29:56,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-14 01:29:56,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:56,361 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] [2025-03-14 01:29:56,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:29:56,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:29:56,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:56,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1922132029, now seen corresponding path program 1 times [2025-03-14 01:29:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-03-14 01:29:56,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:56,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:56,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:29:56,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:29:56,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:56,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:56,435 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-14 01:29:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-03-14 01:29:56,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662798246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:56,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:56,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064476788] [2025-03-14 01:29:56,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:56,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:56,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:56,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:56,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2025-03-14 01:29:56,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-14 01:29:56,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:56,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2025-03-14 01:29:56,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:56,516 INFO L124 PetriNetUnfolderBase]: 4/135 cut-off events. [2025-03-14 01:29:56,516 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:29:56,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 135 events. 4/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 125. Up to 12 conditions per place. [2025-03-14 01:29:56,518 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-03-14 01:29:56,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 298 flow [2025-03-14 01:29:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-14 01:29:56,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8942528735632184 [2025-03-14 01:29:56,521 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 274 flow. Second operand 3 states and 389 transitions. [2025-03-14 01:29:56,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 298 flow [2025-03-14 01:29:56,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:56,526 INFO L231 Difference]: Finished difference. Result has 133 places, 132 transitions, 272 flow [2025-03-14 01:29:56,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2025-03-14 01:29:56,527 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-03-14 01:29:56,527 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 272 flow [2025-03-14 01:29:56,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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-14 01:29:56,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:56,528 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-14 01:29:56,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:29:56,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:29:56,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:56,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2136162261, now seen corresponding path program 1 times [2025-03-14 01:29:56,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:56,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918796432] [2025-03-14 01:29:56,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:56,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:56,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:29:56,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:29:56,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:56,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:56,589 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-14 01:29:56,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:56,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918796432] [2025-03-14 01:29:56,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918796432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:56,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:56,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:56,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174655211] [2025-03-14 01:29:56,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:56,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:56,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:56,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:56,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:56,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 145 [2025-03-14 01:29:56,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-14 01:29:56,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:56,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 145 [2025-03-14 01:29:56,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:56,656 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events. [2025-03-14 01:29:56,656 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:29:56,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 130 events. 4/130 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 113. Up to 13 conditions per place. [2025-03-14 01:29:56,657 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 13 selfloop transitions, 1 changer transitions 0/127 dead transitions. [2025-03-14 01:29:56,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 127 transitions, 290 flow [2025-03-14 01:29:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-03-14 01:29:56,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781609195402299 [2025-03-14 01:29:56,660 INFO L175 Difference]: Start difference. First operand has 133 places, 132 transitions, 272 flow. Second operand 3 states and 382 transitions. [2025-03-14 01:29:56,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 127 transitions, 290 flow [2025-03-14 01:29:56,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 127 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:56,662 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 260 flow [2025-03-14 01:29:56,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-03-14 01:29:56,664 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-03-14 01:29:56,664 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 260 flow [2025-03-14 01:29:56,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-14 01:29:56,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:56,665 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] [2025-03-14 01:29:56,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:29:56,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:29:56,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash 15897724, now seen corresponding path program 1 times [2025-03-14 01:29:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644482469] [2025-03-14 01:29:56,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:56,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:56,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:29:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:29:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:56,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:56,736 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-14 01:29:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:56,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644482469] [2025-03-14 01:29:56,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644482469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:56,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:56,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:56,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228590134] [2025-03-14 01:29:56,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:56,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:56,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:56,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:56,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 145 [2025-03-14 01:29:56,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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-14 01:29:56,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:56,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 145 [2025-03-14 01:29:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:56,784 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-14 01:29:56,784 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:29:56,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 4/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2025-03-14 01:29:56,785 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 7 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2025-03-14 01:29:56,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 276 flow [2025-03-14 01:29:56,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2025-03-14 01:29:56,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9126436781609195 [2025-03-14 01:29:56,786 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 260 flow. Second operand 3 states and 397 transitions. [2025-03-14 01:29:56,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 126 transitions, 276 flow [2025-03-14 01:29:56,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:29:56,788 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 261 flow [2025-03-14 01:29:56,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2025-03-14 01:29:56,789 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-03-14 01:29:56,789 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 261 flow [2025-03-14 01:29:56,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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-14 01:29:56,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:56,792 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:56,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:29:56,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:29:56,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:56,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2095279254, now seen corresponding path program 1 times [2025-03-14 01:29:56,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:56,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116761758] [2025-03-14 01:29:56,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:56,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:29:56,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:29:56,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:56,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:56,923 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-14 01:29:56,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116761758] [2025-03-14 01:29:56,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116761758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:56,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:56,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:29:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123579044] [2025-03-14 01:29:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:56,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:29:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:56,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:29:56,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:29:56,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 145 [2025-03-14 01:29:56,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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-14 01:29:56,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:56,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 145 [2025-03-14 01:29:56,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:57,015 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2025-03-14 01:29:57,015 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:29:57,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 132 events. 3/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2025-03-14 01:29:57,016 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 14 selfloop transitions, 0 changer transitions 4/129 dead transitions. [2025-03-14 01:29:57,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 303 flow [2025-03-14 01:29:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:29:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:29:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2025-03-14 01:29:57,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744827586206897 [2025-03-14 01:29:57,018 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 261 flow. Second operand 5 states and 634 transitions. [2025-03-14 01:29:57,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 303 flow [2025-03-14 01:29:57,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:57,021 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 261 flow [2025-03-14 01:29:57,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-03-14 01:29:57,022 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-03-14 01:29:57,022 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 261 flow [2025-03-14 01:29:57,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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-14 01:29:57,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:57,023 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:57,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:29:57,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:29:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1504439492, now seen corresponding path program 1 times [2025-03-14 01:29:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477711095] [2025-03-14 01:29:57,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:57,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:29:57,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:29:57,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:57,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:29:57,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:29:57,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:29:57,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:29:57,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:57,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:29:57,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:29:57,092 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:29:57,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-14 01:29:57,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-14 01:29:57,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-14 01:29:57,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-14 01:29:57,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-14 01:29:57,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-14 01:29:57,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-14 01:29:57,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-14 01:29:57,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-14 01:29:57,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-14 01:29:57,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-14 01:29:57,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-14 01:29:57,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-14 01:29:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:29:57,098 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-14 01:29:57,100 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:29:57,100 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:29:57,151 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:29:57,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 215 transitions, 440 flow [2025-03-14 01:29:57,180 INFO L124 PetriNetUnfolderBase]: 12/233 cut-off events. [2025-03-14 01:29:57,181 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:29:57,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 233 events. 12/233 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 509 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 154. Up to 3 conditions per place. [2025-03-14 01:29:57,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 215 transitions, 440 flow [2025-03-14 01:29:57,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 215 transitions, 440 flow [2025-03-14 01:29:57,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:29:57,185 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;@40b7e1b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:29:57,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-14 01:29:57,188 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:29:57,188 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-14 01:29:57,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:57,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:57,188 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] [2025-03-14 01:29:57,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:29:57,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash 356875689, now seen corresponding path program 1 times [2025-03-14 01:29:57,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:57,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766632866] [2025-03-14 01:29:57,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:57,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:29:57,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:29:57,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:57,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:57,217 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-14 01:29:57,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:57,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766632866] [2025-03-14 01:29:57,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766632866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:57,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:57,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601349274] [2025-03-14 01:29:57,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:57,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:57,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:57,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:57,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:57,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2025-03-14 01:29:57,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 215 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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-14 01:29:57,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:57,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2025-03-14 01:29:57,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:57,338 INFO L124 PetriNetUnfolderBase]: 70/670 cut-off events. [2025-03-14 01:29:57,338 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-14 01:29:57,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 670 events. 70/670 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3796 event pairs, 42 based on Foata normal form. 84/639 useless extension candidates. Maximal degree in co-relation 615. Up to 102 conditions per place. [2025-03-14 01:29:57,343 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 17 selfloop transitions, 2 changer transitions 1/200 dead transitions. [2025-03-14 01:29:57,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 448 flow [2025-03-14 01:29:57,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2025-03-14 01:29:57,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054263565891473 [2025-03-14 01:29:57,346 INFO L175 Difference]: Start difference. First operand has 208 places, 215 transitions, 440 flow. Second operand 3 states and 584 transitions. [2025-03-14 01:29:57,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 448 flow [2025-03-14 01:29:57,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:29:57,349 INFO L231 Difference]: Finished difference. Result has 200 places, 199 transitions, 412 flow [2025-03-14 01:29:57,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=200, PETRI_TRANSITIONS=199} [2025-03-14 01:29:57,349 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -8 predicate places. [2025-03-14 01:29:57,350 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 199 transitions, 412 flow [2025-03-14 01:29:57,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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-14 01:29:57,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:57,350 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] [2025-03-14 01:29:57,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:29:57,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:29:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2006252707, now seen corresponding path program 1 times [2025-03-14 01:29:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:57,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346586067] [2025-03-14 01:29:57,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:57,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:57,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:29:57,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:29:57,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:57,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:57,374 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-14 01:29:57,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:57,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346586067] [2025-03-14 01:29:57,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346586067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:57,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:57,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564347624] [2025-03-14 01:29:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:57,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:57,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:57,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:57,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:57,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-03-14 01:29:57,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-14 01:29:57,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:57,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-03-14 01:29:57,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:57,495 INFO L124 PetriNetUnfolderBase]: 42/526 cut-off events. [2025-03-14 01:29:57,496 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-14 01:29:57,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 526 events. 42/526 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2575 event pairs, 20 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 576. Up to 57 conditions per place. [2025-03-14 01:29:57,505 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 16 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-03-14 01:29:57,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 198 transitions, 446 flow [2025-03-14 01:29:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2025-03-14 01:29:57,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992248062015504 [2025-03-14 01:29:57,509 INFO L175 Difference]: Start difference. First operand has 200 places, 199 transitions, 412 flow. Second operand 3 states and 580 transitions. [2025-03-14 01:29:57,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 198 transitions, 446 flow [2025-03-14 01:29:57,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:57,513 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 410 flow [2025-03-14 01:29:57,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-03-14 01:29:57,515 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-03-14 01:29:57,515 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 410 flow [2025-03-14 01:29:57,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-14 01:29:57,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:57,515 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-14 01:29:57,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:29:57,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:29:57,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1961932619, now seen corresponding path program 1 times [2025-03-14 01:29:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580509314] [2025-03-14 01:29:57,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:57,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:29:57,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:29:57,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:57,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:57,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-14 01:29:57,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:57,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580509314] [2025-03-14 01:29:57,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580509314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:57,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:57,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:57,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000870968] [2025-03-14 01:29:57,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:57,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:57,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:57,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:57,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:57,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 215 [2025-03-14 01:29:57,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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-14 01:29:57,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:57,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 215 [2025-03-14 01:29:57,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:57,671 INFO L124 PetriNetUnfolderBase]: 82/808 cut-off events. [2025-03-14 01:29:57,671 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:29:57,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 808 events. 82/808 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4765 event pairs, 42 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 908. Up to 109 conditions per place. [2025-03-14 01:29:57,677 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 20 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2025-03-14 01:29:57,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 438 flow [2025-03-14 01:29:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2025-03-14 01:29:57,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2025-03-14 01:29:57,680 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 410 flow. Second operand 3 states and 565 transitions. [2025-03-14 01:29:57,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 438 flow [2025-03-14 01:29:57,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 191 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:57,683 INFO L231 Difference]: Finished difference. Result has 191 places, 191 transitions, 394 flow [2025-03-14 01:29:57,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=191, PETRI_TRANSITIONS=191} [2025-03-14 01:29:57,686 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-03-14 01:29:57,686 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 394 flow [2025-03-14 01:29:57,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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-14 01:29:57,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:57,687 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] [2025-03-14 01:29:57,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:29:57,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:29:57,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:57,687 INFO L85 PathProgramCache]: Analyzing trace with hash 978818140, now seen corresponding path program 1 times [2025-03-14 01:29:57,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:57,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966366340] [2025-03-14 01:29:57,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:57,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:29:57,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:29:57,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:57,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:57,733 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-14 01:29:57,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:57,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966366340] [2025-03-14 01:29:57,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966366340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:57,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770405668] [2025-03-14 01:29:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:57,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:57,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:57,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:57,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 215 [2025-03-14 01:29:57,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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-14 01:29:57,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:57,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 215 [2025-03-14 01:29:57,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:57,810 INFO L124 PetriNetUnfolderBase]: 31/442 cut-off events. [2025-03-14 01:29:57,810 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:29:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 442 events. 31/442 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1851 event pairs, 12 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 459. Up to 36 conditions per place. [2025-03-14 01:29:57,814 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 11 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-03-14 01:29:57,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 190 transitions, 418 flow [2025-03-14 01:29:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2025-03-14 01:29:57,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2025-03-14 01:29:57,816 INFO L175 Difference]: Start difference. First operand has 191 places, 191 transitions, 394 flow. Second operand 3 states and 590 transitions. [2025-03-14 01:29:57,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 190 transitions, 418 flow [2025-03-14 01:29:57,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:29:57,819 INFO L231 Difference]: Finished difference. Result has 191 places, 190 transitions, 395 flow [2025-03-14 01:29:57,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=191, PETRI_TRANSITIONS=190} [2025-03-14 01:29:57,820 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-03-14 01:29:57,820 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 190 transitions, 395 flow [2025-03-14 01:29:57,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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-14 01:29:57,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:57,820 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-14 01:29:57,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:29:57,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:29:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1859491102, now seen corresponding path program 1 times [2025-03-14 01:29:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124585032] [2025-03-14 01:29:57,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:57,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:29:57,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:29:57,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:57,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:57,872 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-14 01:29:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124585032] [2025-03-14 01:29:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124585032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844959558] [2025-03-14 01:29:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:57,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:57,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:57,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:57,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:57,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 215 [2025-03-14 01:29:57,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 190 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 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-14 01:29:57,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:57,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 215 [2025-03-14 01:29:57,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:58,063 INFO L124 PetriNetUnfolderBase]: 195/1595 cut-off events. [2025-03-14 01:29:58,063 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-14 01:29:58,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 1595 events. 195/1595 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12504 event pairs, 57 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 1885. Up to 204 conditions per place. [2025-03-14 01:29:58,073 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 32 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2025-03-14 01:29:58,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 209 transitions, 530 flow [2025-03-14 01:29:58,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2025-03-14 01:29:58,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178294573643411 [2025-03-14 01:29:58,075 INFO L175 Difference]: Start difference. First operand has 191 places, 190 transitions, 395 flow. Second operand 3 states and 592 transitions. [2025-03-14 01:29:58,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 209 transitions, 530 flow [2025-03-14 01:29:58,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 209 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:58,077 INFO L231 Difference]: Finished difference. Result has 193 places, 204 transitions, 515 flow [2025-03-14 01:29:58,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=193, PETRI_TRANSITIONS=204} [2025-03-14 01:29:58,079 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -15 predicate places. [2025-03-14 01:29:58,080 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 204 transitions, 515 flow [2025-03-14 01:29:58,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 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-14 01:29:58,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:58,080 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:58,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:29:58,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:29:58,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash -182745099, now seen corresponding path program 1 times [2025-03-14 01:29:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65036520] [2025-03-14 01:29:58,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:58,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:29:58,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:29:58,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:58,165 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-14 01:29:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:58,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65036520] [2025-03-14 01:29:58,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65036520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:58,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:58,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:29:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163686601] [2025-03-14 01:29:58,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:58,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:29:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:58,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:29:58,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:29:58,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-03-14 01:29:58,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 204 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 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-14 01:29:58,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:58,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-03-14 01:29:58,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:58,353 INFO L124 PetriNetUnfolderBase]: 130/1492 cut-off events. [2025-03-14 01:29:58,353 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-14 01:29:58,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 1492 events. 130/1492 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11585 event pairs, 41 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 1724. Up to 120 conditions per place. [2025-03-14 01:29:58,363 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 17 selfloop transitions, 0 changer transitions 4/207 dead transitions. [2025-03-14 01:29:58,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 207 transitions, 563 flow [2025-03-14 01:29:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:29:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:29:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 957 transitions. [2025-03-14 01:29:58,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8902325581395348 [2025-03-14 01:29:58,366 INFO L175 Difference]: Start difference. First operand has 193 places, 204 transitions, 515 flow. Second operand 5 states and 957 transitions. [2025-03-14 01:29:58,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 207 transitions, 563 flow [2025-03-14 01:29:58,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 207 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:58,370 INFO L231 Difference]: Finished difference. Result has 198 places, 203 transitions, 491 flow [2025-03-14 01:29:58,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=198, PETRI_TRANSITIONS=203} [2025-03-14 01:29:58,371 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-03-14 01:29:58,371 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 491 flow [2025-03-14 01:29:58,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 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-14 01:29:58,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:58,372 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:58,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:29:58,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-14 01:29:58,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash 468078738, now seen corresponding path program 1 times [2025-03-14 01:29:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930404339] [2025-03-14 01:29:58,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:58,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:29:58,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:29:58,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:58,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:29:58,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:29:58,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:29:58,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:29:58,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:29:58,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:29:58,405 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:29:58,405 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-03-14 01:29:58,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-14 01:29:58,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-14 01:29:58,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-14 01:29:58,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:29:58,407 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:58,407 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:29:58,407 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:29:58,447 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:29:58,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 285 transitions, 588 flow [2025-03-14 01:29:58,475 INFO L124 PetriNetUnfolderBase]: 17/313 cut-off events. [2025-03-14 01:29:58,475 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:29:58,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 313 events. 17/313 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 961 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 237. Up to 4 conditions per place. [2025-03-14 01:29:58,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 285 transitions, 588 flow [2025-03-14 01:29:58,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 285 transitions, 588 flow [2025-03-14 01:29:58,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:29:58,483 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;@40b7e1b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:29:58,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-14 01:29:58,485 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:29:58,485 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-14 01:29:58,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:58,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:58,486 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] [2025-03-14 01:29:58,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:29:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash -279688474, now seen corresponding path program 1 times [2025-03-14 01:29:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259799368] [2025-03-14 01:29:58,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:58,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:29:58,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:29:58,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:58,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:58,503 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-14 01:29:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:58,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259799368] [2025-03-14 01:29:58,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259799368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:58,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:58,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33717514] [2025-03-14 01:29:58,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:58,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:58,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:58,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:58,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 285 [2025-03-14 01:29:58,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-14 01:29:58,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:58,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 285 [2025-03-14 01:29:58,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:59,012 INFO L124 PetriNetUnfolderBase]: 829/4689 cut-off events. [2025-03-14 01:29:59,013 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-03-14 01:29:59,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 4689 events. 829/4689 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 48233 event pairs, 630 based on Foata normal form. 685/4575 useless extension candidates. Maximal degree in co-relation 4862. Up to 1033 conditions per place. [2025-03-14 01:29:59,061 INFO L140 encePairwiseOnDemand]: 274/285 looper letters, 24 selfloop transitions, 2 changer transitions 1/266 dead transitions. [2025-03-14 01:29:59,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2025-03-14 01:29:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-03-14 01:29:59,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.904093567251462 [2025-03-14 01:29:59,063 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 588 flow. Second operand 3 states and 773 transitions. [2025-03-14 01:29:59,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2025-03-14 01:29:59,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:29:59,068 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 550 flow [2025-03-14 01:29:59,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-03-14 01:29:59,069 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -10 predicate places. [2025-03-14 01:29:59,069 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 550 flow [2025-03-14 01:29:59,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-14 01:29:59,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:59,070 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] [2025-03-14 01:29:59,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:29:59,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:29:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash -821136963, now seen corresponding path program 1 times [2025-03-14 01:29:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:59,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910244021] [2025-03-14 01:29:59,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:59,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:29:59,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:29:59,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:59,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:59,095 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-14 01:29:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910244021] [2025-03-14 01:29:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910244021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:59,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:59,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798562503] [2025-03-14 01:29:59,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:59,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:59,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:59,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:59,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 285 [2025-03-14 01:29:59,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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-14 01:29:59,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:59,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 285 [2025-03-14 01:29:59,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:59,436 INFO L124 PetriNetUnfolderBase]: 335/2597 cut-off events. [2025-03-14 01:29:59,436 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-14 01:29:59,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 2597 events. 335/2597 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 23496 event pairs, 220 based on Foata normal form. 0/2136 useless extension candidates. Maximal degree in co-relation 3047. Up to 382 conditions per place. [2025-03-14 01:29:59,454 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-03-14 01:29:59,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 594 flow [2025-03-14 01:29:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2025-03-14 01:29:59,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017543859649123 [2025-03-14 01:29:59,457 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 550 flow. Second operand 3 states and 771 transitions. [2025-03-14 01:29:59,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 594 flow [2025-03-14 01:29:59,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:59,460 INFO L231 Difference]: Finished difference. Result has 263 places, 264 transitions, 548 flow [2025-03-14 01:29:59,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=263, PETRI_TRANSITIONS=264} [2025-03-14 01:29:59,461 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -12 predicate places. [2025-03-14 01:29:59,461 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 264 transitions, 548 flow [2025-03-14 01:29:59,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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-14 01:29:59,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:59,462 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-14 01:29:59,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:29:59,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:29:59,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:59,462 INFO L85 PathProgramCache]: Analyzing trace with hash -602249643, now seen corresponding path program 1 times [2025-03-14 01:29:59,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:59,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-03-14 01:29:59,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:59,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:29:59,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:29:59,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:59,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:59,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-14 01:29:59,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:59,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-03-14 01:29:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509785143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:59,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648858663] [2025-03-14 01:29:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:59,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:59,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:59,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:59,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 285 [2025-03-14 01:29:59,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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-14 01:29:59,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:59,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 285 [2025-03-14 01:29:59,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:00,075 INFO L124 PetriNetUnfolderBase]: 985/6367 cut-off events. [2025-03-14 01:30:00,076 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-03-14 01:30:00,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7666 conditions, 6367 events. 985/6367 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 69337 event pairs, 630 based on Foata normal form. 0/5355 useless extension candidates. Maximal degree in co-relation 7625. Up to 1120 conditions per place. [2025-03-14 01:30:00,184 INFO L140 encePairwiseOnDemand]: 275/285 looper letters, 27 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-03-14 01:30:00,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 255 transitions, 586 flow [2025-03-14 01:30:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-03-14 01:30:00,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748538011695907 [2025-03-14 01:30:00,186 INFO L175 Difference]: Start difference. First operand has 263 places, 264 transitions, 548 flow. Second operand 3 states and 748 transitions. [2025-03-14 01:30:00,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 255 transitions, 586 flow [2025-03-14 01:30:00,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 255 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:00,189 INFO L231 Difference]: Finished difference. Result has 254 places, 255 transitions, 528 flow [2025-03-14 01:30:00,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=254, PETRI_TRANSITIONS=255} [2025-03-14 01:30:00,190 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-03-14 01:30:00,190 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 255 transitions, 528 flow [2025-03-14 01:30:00,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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-14 01:30:00,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:00,191 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] [2025-03-14 01:30:00,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:30:00,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1140773124, now seen corresponding path program 1 times [2025-03-14 01:30:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:00,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-03-14 01:30:00,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:00,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:00,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:30:00,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:30:00,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:00,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:00,214 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-14 01:30:00,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:00,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-03-14 01:30:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394223177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:00,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033885436] [2025-03-14 01:30:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:00,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:00,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:00,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:00,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 285 [2025-03-14 01:30:00,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 255 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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-14 01:30:00,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:00,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 285 [2025-03-14 01:30:00,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:00,372 INFO L124 PetriNetUnfolderBase]: 190/1767 cut-off events. [2025-03-14 01:30:00,372 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-14 01:30:00,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1767 events. 190/1767 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13830 event pairs, 108 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 1992. Up to 196 conditions per place. [2025-03-14 01:30:00,387 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 15 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-03-14 01:30:00,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 560 flow [2025-03-14 01:30:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2025-03-14 01:30:00,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-03-14 01:30:00,389 INFO L175 Difference]: Start difference. First operand has 254 places, 255 transitions, 528 flow. Second operand 3 states and 783 transitions. [2025-03-14 01:30:00,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 560 flow [2025-03-14 01:30:00,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 254 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:30:00,392 INFO L231 Difference]: Finished difference. Result has 254 places, 254 transitions, 529 flow [2025-03-14 01:30:00,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=254, PETRI_TRANSITIONS=254} [2025-03-14 01:30:00,393 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-03-14 01:30:00,393 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 254 transitions, 529 flow [2025-03-14 01:30:00,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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-14 01:30:00,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:00,394 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-14 01:30:00,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:30:00,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:00,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:00,395 INFO L85 PathProgramCache]: Analyzing trace with hash 92832209, now seen corresponding path program 1 times [2025-03-14 01:30:00,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:00,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164491024] [2025-03-14 01:30:00,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:00,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:00,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:30:00,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:30:00,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:00,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:00,435 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-14 01:30:00,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:00,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164491024] [2025-03-14 01:30:00,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164491024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:00,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:00,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:00,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391311532] [2025-03-14 01:30:00,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:00,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:00,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:00,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:00,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:00,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 285 [2025-03-14 01:30:00,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 254 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-14 01:30:00,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:00,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 285 [2025-03-14 01:30:00,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:02,411 INFO L124 PetriNetUnfolderBase]: 4660/23982 cut-off events. [2025-03-14 01:30:02,411 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-14 01:30:02,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30441 conditions, 23982 events. 4660/23982 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 330653 event pairs, 1667 based on Foata normal form. 0/20559 useless extension candidates. Maximal degree in co-relation 30400. Up to 4132 conditions per place. [2025-03-14 01:30:02,569 INFO L140 encePairwiseOnDemand]: 255/285 looper letters, 48 selfloop transitions, 21 changer transitions 0/283 dead transitions. [2025-03-14 01:30:02,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 283 transitions, 735 flow [2025-03-14 01:30:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-03-14 01:30:02,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2025-03-14 01:30:02,571 INFO L175 Difference]: Start difference. First operand has 254 places, 254 transitions, 529 flow. Second operand 3 states and 780 transitions. [2025-03-14 01:30:02,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 283 transitions, 735 flow [2025-03-14 01:30:02,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 283 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:02,575 INFO L231 Difference]: Finished difference. Result has 256 places, 275 transitions, 711 flow [2025-03-14 01:30:02,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=256, PETRI_TRANSITIONS=275} [2025-03-14 01:30:02,576 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -19 predicate places. [2025-03-14 01:30:02,576 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 275 transitions, 711 flow [2025-03-14 01:30:02,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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-14 01:30:02,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:02,577 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:02,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:30:02,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash -355772001, now seen corresponding path program 1 times [2025-03-14 01:30:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:02,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693486112] [2025-03-14 01:30:02,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:02,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:02,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-14 01:30:02,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-14 01:30:02,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:02,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:02,652 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-14 01:30:02,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:02,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693486112] [2025-03-14 01:30:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693486112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:02,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:02,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692674396] [2025-03-14 01:30:02,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:02,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:30:02,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:02,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:30:02,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:30:02,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 285 [2025-03-14 01:30:02,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 275 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 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-14 01:30:02,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:02,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 285 [2025-03-14 01:30:02,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:03,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([814] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 241#thrENTRYtrue, 286#(= |#race~len~0| 0), 276#true, 274#true, 290#true, 272#true, 295#true, 119#L1060-1true]) [2025-03-14 01:30:03,291 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-14 01:30:03,291 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:30:03,291 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:30:03,291 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-14 01:30:03,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([814] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 276#true, 274#true, 259#L1040true, 290#true, 272#true, 295#true, 119#L1060-1true]) [2025-03-14 01:30:03,584 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:30:03,584 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:30:03,584 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-14 01:30:03,584 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-14 01:30:03,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][161], [171#L1045true, 225#L1043true, Black: 290#true, 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 276#true, 274#true, 272#true, 68#L1045true, 295#true, 119#L1060-1true]) [2025-03-14 01:30:03,880 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-03-14 01:30:03,880 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-14 01:30:03,880 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-14 01:30:03,880 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-03-14 01:30:03,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 276#true, 274#true, 286#(= |#race~len~0| 0), 290#true, 272#true, 68#L1045true, 295#true, 119#L1060-1true]) [2025-03-14 01:30:03,917 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-03-14 01:30:03,917 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:30:03,917 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:30:03,917 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:30:04,344 INFO L124 PetriNetUnfolderBase]: 2516/17384 cut-off events. [2025-03-14 01:30:04,345 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-03-14 01:30:04,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21905 conditions, 17384 events. 2516/17384 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 237586 event pairs, 1056 based on Foata normal form. 1/15063 useless extension candidates. Maximal degree in co-relation 21863. Up to 2203 conditions per place. [2025-03-14 01:30:04,534 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 20 selfloop transitions, 0 changer transitions 4/278 dead transitions. [2025-03-14 01:30:04,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 278 transitions, 765 flow [2025-03-14 01:30:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:30:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:30:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1280 transitions. [2025-03-14 01:30:04,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2025-03-14 01:30:04,538 INFO L175 Difference]: Start difference. First operand has 256 places, 275 transitions, 711 flow. Second operand 5 states and 1280 transitions. [2025-03-14 01:30:04,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 278 transitions, 765 flow [2025-03-14 01:30:04,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 278 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:04,563 INFO L231 Difference]: Finished difference. Result has 261 places, 274 transitions, 673 flow [2025-03-14 01:30:04,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=261, PETRI_TRANSITIONS=274} [2025-03-14 01:30:04,564 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -14 predicate places. [2025-03-14 01:30:04,564 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 274 transitions, 673 flow [2025-03-14 01:30:04,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 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-14 01:30:04,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:04,565 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:04,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:30:04,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:30:04,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1540855367, now seen corresponding path program 1 times [2025-03-14 01:30:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:04,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322857756] [2025-03-14 01:30:04,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:04,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:04,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-14 01:30:04,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:30:04,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:04,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:30:04,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:30:04,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-14 01:30:04,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:30:04,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:04,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:30:04,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:30:04,605 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:30:04,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-03-14 01:30:04,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-03-14 01:30:04,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-03-14 01:30:04,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2025-03-14 01:30:04,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-03-14 01:30:04,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-03-14 01:30:04,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-03-14 01:30:04,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-03-14 01:30:04,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-03-14 01:30:04,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-03-14 01:30:04,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2025-03-14 01:30:04,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:30:04,609 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:04,609 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:30:04,609 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:30:04,662 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:30:04,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 355 transitions, 738 flow [2025-03-14 01:30:04,717 INFO L124 PetriNetUnfolderBase]: 22/393 cut-off events. [2025-03-14 01:30:04,717 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:30:04,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 393 events. 22/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1429 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 321. Up to 5 conditions per place. [2025-03-14 01:30:04,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 342 places, 355 transitions, 738 flow [2025-03-14 01:30:04,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 355 transitions, 738 flow [2025-03-14 01:30:04,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:30:04,728 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;@40b7e1b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:30:04,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-14 01:30:04,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:30:04,729 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-14 01:30:04,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:30:04,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:04,730 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] [2025-03-14 01:30:04,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:30:04,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1790709801, now seen corresponding path program 1 times [2025-03-14 01:30:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:04,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406490952] [2025-03-14 01:30:04,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:04,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:30:04,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:30:04,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:04,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:04,753 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-14 01:30:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406490952] [2025-03-14 01:30:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406490952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:04,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:04,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:04,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362427900] [2025-03-14 01:30:04,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:04,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:04,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:04,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:04,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 355 [2025-03-14 01:30:04,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 355 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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-14 01:30:04,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:04,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 355 [2025-03-14 01:30:04,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:08,131 INFO L124 PetriNetUnfolderBase]: 8203/34874 cut-off events. [2025-03-14 01:30:08,132 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-03-14 01:30:08,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46423 conditions, 34874 events. 8203/34874 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 484657 event pairs, 6804 based on Foata normal form. 5566/34841 useless extension candidates. Maximal degree in co-relation 38089. Up to 9608 conditions per place. [2025-03-14 01:30:08,506 INFO L140 encePairwiseOnDemand]: 342/355 looper letters, 31 selfloop transitions, 2 changer transitions 1/332 dead transitions. [2025-03-14 01:30:08,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 332 transitions, 758 flow [2025-03-14 01:30:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-14 01:30:08,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-03-14 01:30:08,508 INFO L175 Difference]: Start difference. First operand has 342 places, 355 transitions, 738 flow. Second operand 3 states and 962 transitions. [2025-03-14 01:30:08,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 332 transitions, 758 flow [2025-03-14 01:30:08,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 332 transitions, 752 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 01:30:08,512 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 688 flow [2025-03-14 01:30:08,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-03-14 01:30:08,513 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -12 predicate places. [2025-03-14 01:30:08,513 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 688 flow [2025-03-14 01:30:08,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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-14 01:30:08,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:08,514 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] [2025-03-14 01:30:08,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:30:08,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:30:08,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1182511965, now seen corresponding path program 1 times [2025-03-14 01:30:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-03-14 01:30:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:08,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:30:08,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:30:08,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:08,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:08,533 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-14 01:30:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-03-14 01:30:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762076163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384588570] [2025-03-14 01:30:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:08,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:08,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:08,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:08,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 355 [2025-03-14 01:30:08,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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-14 01:30:08,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:08,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 355 [2025-03-14 01:30:08,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:10,216 INFO L124 PetriNetUnfolderBase]: 2303/13468 cut-off events. [2025-03-14 01:30:10,216 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-03-14 01:30:10,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16452 conditions, 13468 events. 2303/13468 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 168630 event pairs, 1720 based on Foata normal form. 0/11135 useless extension candidates. Maximal degree in co-relation 16418. Up to 2507 conditions per place. [2025-03-14 01:30:10,443 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 26 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-03-14 01:30:10,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 330 transitions, 742 flow [2025-03-14 01:30:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-14 01:30:10,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-03-14 01:30:10,446 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 688 flow. Second operand 3 states and 962 transitions. [2025-03-14 01:30:10,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 330 transitions, 742 flow [2025-03-14 01:30:10,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 330 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:10,451 INFO L231 Difference]: Finished difference. Result has 328 places, 330 transitions, 686 flow [2025-03-14 01:30:10,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=328, PETRI_TRANSITIONS=330} [2025-03-14 01:30:10,452 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -14 predicate places. [2025-03-14 01:30:10,452 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 330 transitions, 686 flow [2025-03-14 01:30:10,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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-14 01:30:10,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:10,452 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-14 01:30:10,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:30:10,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:30:10,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1920243893, now seen corresponding path program 1 times [2025-03-14 01:30:10,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:10,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184514898] [2025-03-14 01:30:10,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:10,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:30:10,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:30:10,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:10,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:10,473 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-14 01:30:10,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184514898] [2025-03-14 01:30:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184514898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:10,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:10,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:10,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60779270] [2025-03-14 01:30:10,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:10,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:10,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:10,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:10,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 355 [2025-03-14 01:30:10,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 330 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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-14 01:30:10,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:10,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 355 [2025-03-14 01:30:10,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:15,881 INFO L124 PetriNetUnfolderBase]: 9761/49199 cut-off events. [2025-03-14 01:30:15,881 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2025-03-14 01:30:16,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61006 conditions, 49199 events. 9761/49199 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 737369 event pairs, 6804 based on Foata normal form. 0/41396 useless extension candidates. Maximal degree in co-relation 60964. Up to 10598 conditions per place. [2025-03-14 01:30:16,722 INFO L140 encePairwiseOnDemand]: 343/355 looper letters, 34 selfloop transitions, 1 changer transitions 0/319 dead transitions. [2025-03-14 01:30:16,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 734 flow [2025-03-14 01:30:16,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 931 transitions. [2025-03-14 01:30:16,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8741784037558685 [2025-03-14 01:30:16,724 INFO L175 Difference]: Start difference. First operand has 328 places, 330 transitions, 686 flow. Second operand 3 states and 931 transitions. [2025-03-14 01:30:16,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 734 flow [2025-03-14 01:30:16,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 319 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:16,727 INFO L231 Difference]: Finished difference. Result has 317 places, 319 transitions, 662 flow [2025-03-14 01:30:16,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=317, PETRI_TRANSITIONS=319} [2025-03-14 01:30:16,728 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-03-14 01:30:16,728 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 319 transitions, 662 flow [2025-03-14 01:30:16,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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-14 01:30:16,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:16,729 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] [2025-03-14 01:30:16,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:30:16,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:30:16,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2047908772, now seen corresponding path program 1 times [2025-03-14 01:30:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:16,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902886044] [2025-03-14 01:30:16,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:16,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:16,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:30:16,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:30:16,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:16,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:30:16,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902886044] [2025-03-14 01:30:16,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902886044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:16,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:16,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:16,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332955174] [2025-03-14 01:30:16,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:16,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:16,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:16,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:16,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 355 [2025-03-14 01:30:16,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 319 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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-14 01:30:16,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:16,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 355 [2025-03-14 01:30:16,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:17,928 INFO L124 PetriNetUnfolderBase]: 1021/7284 cut-off events. [2025-03-14 01:30:17,928 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-03-14 01:30:17,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8575 conditions, 7284 events. 1021/7284 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 80143 event pairs, 684 based on Foata normal form. 0/6099 useless extension candidates. Maximal degree in co-relation 8533. Up to 1028 conditions per place. [2025-03-14 01:30:17,992 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 19 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-14 01:30:17,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 702 flow [2025-03-14 01:30:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2025-03-14 01:30:17,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164319248826291 [2025-03-14 01:30:17,994 INFO L175 Difference]: Start difference. First operand has 317 places, 319 transitions, 662 flow. Second operand 3 states and 976 transitions. [2025-03-14 01:30:17,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 318 transitions, 702 flow [2025-03-14 01:30:17,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:30:17,998 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 663 flow [2025-03-14 01:30:17,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2025-03-14 01:30:17,998 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-03-14 01:30:17,999 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 663 flow [2025-03-14 01:30:17,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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-14 01:30:17,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:17,999 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-14 01:30:17,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:30:17,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-14 01:30:18,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:18,000 INFO L85 PathProgramCache]: Analyzing trace with hash -259623793, now seen corresponding path program 1 times [2025-03-14 01:30:18,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:18,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160353192] [2025-03-14 01:30:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:18,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:18,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:30:18,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:30:18,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:18,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:18,032 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-14 01:30:18,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160353192] [2025-03-14 01:30:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160353192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:18,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:18,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309641721] [2025-03-14 01:30:18,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:18,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:18,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:18,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:18,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:18,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 355 [2025-03-14 01:30:18,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 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-14 01:30:18,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:18,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 355 [2025-03-14 01:30:18,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand