./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc.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 2c4a731d968c8b3136fe56f501bb6493c1ca96e59709a347334934436fe70eb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:58:50,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:58:51,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:58:51,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:58:51,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:58:51,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:58:51,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:58:51,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:58:51,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:58:51,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:58:51,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:58:51,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:58:51,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:58:51,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:58:51,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:58:51,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:58:51,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:58:51,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:58:51,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:58:51,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:58:51,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:58:51,023 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 -> 2c4a731d968c8b3136fe56f501bb6493c1ca96e59709a347334934436fe70eb7 [2025-03-04 06:58:51,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:58:51,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:58:51,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:58:51,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:58:51,259 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:58:51,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc.i [2025-03-04 06:58:52,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539a257fb/4fd699e812334839a603b636e7f96293/FLAG61dc699e3 [2025-03-04 06:58:52,707 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:58:52,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc.i [2025-03-04 06:58:52,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539a257fb/4fd699e812334839a603b636e7f96293/FLAG61dc699e3 [2025-03-04 06:58:52,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539a257fb/4fd699e812334839a603b636e7f96293 [2025-03-04 06:58:52,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:58:52,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:58:52,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:58:52,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:58:52,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:58:52,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:58:52" (1/1) ... [2025-03-04 06:58:52,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72373dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:52, skipping insertion in model container [2025-03-04 06:58:52,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:58:52" (1/1) ... [2025-03-04 06:58:52,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:58:53,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:58:53,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:58:53,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:58:53,341 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:58:53,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53 WrapperNode [2025-03-04 06:58:53,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:58:53,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:58:53,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:58:53,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:58:53,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,366 INFO L138 Inliner]: procedures = 277, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-03-04 06:58:53,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:58:53,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:58:53,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:58:53,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:58:53,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:58:53,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:58:53,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:58:53,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:58:53,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (1/1) ... [2025-03-04 06:58:53,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:58:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:58:53,410 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-04 06:58:53,413 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-04 06:58:53,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:58:53,429 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:58:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:58:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:58:53,430 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:58:53,518 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:58:53,519 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:58:53,700 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:58:53,700 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:58:53,715 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:58:53,715 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:58:53,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:58:53 BoogieIcfgContainer [2025-03-04 06:58:53,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:58:53,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:58:53,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:58:53,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:58:53,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:58:52" (1/3) ... [2025-03-04 06:58:53,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ac1a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:58:53, skipping insertion in model container [2025-03-04 06:58:53,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:58:53" (2/3) ... [2025-03-04 06:58:53,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ac1a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:58:53, skipping insertion in model container [2025-03-04 06:58:53,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:58:53" (3/3) ... [2025-03-04 06:58:53,723 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc.i [2025-03-04 06:58:53,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:58:53,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-inc.i that has 2 procedures, 119 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-03-04 06:58:53,734 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:58:53,786 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:58:53,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 121 transitions, 249 flow [2025-03-04 06:58:53,863 INFO L124 PetriNetUnfolderBase]: 2/154 cut-off events. [2025-03-04 06:58:53,868 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:58:53,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 154 events. 2/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 246 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 70. Up to 3 conditions per place. [2025-03-04 06:58:53,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 121 transitions, 249 flow [2025-03-04 06:58:53,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 121 transitions, 249 flow [2025-03-04 06:58:53,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:58:53,888 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;@43a28771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:58:53,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 06:58:53,896 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:58:53,898 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-03-04 06:58:53,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:58:53,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:53,900 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] [2025-03-04 06:58:53,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 873849706, now seen corresponding path program 1 times [2025-03-04 06:58:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:53,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175496836] [2025-03-04 06:58:53,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:58:54,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:58:54,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:54,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:54,092 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-04 06:58:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175496836] [2025-03-04 06:58:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175496836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:54,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:54,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476760110] [2025-03-04 06:58:54,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:54,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:54,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:54,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:54,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2025-03-04 06:58:54,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-04 06:58:54,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:54,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2025-03-04 06:58:54,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:54,198 INFO L124 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-03-04 06:58:54,198 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:58:54,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 230 events. 7/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 587 event pairs, 6 based on Foata normal form. 1/203 useless extension candidates. Maximal degree in co-relation 172. Up to 25 conditions per place. [2025-03-04 06:58:54,200 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 10 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2025-03-04 06:58:54,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 119 transitions, 269 flow [2025-03-04 06:58:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-03-04 06:58:54,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228650137741047 [2025-03-04 06:58:54,210 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 249 flow. Second operand 3 states and 335 transitions. [2025-03-04 06:58:54,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 119 transitions, 269 flow [2025-03-04 06:58:54,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 269 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:54,217 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 247 flow [2025-03-04 06:58:54,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2025-03-04 06:58:54,222 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2025-03-04 06:58:54,223 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 247 flow [2025-03-04 06:58:54,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-04 06:58:54,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:54,223 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] [2025-03-04 06:58:54,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:58:54,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:54,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:54,225 INFO L85 PathProgramCache]: Analyzing trace with hash 680914424, now seen corresponding path program 1 times [2025-03-04 06:58:54,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:54,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048433132] [2025-03-04 06:58:54,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:54,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:54,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:58:54,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:58:54,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:54,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:54,311 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-04 06:58:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048433132] [2025-03-04 06:58:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048433132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:54,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:54,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:54,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361379646] [2025-03-04 06:58:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:54,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:54,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:54,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:54,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-03-04 06:58:54,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-04 06:58:54,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:54,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-03-04 06:58:54,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:54,376 INFO L124 PetriNetUnfolderBase]: 9/220 cut-off events. [2025-03-04 06:58:54,376 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:58:54,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 220 events. 9/220 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 512 event pairs, 3 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 217. Up to 24 conditions per place. [2025-03-04 06:58:54,380 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 11 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2025-03-04 06:58:54,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 277 flow [2025-03-04 06:58:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-04 06:58:54,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2025-03-04 06:58:54,382 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 247 flow. Second operand 3 states and 342 transitions. [2025-03-04 06:58:54,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 277 flow [2025-03-04 06:58:54,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:54,387 INFO L231 Difference]: Finished difference. Result has 121 places, 118 transitions, 253 flow [2025-03-04 06:58:54,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=121, PETRI_TRANSITIONS=118} [2025-03-04 06:58:54,388 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -1 predicate places. [2025-03-04 06:58:54,388 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 118 transitions, 253 flow [2025-03-04 06:58:54,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-04 06:58:54,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:54,388 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] [2025-03-04 06:58:54,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:58:54,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:54,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash 668431536, now seen corresponding path program 1 times [2025-03-04 06:58:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495025882] [2025-03-04 06:58:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:54,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:54,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:54,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:54,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:54,773 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-04 06:58:54,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:54,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495025882] [2025-03-04 06:58:54,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495025882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:54,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:54,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225700570] [2025-03-04 06:58:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:54,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:54,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:54,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:54,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 121 [2025-03-04 06:58:54,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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-04 06:58:54,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:54,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 121 [2025-03-04 06:58:54,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:55,053 INFO L124 PetriNetUnfolderBase]: 100/685 cut-off events. [2025-03-04 06:58:55,053 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:58:55,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 685 events. 100/685 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3769 event pairs, 52 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 850. Up to 195 conditions per place. [2025-03-04 06:58:55,057 INFO L140 encePairwiseOnDemand]: 110/121 looper letters, 33 selfloop transitions, 22 changer transitions 0/147 dead transitions. [2025-03-04 06:58:55,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 147 transitions, 421 flow [2025-03-04 06:58:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2025-03-04 06:58:55,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539944903581267 [2025-03-04 06:58:55,061 INFO L175 Difference]: Start difference. First operand has 121 places, 118 transitions, 253 flow. Second operand 6 states and 620 transitions. [2025-03-04 06:58:55,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 147 transitions, 421 flow [2025-03-04 06:58:55,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 147 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:55,064 INFO L231 Difference]: Finished difference. Result has 131 places, 139 transitions, 403 flow [2025-03-04 06:58:55,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=131, PETRI_TRANSITIONS=139} [2025-03-04 06:58:55,066 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2025-03-04 06:58:55,066 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 139 transitions, 403 flow [2025-03-04 06:58:55,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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-04 06:58:55,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:55,066 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] [2025-03-04 06:58:55,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:58:55,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:55,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1494456039, now seen corresponding path program 1 times [2025-03-04 06:58:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:55,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250408180] [2025-03-04 06:58:55,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:55,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:55,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:55,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:55,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:55,147 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-04 06:58:55,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250408180] [2025-03-04 06:58:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250408180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:55,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:55,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107366718] [2025-03-04 06:58:55,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:55,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:55,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:55,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 121 [2025-03-04 06:58:55,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 139 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 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-04 06:58:55,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:55,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 121 [2025-03-04 06:58:55,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:55,266 INFO L124 PetriNetUnfolderBase]: 48/376 cut-off events. [2025-03-04 06:58:55,266 INFO L125 PetriNetUnfolderBase]: For 38/48 co-relation queries the response was YES. [2025-03-04 06:58:55,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 376 events. 48/376 cut-off events. For 38/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1461 event pairs, 6 based on Foata normal form. 1/354 useless extension candidates. Maximal degree in co-relation 489. Up to 53 conditions per place. [2025-03-04 06:58:55,269 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 15 selfloop transitions, 2 changer transitions 5/146 dead transitions. [2025-03-04 06:58:55,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 146 transitions, 461 flow [2025-03-04 06:58:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-03-04 06:58:55,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8994490358126722 [2025-03-04 06:58:55,271 INFO L175 Difference]: Start difference. First operand has 131 places, 139 transitions, 403 flow. Second operand 6 states and 653 transitions. [2025-03-04 06:58:55,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 146 transitions, 461 flow [2025-03-04 06:58:55,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 146 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:55,276 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 421 flow [2025-03-04 06:58:55,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2025-03-04 06:58:55,277 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 18 predicate places. [2025-03-04 06:58:55,277 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 421 flow [2025-03-04 06:58:55,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 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-04 06:58:55,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:55,278 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] [2025-03-04 06:58:55,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:58:55,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash -307367179, now seen corresponding path program 1 times [2025-03-04 06:58:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315921645] [2025-03-04 06:58:55,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:55,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:58:55,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:58:55,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:55,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:55,329 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-04 06:58:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:55,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315921645] [2025-03-04 06:58:55,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315921645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:55,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:55,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333271498] [2025-03-04 06:58:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:55,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:55,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:55,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-03-04 06:58:55,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-04 06:58:55,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:55,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-03-04 06:58:55,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:55,378 INFO L124 PetriNetUnfolderBase]: 24/266 cut-off events. [2025-03-04 06:58:55,378 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-03-04 06:58:55,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 266 events. 24/266 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 871 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 360. Up to 49 conditions per place. [2025-03-04 06:58:55,379 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 7 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-03-04 06:58:55,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 137 transitions, 435 flow [2025-03-04 06:58:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-04 06:58:55,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-03-04 06:58:55,381 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 421 flow. Second operand 3 states and 338 transitions. [2025-03-04 06:58:55,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 137 transitions, 435 flow [2025-03-04 06:58:55,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 137 transitions, 421 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 06:58:55,387 INFO L231 Difference]: Finished difference. Result has 132 places, 137 transitions, 407 flow [2025-03-04 06:58:55,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=132, PETRI_TRANSITIONS=137} [2025-03-04 06:58:55,387 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2025-03-04 06:58:55,387 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 407 flow [2025-03-04 06:58:55,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-04 06:58:55,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:55,388 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] [2025-03-04 06:58:55,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:58:55,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:55,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1238309190, now seen corresponding path program 1 times [2025-03-04 06:58:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:55,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418665148] [2025-03-04 06:58:55,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:55,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:55,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:58:55,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:58:55,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:55,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:55,434 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-04 06:58:55,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:55,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418665148] [2025-03-04 06:58:55,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418665148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:55,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:55,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:55,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065490359] [2025-03-04 06:58:55,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:55,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:55,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:55,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:55,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:55,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-03-04 06:58:55,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 137 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-04 06:58:55,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:55,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-03-04 06:58:55,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:55,486 INFO L124 PetriNetUnfolderBase]: 24/265 cut-off events. [2025-03-04 06:58:55,486 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-03-04 06:58:55,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 265 events. 24/265 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 866 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 349. Up to 49 conditions per place. [2025-03-04 06:58:55,488 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 8 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-03-04 06:58:55,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 425 flow [2025-03-04 06:58:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-04 06:58:55,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-03-04 06:58:55,490 INFO L175 Difference]: Start difference. First operand has 132 places, 137 transitions, 407 flow. Second operand 3 states and 338 transitions. [2025-03-04 06:58:55,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 425 flow [2025-03-04 06:58:55,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:55,494 INFO L231 Difference]: Finished difference. Result has 131 places, 136 transitions, 405 flow [2025-03-04 06:58:55,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=131, PETRI_TRANSITIONS=136} [2025-03-04 06:58:55,496 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2025-03-04 06:58:55,496 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 136 transitions, 405 flow [2025-03-04 06:58:55,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-04 06:58:55,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:55,497 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] [2025-03-04 06:58:55,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:58:55,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1952550955, now seen corresponding path program 1 times [2025-03-04 06:58:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:55,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221816236] [2025-03-04 06:58:55,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:55,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:55,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:58:55,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:58:55,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:55,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:55,776 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-04 06:58:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221816236] [2025-03-04 06:58:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221816236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:55,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275704716] [2025-03-04 06:58:55,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:55,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:55,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:55,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 121 [2025-03-04 06:58:55,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 136 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-04 06:58:55,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:55,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 121 [2025-03-04 06:58:55,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:56,002 INFO L124 PetriNetUnfolderBase]: 104/614 cut-off events. [2025-03-04 06:58:56,002 INFO L125 PetriNetUnfolderBase]: For 107/109 co-relation queries the response was YES. [2025-03-04 06:58:56,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 614 events. 104/614 cut-off events. For 107/109 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3260 event pairs, 26 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1017. Up to 203 conditions per place. [2025-03-04 06:58:56,007 INFO L140 encePairwiseOnDemand]: 110/121 looper letters, 48 selfloop transitions, 21 changer transitions 7/166 dead transitions. [2025-03-04 06:58:56,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 166 transitions, 646 flow [2025-03-04 06:58:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2025-03-04 06:58:56,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8691460055096418 [2025-03-04 06:58:56,009 INFO L175 Difference]: Start difference. First operand has 131 places, 136 transitions, 405 flow. Second operand 6 states and 631 transitions. [2025-03-04 06:58:56,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 166 transitions, 646 flow [2025-03-04 06:58:56,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 166 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:56,013 INFO L231 Difference]: Finished difference. Result has 139 places, 151 transitions, 562 flow [2025-03-04 06:58:56,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=139, PETRI_TRANSITIONS=151} [2025-03-04 06:58:56,015 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2025-03-04 06:58:56,015 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 151 transitions, 562 flow [2025-03-04 06:58:56,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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-04 06:58:56,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:56,016 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:56,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:58:56,016 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-04 06:58:56,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash 562581900, now seen corresponding path program 1 times [2025-03-04 06:58:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:56,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716765863] [2025-03-04 06:58:56,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:56,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:56,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:58:56,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:58:56,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:56,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:58:56,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:58:56,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:58:56,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:58:56,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:56,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:58:56,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:58:56,071 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:58:56,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-04 06:58:56,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-04 06:58:56,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-04 06:58:56,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-04 06:58:56,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-04 06:58:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:58:56,075 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:56,077 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:58:56,078 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:58:56,104 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:58:56,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 161 transitions, 338 flow [2025-03-04 06:58:56,135 INFO L124 PetriNetUnfolderBase]: 4/262 cut-off events. [2025-03-04 06:58:56,135 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-04 06:58:56,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 262 events. 4/262 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 623 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 156. Up to 6 conditions per place. [2025-03-04 06:58:56,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 161 transitions, 338 flow [2025-03-04 06:58:56,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 161 transitions, 338 flow [2025-03-04 06:58:56,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:58:56,141 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;@43a28771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:58:56,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 06:58:56,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:58:56,143 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-03-04 06:58:56,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:58:56,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:56,144 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] [2025-03-04 06:58:56,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:56,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash 394213931, now seen corresponding path program 1 times [2025-03-04 06:58:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:56,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755790189] [2025-03-04 06:58:56,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:56,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:58:56,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:58:56,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:56,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:56,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-04 06:58:56,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755790189] [2025-03-04 06:58:56,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755790189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:56,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:56,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:56,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6682997] [2025-03-04 06:58:56,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:56,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:56,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:56,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:56,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-03-04 06:58:56,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-04 06:58:56,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:56,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-03-04 06:58:56,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:56,291 INFO L124 PetriNetUnfolderBase]: 81/1022 cut-off events. [2025-03-04 06:58:56,291 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 06:58:56,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 1022 events. 81/1022 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6420 event pairs, 78 based on Foata normal form. 1/888 useless extension candidates. Maximal degree in co-relation 874. Up to 162 conditions per place. [2025-03-04 06:58:56,297 INFO L140 encePairwiseOnDemand]: 157/161 looper letters, 15 selfloop transitions, 2 changer transitions 1/159 dead transitions. [2025-03-04 06:58:56,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 368 flow [2025-03-04 06:58:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2025-03-04 06:58:56,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9213250517598344 [2025-03-04 06:58:56,299 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 338 flow. Second operand 3 states and 445 transitions. [2025-03-04 06:58:56,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 368 flow [2025-03-04 06:58:56,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 159 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:56,301 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 336 flow [2025-03-04 06:58:56,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2025-03-04 06:58:56,302 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 1 predicate places. [2025-03-04 06:58:56,302 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 336 flow [2025-03-04 06:58:56,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-04 06:58:56,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:56,302 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] [2025-03-04 06:58:56,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:58:56,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:56,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:56,303 INFO L85 PathProgramCache]: Analyzing trace with hash -295435112, now seen corresponding path program 1 times [2025-03-04 06:58:56,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:56,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334200871] [2025-03-04 06:58:56,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:56,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:56,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:58:56,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:58:56,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:56,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:56,324 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-04 06:58:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334200871] [2025-03-04 06:58:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334200871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393392763] [2025-03-04 06:58:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:56,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:56,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:56,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:56,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-03-04 06:58:56,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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-04 06:58:56,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:56,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-03-04 06:58:56,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:56,448 INFO L124 PetriNetUnfolderBase]: 132/1100 cut-off events. [2025-03-04 06:58:56,448 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-04 06:58:56,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 1100 events. 132/1100 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6970 event pairs, 61 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1342. Up to 227 conditions per place. [2025-03-04 06:58:56,455 INFO L140 encePairwiseOnDemand]: 155/161 looper letters, 20 selfloop transitions, 3 changer transitions 0/163 dead transitions. [2025-03-04 06:58:56,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 163 transitions, 397 flow [2025-03-04 06:58:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2025-03-04 06:58:56,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2025-03-04 06:58:56,456 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 336 flow. Second operand 3 states and 452 transitions. [2025-03-04 06:58:56,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 163 transitions, 397 flow [2025-03-04 06:58:56,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:56,458 INFO L231 Difference]: Finished difference. Result has 161 places, 158 transitions, 347 flow [2025-03-04 06:58:56,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2025-03-04 06:58:56,459 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -2 predicate places. [2025-03-04 06:58:56,459 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 347 flow [2025-03-04 06:58:56,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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-04 06:58:56,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:56,460 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] [2025-03-04 06:58:56,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:58:56,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1300596880, now seen corresponding path program 1 times [2025-03-04 06:58:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89986389] [2025-03-04 06:58:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:56,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:56,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:56,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:56,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:56,677 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-04 06:58:56,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89986389] [2025-03-04 06:58:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89986389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462741277] [2025-03-04 06:58:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:56,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:56,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:56,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:56,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 161 [2025-03-04 06:58:56,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:56,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:56,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 161 [2025-03-04 06:58:56,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:57,408 INFO L124 PetriNetUnfolderBase]: 1885/6101 cut-off events. [2025-03-04 06:58:57,408 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-04 06:58:57,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9490 conditions, 6101 events. 1885/6101 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 56893 event pairs, 933 based on Foata normal form. 0/5505 useless extension candidates. Maximal degree in co-relation 5970. Up to 2653 conditions per place. [2025-03-04 06:58:57,440 INFO L140 encePairwiseOnDemand]: 146/161 looper letters, 50 selfloop transitions, 38 changer transitions 0/212 dead transitions. [2025-03-04 06:58:57,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 212 transitions, 636 flow [2025-03-04 06:58:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2025-03-04 06:58:57,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8747412008281573 [2025-03-04 06:58:57,443 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 347 flow. Second operand 6 states and 845 transitions. [2025-03-04 06:58:57,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 212 transitions, 636 flow [2025-03-04 06:58:57,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 212 transitions, 636 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:57,448 INFO L231 Difference]: Finished difference. Result has 171 places, 195 transitions, 601 flow [2025-03-04 06:58:57,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=171, PETRI_TRANSITIONS=195} [2025-03-04 06:58:57,449 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 8 predicate places. [2025-03-04 06:58:57,449 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 195 transitions, 601 flow [2025-03-04 06:58:57,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:57,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:57,450 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] [2025-03-04 06:58:57,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:58:57,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:57,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash -474572377, now seen corresponding path program 1 times [2025-03-04 06:58:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450893906] [2025-03-04 06:58:57,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:57,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:58:57,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:58:57,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:57,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:57,512 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-04 06:58:57,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450893906] [2025-03-04 06:58:57,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450893906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:57,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:57,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30633556] [2025-03-04 06:58:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:57,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:57,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:57,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:57,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:57,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 161 [2025-03-04 06:58:57,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 195 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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-04 06:58:57,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:57,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 161 [2025-03-04 06:58:57,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:57,944 INFO L124 PetriNetUnfolderBase]: 798/3928 cut-off events. [2025-03-04 06:58:57,944 INFO L125 PetriNetUnfolderBase]: For 449/680 co-relation queries the response was YES. [2025-03-04 06:58:57,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6350 conditions, 3928 events. 798/3928 cut-off events. For 449/680 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 35103 event pairs, 305 based on Foata normal form. 2/3565 useless extension candidates. Maximal degree in co-relation 3849. Up to 1048 conditions per place. [2025-03-04 06:58:57,968 INFO L140 encePairwiseOnDemand]: 153/161 looper letters, 20 selfloop transitions, 2 changer transitions 5/203 dead transitions. [2025-03-04 06:58:57,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 203 transitions, 671 flow [2025-03-04 06:58:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-03-04 06:58:57,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-04 06:58:57,972 INFO L175 Difference]: Start difference. First operand has 171 places, 195 transitions, 601 flow. Second operand 6 states and 874 transitions. [2025-03-04 06:58:57,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 203 transitions, 671 flow [2025-03-04 06:58:57,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 203 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:57,979 INFO L231 Difference]: Finished difference. Result has 180 places, 196 transitions, 623 flow [2025-03-04 06:58:57,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=623, PETRI_PLACES=180, PETRI_TRANSITIONS=196} [2025-03-04 06:58:57,980 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 17 predicate places. [2025-03-04 06:58:57,980 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 196 transitions, 623 flow [2025-03-04 06:58:57,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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-04 06:58:57,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:57,981 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] [2025-03-04 06:58:57,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:58:57,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:57,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1681716196, now seen corresponding path program 1 times [2025-03-04 06:58:57,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:57,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393111656] [2025-03-04 06:58:57,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:57,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:58:57,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:58:57,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:57,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:58,014 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-04 06:58:58,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393111656] [2025-03-04 06:58:58,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393111656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:58,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:58,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629335722] [2025-03-04 06:58:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:58,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:58,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:58,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:58,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2025-03-04 06:58:58,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 196 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-04 06:58:58,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:58,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2025-03-04 06:58:58,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:58,367 INFO L124 PetriNetUnfolderBase]: 873/3951 cut-off events. [2025-03-04 06:58:58,367 INFO L125 PetriNetUnfolderBase]: For 742/1083 co-relation queries the response was YES. [2025-03-04 06:58:58,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7130 conditions, 3951 events. 873/3951 cut-off events. For 742/1083 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 37719 event pairs, 171 based on Foata normal form. 1/3640 useless extension candidates. Maximal degree in co-relation 7031. Up to 1139 conditions per place. [2025-03-04 06:58:58,389 INFO L140 encePairwiseOnDemand]: 147/161 looper letters, 29 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2025-03-04 06:58:58,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 213 transitions, 746 flow [2025-03-04 06:58:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-03-04 06:58:58,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461697722567288 [2025-03-04 06:58:58,392 INFO L175 Difference]: Start difference. First operand has 180 places, 196 transitions, 623 flow. Second operand 3 states and 457 transitions. [2025-03-04 06:58:58,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 213 transitions, 746 flow [2025-03-04 06:58:58,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 213 transitions, 734 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 06:58:58,403 INFO L231 Difference]: Finished difference. Result has 177 places, 206 transitions, 699 flow [2025-03-04 06:58:58,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=177, PETRI_TRANSITIONS=206} [2025-03-04 06:58:58,404 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 14 predicate places. [2025-03-04 06:58:58,404 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 206 transitions, 699 flow [2025-03-04 06:58:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-04 06:58:58,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:58,405 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] [2025-03-04 06:58:58,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:58:58,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2044135777, now seen corresponding path program 1 times [2025-03-04 06:58:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:58,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276725998] [2025-03-04 06:58:58,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:58,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:58:58,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:58:58,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:58,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:58,438 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-04 06:58:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276725998] [2025-03-04 06:58:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276725998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:58,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444240023] [2025-03-04 06:58:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:58,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:58,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:58,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:58,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-03-04 06:58:58,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 206 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-04 06:58:58,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:58,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-03-04 06:58:58,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:58,818 INFO L124 PetriNetUnfolderBase]: 969/4505 cut-off events. [2025-03-04 06:58:58,818 INFO L125 PetriNetUnfolderBase]: For 1031/1422 co-relation queries the response was YES. [2025-03-04 06:58:58,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8235 conditions, 4505 events. 969/4505 cut-off events. For 1031/1422 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 44685 event pairs, 189 based on Foata normal form. 9/4161 useless extension candidates. Maximal degree in co-relation 7152. Up to 1280 conditions per place. [2025-03-04 06:58:58,843 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 26 selfloop transitions, 9 changer transitions 0/217 dead transitions. [2025-03-04 06:58:58,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 217 transitions, 815 flow [2025-03-04 06:58:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2025-03-04 06:58:58,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9399585921325052 [2025-03-04 06:58:58,845 INFO L175 Difference]: Start difference. First operand has 177 places, 206 transitions, 699 flow. Second operand 3 states and 454 transitions. [2025-03-04 06:58:58,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 217 transitions, 815 flow [2025-03-04 06:58:58,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 217 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:58,854 INFO L231 Difference]: Finished difference. Result has 179 places, 213 transitions, 755 flow [2025-03-04 06:58:58,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=179, PETRI_TRANSITIONS=213} [2025-03-04 06:58:58,856 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 16 predicate places. [2025-03-04 06:58:58,856 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 213 transitions, 755 flow [2025-03-04 06:58:58,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-04 06:58:58,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:58,857 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] [2025-03-04 06:58:58,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:58:58,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:58:58,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash -418793166, now seen corresponding path program 1 times [2025-03-04 06:58:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925699161] [2025-03-04 06:58:58,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:58,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:58:58,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:58:58,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:58,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:59,104 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-04 06:58:59,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925699161] [2025-03-04 06:58:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925699161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336150822] [2025-03-04 06:58:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:59,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:59,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:59,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:59,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 161 [2025-03-04 06:58:59,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 213 transitions, 755 flow. Second operand has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 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-04 06:58:59,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:59,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 161 [2025-03-04 06:58:59,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:00,419 INFO L124 PetriNetUnfolderBase]: 3463/12362 cut-off events. [2025-03-04 06:59:00,419 INFO L125 PetriNetUnfolderBase]: For 3171/3466 co-relation queries the response was YES. [2025-03-04 06:59:00,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25334 conditions, 12362 events. 3463/12362 cut-off events. For 3171/3466 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 138887 event pairs, 1210 based on Foata normal form. 8/11483 useless extension candidates. Maximal degree in co-relation 23198. Up to 4790 conditions per place. [2025-03-04 06:59:00,504 INFO L140 encePairwiseOnDemand]: 146/161 looper letters, 84 selfloop transitions, 38 changer transitions 0/268 dead transitions. [2025-03-04 06:59:00,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 268 transitions, 1179 flow [2025-03-04 06:59:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions. [2025-03-04 06:59:00,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861283643892339 [2025-03-04 06:59:00,506 INFO L175 Difference]: Start difference. First operand has 179 places, 213 transitions, 755 flow. Second operand 6 states and 856 transitions. [2025-03-04 06:59:00,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 268 transitions, 1179 flow [2025-03-04 06:59:00,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 268 transitions, 1161 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:00,523 INFO L231 Difference]: Finished difference. Result has 187 places, 250 transitions, 1055 flow [2025-03-04 06:59:00,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=187, PETRI_TRANSITIONS=250} [2025-03-04 06:59:00,523 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 24 predicate places. [2025-03-04 06:59:00,523 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 250 transitions, 1055 flow [2025-03-04 06:59:00,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 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-04 06:59:00,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:00,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:00,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:59:00,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:59:00,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1977511700, now seen corresponding path program 1 times [2025-03-04 06:59:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:00,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572471115] [2025-03-04 06:59:00,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:00,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:59:00,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:59:00,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:00,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:00,818 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-04 06:59:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572471115] [2025-03-04 06:59:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572471115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820576938] [2025-03-04 06:59:00,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:00,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:00,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:00,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:00,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:00,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 161 [2025-03-04 06:59:00,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 250 transitions, 1055 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 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-04 06:59:00,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:00,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 161 [2025-03-04 06:59:00,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:02,865 INFO L124 PetriNetUnfolderBase]: 6373/20044 cut-off events. [2025-03-04 06:59:02,866 INFO L125 PetriNetUnfolderBase]: For 9911/10230 co-relation queries the response was YES. [2025-03-04 06:59:02,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48823 conditions, 20044 events. 6373/20044 cut-off events. For 9911/10230 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 224567 event pairs, 1628 based on Foata normal form. 12/18655 useless extension candidates. Maximal degree in co-relation 42894. Up to 8149 conditions per place. [2025-03-04 06:59:03,038 INFO L140 encePairwiseOnDemand]: 142/161 looper letters, 139 selfloop transitions, 118 changer transitions 0/405 dead transitions. [2025-03-04 06:59:03,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 405 transitions, 2443 flow [2025-03-04 06:59:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2025-03-04 06:59:03,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-03-04 06:59:03,041 INFO L175 Difference]: Start difference. First operand has 187 places, 250 transitions, 1055 flow. Second operand 6 states and 882 transitions. [2025-03-04 06:59:03,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 405 transitions, 2443 flow [2025-03-04 06:59:03,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 405 transitions, 2311 flow, removed 66 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:03,104 INFO L231 Difference]: Finished difference. Result has 196 places, 362 transitions, 2121 flow [2025-03-04 06:59:03,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2121, PETRI_PLACES=196, PETRI_TRANSITIONS=362} [2025-03-04 06:59:03,105 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 33 predicate places. [2025-03-04 06:59:03,105 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 362 transitions, 2121 flow [2025-03-04 06:59:03,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 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-04 06:59:03,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:03,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:59:03,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:59:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2120949239, now seen corresponding path program 1 times [2025-03-04 06:59:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925807159] [2025-03-04 06:59:03,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:03,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:59:03,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:59:03,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:03,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:03,145 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-04 06:59:03,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:03,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925807159] [2025-03-04 06:59:03,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925807159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:03,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:03,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:03,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979242597] [2025-03-04 06:59:03,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:03,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:03,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:03,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:03,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:03,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-03-04 06:59:03,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 362 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-04 06:59:03,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:03,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-03-04 06:59:03,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:04,601 INFO L124 PetriNetUnfolderBase]: 4306/15228 cut-off events. [2025-03-04 06:59:04,601 INFO L125 PetriNetUnfolderBase]: For 11267/13099 co-relation queries the response was YES. [2025-03-04 06:59:04,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41782 conditions, 15228 events. 4306/15228 cut-off events. For 11267/13099 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 173197 event pairs, 356 based on Foata normal form. 12/14543 useless extension candidates. Maximal degree in co-relation 37680. Up to 3717 conditions per place. [2025-03-04 06:59:04,691 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 28 selfloop transitions, 11 changer transitions 0/372 dead transitions. [2025-03-04 06:59:04,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 372 transitions, 2236 flow [2025-03-04 06:59:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2025-03-04 06:59:04,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937888198757764 [2025-03-04 06:59:04,693 INFO L175 Difference]: Start difference. First operand has 196 places, 362 transitions, 2121 flow. Second operand 3 states and 453 transitions. [2025-03-04 06:59:04,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 372 transitions, 2236 flow [2025-03-04 06:59:04,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 372 transitions, 2200 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:04,857 INFO L231 Difference]: Finished difference. Result has 200 places, 369 transitions, 2173 flow [2025-03-04 06:59:04,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2173, PETRI_PLACES=200, PETRI_TRANSITIONS=369} [2025-03-04 06:59:04,857 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 37 predicate places. [2025-03-04 06:59:04,857 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 369 transitions, 2173 flow [2025-03-04 06:59:04,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-04 06:59:04,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:04,858 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:04,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:59:04,858 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:59:04,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash 174300950, now seen corresponding path program 1 times [2025-03-04 06:59:04,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:04,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157078417] [2025-03-04 06:59:04,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:04,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:04,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:59:04,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:59:04,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:04,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:04,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:59:04,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:59:04,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:59:04,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:04,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:59:04,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:59:04,897 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-04 06:59:04,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-04 06:59:04,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-04 06:59:04,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:59:04,898 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:59:04,899 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:59:04,899 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:59:04,917 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:59:04,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 201 transitions, 429 flow [2025-03-04 06:59:04,942 INFO L124 PetriNetUnfolderBase]: 9/421 cut-off events. [2025-03-04 06:59:04,943 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-03-04 06:59:04,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 421 events. 9/421 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1307 event pairs, 1 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2025-03-04 06:59:04,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 201 transitions, 429 flow [2025-03-04 06:59:04,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 201 transitions, 429 flow [2025-03-04 06:59:04,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:59:04,947 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;@43a28771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:59:04,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 06:59:04,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:59:04,948 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-03-04 06:59:04,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:59:04,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:04,949 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] [2025-03-04 06:59:04,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:04,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1529406996, now seen corresponding path program 1 times [2025-03-04 06:59:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803117256] [2025-03-04 06:59:04,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:04,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:59:04,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:59:04,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:04,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:04,966 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-04 06:59:04,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:04,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803117256] [2025-03-04 06:59:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803117256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:04,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663384041] [2025-03-04 06:59:04,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:04,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:04,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:04,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:04,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2025-03-04 06:59:04,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 201 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-04 06:59:04,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:04,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2025-03-04 06:59:04,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:05,369 INFO L124 PetriNetUnfolderBase]: 656/5099 cut-off events. [2025-03-04 06:59:05,369 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2025-03-04 06:59:05,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 5099 events. 656/5099 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 51026 event pairs, 643 based on Foata normal form. 1/4437 useless extension candidates. Maximal degree in co-relation 4712. Up to 1052 conditions per place. [2025-03-04 06:59:05,403 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 20 selfloop transitions, 2 changer transitions 1/199 dead transitions. [2025-03-04 06:59:05,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 199 transitions, 469 flow [2025-03-04 06:59:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-03-04 06:59:05,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2025-03-04 06:59:05,404 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 429 flow. Second operand 3 states and 555 transitions. [2025-03-04 06:59:05,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 199 transitions, 469 flow [2025-03-04 06:59:05,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 199 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:05,407 INFO L231 Difference]: Finished difference. Result has 205 places, 198 transitions, 427 flow [2025-03-04 06:59:05,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=205, PETRI_TRANSITIONS=198} [2025-03-04 06:59:05,407 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 1 predicate places. [2025-03-04 06:59:05,407 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 198 transitions, 427 flow [2025-03-04 06:59:05,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-04 06:59:05,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:05,408 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] [2025-03-04 06:59:05,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:59:05,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:05,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 993264696, now seen corresponding path program 1 times [2025-03-04 06:59:05,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:05,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312481089] [2025-03-04 06:59:05,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:05,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:59:05,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:59:05,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:05,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:05,427 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-04 06:59:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:05,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312481089] [2025-03-04 06:59:05,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312481089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:05,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:05,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828127524] [2025-03-04 06:59:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:05,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:05,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:05,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:05,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 201 [2025-03-04 06:59:05,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 198 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:05,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:05,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 201 [2025-03-04 06:59:05,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:05,998 INFO L124 PetriNetUnfolderBase]: 1275/6749 cut-off events. [2025-03-04 06:59:05,998 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2025-03-04 06:59:06,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8947 conditions, 6749 events. 1275/6749 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 69064 event pairs, 437 based on Foata normal form. 0/6232 useless extension candidates. Maximal degree in co-relation 8905. Up to 1872 conditions per place. [2025-03-04 06:59:06,041 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 29 selfloop transitions, 4 changer transitions 0/206 dead transitions. [2025-03-04 06:59:06,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 521 flow [2025-03-04 06:59:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2025-03-04 06:59:06,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320066334991708 [2025-03-04 06:59:06,044 INFO L175 Difference]: Start difference. First operand has 205 places, 198 transitions, 427 flow. Second operand 3 states and 562 transitions. [2025-03-04 06:59:06,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 521 flow [2025-03-04 06:59:06,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 206 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:06,046 INFO L231 Difference]: Finished difference. Result has 201 places, 198 transitions, 443 flow [2025-03-04 06:59:06,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=201, PETRI_TRANSITIONS=198} [2025-03-04 06:59:06,047 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -3 predicate places. [2025-03-04 06:59:06,047 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 198 transitions, 443 flow [2025-03-04 06:59:06,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:59:06,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:06,048 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] [2025-03-04 06:59:06,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:59:06,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:06,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 189343792, now seen corresponding path program 1 times [2025-03-04 06:59:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274850536] [2025-03-04 06:59:06,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:06,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:06,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:59:06,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:59:06,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:06,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:06,181 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-04 06:59:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274850536] [2025-03-04 06:59:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274850536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157441392] [2025-03-04 06:59:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:06,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:06,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:06,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:06,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201 [2025-03-04 06:59:06,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 198 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-04 06:59:06,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:06,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201 [2025-03-04 06:59:06,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:12,299 INFO L124 PetriNetUnfolderBase]: 24762/64711 cut-off events. [2025-03-04 06:59:12,300 INFO L125 PetriNetUnfolderBase]: For 2236/2236 co-relation queries the response was YES. [2025-03-04 06:59:12,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102379 conditions, 64711 events. 24762/64711 cut-off events. For 2236/2236 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 804748 event pairs, 14369 based on Foata normal form. 0/58481 useless extension candidates. Maximal degree in co-relation 62909. Up to 30792 conditions per place. [2025-03-04 06:59:12,668 INFO L140 encePairwiseOnDemand]: 182/201 looper letters, 67 selfloop transitions, 54 changer transitions 0/277 dead transitions. [2025-03-04 06:59:12,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 277 transitions, 855 flow [2025-03-04 06:59:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2025-03-04 06:59:12,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872305140961857 [2025-03-04 06:59:12,671 INFO L175 Difference]: Start difference. First operand has 201 places, 198 transitions, 443 flow. Second operand 6 states and 1070 transitions. [2025-03-04 06:59:12,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 277 transitions, 855 flow [2025-03-04 06:59:12,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 277 transitions, 855 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:12,677 INFO L231 Difference]: Finished difference. Result has 211 places, 251 transitions, 801 flow [2025-03-04 06:59:12,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=211, PETRI_TRANSITIONS=251} [2025-03-04 06:59:12,678 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 7 predicate places. [2025-03-04 06:59:12,678 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 251 transitions, 801 flow [2025-03-04 06:59:12,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-04 06:59:12,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:12,679 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] [2025-03-04 06:59:12,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:59:12,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:12,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1015368295, now seen corresponding path program 1 times [2025-03-04 06:59:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:12,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290712630] [2025-03-04 06:59:12,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:12,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:59:12,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:59:12,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:12,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:12,737 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-04 06:59:12,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290712630] [2025-03-04 06:59:12,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290712630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:12,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:12,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:12,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191670664] [2025-03-04 06:59:12,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:12,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:59:12,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:12,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:59:12,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:59:12,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2025-03-04 06:59:12,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 251 transitions, 801 flow. Second operand has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 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-04 06:59:12,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:12,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2025-03-04 06:59:12,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:16,136 INFO L124 PetriNetUnfolderBase]: 10026/35732 cut-off events. [2025-03-04 06:59:16,136 INFO L125 PetriNetUnfolderBase]: For 4884/6337 co-relation queries the response was YES. [2025-03-04 06:59:16,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59626 conditions, 35732 events. 10026/35732 cut-off events. For 4884/6337 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 441710 event pairs, 5453 based on Foata normal form. 1/32504 useless extension candidates. Maximal degree in co-relation 29058. Up to 12805 conditions per place. [2025-03-04 06:59:16,506 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 24 selfloop transitions, 2 changer transitions 5/259 dead transitions. [2025-03-04 06:59:16,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 259 transitions, 879 flow [2025-03-04 06:59:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:59:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:59:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2025-03-04 06:59:16,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071310116086235 [2025-03-04 06:59:16,508 INFO L175 Difference]: Start difference. First operand has 211 places, 251 transitions, 801 flow. Second operand 6 states and 1094 transitions. [2025-03-04 06:59:16,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 259 transitions, 879 flow [2025-03-04 06:59:16,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 259 transitions, 879 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:59:16,535 INFO L231 Difference]: Finished difference. Result has 220 places, 252 transitions, 823 flow [2025-03-04 06:59:16,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=823, PETRI_PLACES=220, PETRI_TRANSITIONS=252} [2025-03-04 06:59:16,535 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 16 predicate places. [2025-03-04 06:59:16,535 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 252 transitions, 823 flow [2025-03-04 06:59:16,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 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-04 06:59:16,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:16,536 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] [2025-03-04 06:59:16,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:59:16,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:16,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1649493227, now seen corresponding path program 1 times [2025-03-04 06:59:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132023773] [2025-03-04 06:59:16,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:16,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:59:16,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:59:16,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:16,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:16,553 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-04 06:59:16,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132023773] [2025-03-04 06:59:16,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132023773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:16,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:16,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:16,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090291285] [2025-03-04 06:59:16,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:16,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:16,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:16,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:16,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2025-03-04 06:59:16,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 252 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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-04 06:59:16,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:16,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2025-03-04 06:59:16,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:23,689 INFO L124 PetriNetUnfolderBase]: 20401/68963 cut-off events. [2025-03-04 06:59:23,689 INFO L125 PetriNetUnfolderBase]: For 17257/21258 co-relation queries the response was YES. [2025-03-04 06:59:24,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127316 conditions, 68963 events. 20401/68963 cut-off events. For 17257/21258 co-relation queries the response was YES. Maximal size of possible extension queue 2232. Compared 976593 event pairs, 5989 based on Foata normal form. 13/63354 useless extension candidates. Maximal degree in co-relation 127216. Up to 22357 conditions per place. [2025-03-04 06:59:24,378 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 44 selfloop transitions, 15 changer transitions 0/278 dead transitions. [2025-03-04 06:59:24,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 278 transitions, 1014 flow [2025-03-04 06:59:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2025-03-04 06:59:24,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386401326699834 [2025-03-04 06:59:24,380 INFO L175 Difference]: Start difference. First operand has 220 places, 252 transitions, 823 flow. Second operand 3 states and 566 transitions. [2025-03-04 06:59:24,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 278 transitions, 1014 flow [2025-03-04 06:59:25,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 278 transitions, 1002 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 06:59:25,116 INFO L231 Difference]: Finished difference. Result has 217 places, 267 transitions, 943 flow [2025-03-04 06:59:25,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=943, PETRI_PLACES=217, PETRI_TRANSITIONS=267} [2025-03-04 06:59:25,117 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 13 predicate places. [2025-03-04 06:59:25,117 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 267 transitions, 943 flow [2025-03-04 06:59:25,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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-04 06:59:25,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:25,117 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] [2025-03-04 06:59:25,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:59:25,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:25,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:25,118 INFO L85 PathProgramCache]: Analyzing trace with hash 976657840, now seen corresponding path program 1 times [2025-03-04 06:59:25,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:25,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962154662] [2025-03-04 06:59:25,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:25,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:25,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:59:25,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:59:25,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:25,139 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-04 06:59:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962154662] [2025-03-04 06:59:25,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962154662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:25,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:25,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:59:25,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747206974] [2025-03-04 06:59:25,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:25,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:59:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:25,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:59:25,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:59:25,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 201 [2025-03-04 06:59:25,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 267 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-04 06:59:25,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:25,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 201 [2025-03-04 06:59:25,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:59:33,917 INFO L124 PetriNetUnfolderBase]: 24088/85567 cut-off events. [2025-03-04 06:59:33,917 INFO L125 PetriNetUnfolderBase]: For 25217/30574 co-relation queries the response was YES. [2025-03-04 06:59:34,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160422 conditions, 85567 events. 24088/85567 cut-off events. For 25217/30574 co-relation queries the response was YES. Maximal size of possible extension queue 2810. Compared 1275505 event pairs, 7096 based on Foata normal form. 168/79026 useless extension candidates. Maximal degree in co-relation 132165. Up to 27395 conditions per place. [2025-03-04 06:59:34,777 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 40 selfloop transitions, 16 changer transitions 0/289 dead transitions. [2025-03-04 06:59:34,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 289 transitions, 1153 flow [2025-03-04 06:59:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:59:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:59:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2025-03-04 06:59:34,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2025-03-04 06:59:34,779 INFO L175 Difference]: Start difference. First operand has 217 places, 267 transitions, 943 flow. Second operand 3 states and 567 transitions. [2025-03-04 06:59:34,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 289 transitions, 1153 flow [2025-03-04 06:59:35,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 289 transitions, 1111 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:59:35,732 INFO L231 Difference]: Finished difference. Result has 219 places, 281 transitions, 1059 flow [2025-03-04 06:59:35,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=219, PETRI_TRANSITIONS=281} [2025-03-04 06:59:35,732 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 15 predicate places. [2025-03-04 06:59:35,732 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 281 transitions, 1059 flow [2025-03-04 06:59:35,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-04 06:59:35,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:59:35,733 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] [2025-03-04 06:59:35,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:59:35,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:59:35,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:59:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1957678177, now seen corresponding path program 1 times [2025-03-04 06:59:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:59:35,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081463194] [2025-03-04 06:59:35,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:59:35,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:59:35,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:59:35,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:59:35,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:59:35,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:59:35,938 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-04 06:59:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:59:35,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081463194] [2025-03-04 06:59:35,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081463194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:59:35,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:59:35,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:59:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451277552] [2025-03-04 06:59:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:59:35,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:59:35,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:59:35,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:59:35,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:59:36,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 201 [2025-03-04 06:59:36,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 281 transitions, 1059 flow. Second operand has 6 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 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-04 06:59:36,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:59:36,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 201 [2025-03-04 06:59:36,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand