./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/sssc12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:10:26,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:10:26,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:10:26,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:10:26,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:10:26,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:10:26,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:10:26,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:10:26,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:10:26,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:10:26,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:10:26,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:10:26,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:10:26,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:10:26,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:10:26,310 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-03-13 22:10:26,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:10:26,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:10:26,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:10:26,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:10:26,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:10:26,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-13 22:10:27,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390014853/4a6687e4dbb544f3b09fa2853ee76e6f/FLAG57606e7a7 [2025-03-13 22:10:27,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:10:27,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-13 22:10:28,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390014853/4a6687e4dbb544f3b09fa2853ee76e6f/FLAG57606e7a7 [2025-03-13 22:10:28,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390014853/4a6687e4dbb544f3b09fa2853ee76e6f [2025-03-13 22:10:28,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:10:28,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:10:28,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:10:28,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:10:28,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:10:28,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c722eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28, skipping insertion in model container [2025-03-13 22:10:28,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:10:28,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:10:28,367 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:10:28,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:10:28,447 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:10:28,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28 WrapperNode [2025-03-13 22:10:28,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:10:28,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:10:28,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:10:28,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:10:28,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,481 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-03-13 22:10:28,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:10:28,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:10:28,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:10:28,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:10:28,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:10:28,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:10:28,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:10:28,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:10:28,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (1/1) ... [2025-03-13 22:10:28,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:10:28,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:10:28,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:10:28,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:10:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-13 22:10:28,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-13 22:10:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:10:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:10:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:10:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:10:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:10:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:10:28,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:10:28,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:10:28,553 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:10:28,640 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:10:28,641 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:10:28,856 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:10:28,857 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:10:28,857 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:10:28,877 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:10:28,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:10:28 BoogieIcfgContainer [2025-03-13 22:10:28,880 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:10:28,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:10:28,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:10:28,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:10:28,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:10:28" (1/3) ... [2025-03-13 22:10:28,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3f8bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:10:28, skipping insertion in model container [2025-03-13 22:10:28,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:10:28" (2/3) ... [2025-03-13 22:10:28,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3f8bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:10:28, skipping insertion in model container [2025-03-13 22:10:28,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:10:28" (3/3) ... [2025-03-13 22:10:28,887 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-03-13 22:10:28,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:10:28,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 138 locations, 1 initial locations, 2 loop locations, and 14 error locations. [2025-03-13 22:10:28,898 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:10:28,951 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:10:28,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 145 transitions, 294 flow [2025-03-13 22:10:29,015 INFO L124 PetriNetUnfolderBase]: 7/153 cut-off events. [2025-03-13 22:10:29,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:10:29,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 153 events. 7/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-03-13 22:10:29,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 145 transitions, 294 flow [2025-03-13 22:10:29,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 145 transitions, 294 flow [2025-03-13 22:10:29,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:10:29,050 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;@148e4bd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:10:29,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-13 22:10:29,055 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:10:29,056 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-13 22:10:29,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:10:29,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:29,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:29,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-13 22:10:29,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash -594565006, now seen corresponding path program 1 times [2025-03-13 22:10:29,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:29,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445178927] [2025-03-13 22:10:29,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:29,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:29,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:10:29,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:10:29,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:29,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:29,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445178927] [2025-03-13 22:10:29,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445178927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:29,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:29,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145411668] [2025-03-13 22:10:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:29,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:29,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:29,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 145 [2025-03-13 22:10:29,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 145 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:29,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 145 [2025-03-13 22:10:29,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:29,305 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2025-03-13 22:10:29,305 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:10:29,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 4/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 11/129 useless extension candidates. Maximal degree in co-relation 76. Up to 11 conditions per place. [2025-03-13 22:10:29,306 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 10 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-03-13 22:10:29,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 296 flow [2025-03-13 22:10:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-13 22:10:29,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-03-13 22:10:29,319 INFO L175 Difference]: Start difference. First operand has 141 places, 145 transitions, 294 flow. Second operand 3 states and 395 transitions. [2025-03-13 22:10:29,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 296 flow [2025-03-13 22:10:29,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:10:29,350 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 274 flow [2025-03-13 22:10:29,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-03-13 22:10:29,359 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -6 predicate places. [2025-03-13 22:10:29,359 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 274 flow [2025-03-13 22:10:29,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:29,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:29,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:10:29,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-13 22:10:29,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1922132029, now seen corresponding path program 1 times [2025-03-13 22:10:29,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:29,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888640017] [2025-03-13 22:10:29,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:29,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:10:29,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:10:29,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:29,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888640017] [2025-03-13 22:10:29,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888640017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:29,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173589934] [2025-03-13 22:10:29,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:29,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:29,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:29,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:29,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2025-03-13 22:10:29,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:29,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2025-03-13 22:10:29,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:29,523 INFO L124 PetriNetUnfolderBase]: 4/135 cut-off events. [2025-03-13 22:10:29,523 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:10:29,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 135 events. 4/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 125. Up to 12 conditions per place. [2025-03-13 22:10:29,524 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-03-13 22:10:29,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 298 flow [2025-03-13 22:10:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-13 22:10:29,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8942528735632184 [2025-03-13 22:10:29,529 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 274 flow. Second operand 3 states and 389 transitions. [2025-03-13 22:10:29,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 298 flow [2025-03-13 22:10:29,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:29,534 INFO L231 Difference]: Finished difference. Result has 133 places, 132 transitions, 272 flow [2025-03-13 22:10:29,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2025-03-13 22:10:29,536 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-03-13 22:10:29,536 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 272 flow [2025-03-13 22:10:29,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:29,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:29,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:10:29,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-13 22:10:29,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2136162261, now seen corresponding path program 1 times [2025-03-13 22:10:29,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:29,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543715727] [2025-03-13 22:10:29,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:29,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:10:29,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:10:29,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:29,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543715727] [2025-03-13 22:10:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543715727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:29,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:29,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499270618] [2025-03-13 22:10:29,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:29,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:29,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:29,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:29,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 145 [2025-03-13 22:10:29,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:29,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 145 [2025-03-13 22:10:29,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:29,644 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events. [2025-03-13 22:10:29,645 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:10:29,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 130 events. 4/130 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 113. Up to 13 conditions per place. [2025-03-13 22:10:29,645 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 13 selfloop transitions, 1 changer transitions 0/127 dead transitions. [2025-03-13 22:10:29,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 127 transitions, 290 flow [2025-03-13 22:10:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-03-13 22:10:29,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781609195402299 [2025-03-13 22:10:29,647 INFO L175 Difference]: Start difference. First operand has 133 places, 132 transitions, 272 flow. Second operand 3 states and 382 transitions. [2025-03-13 22:10:29,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 127 transitions, 290 flow [2025-03-13 22:10:29,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 127 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:29,649 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 260 flow [2025-03-13 22:10:29,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-03-13 22:10:29,650 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-03-13 22:10:29,650 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 260 flow [2025-03-13 22:10:29,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:29,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:29,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:10:29,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-13 22:10:29,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 15897724, now seen corresponding path program 1 times [2025-03-13 22:10:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513429610] [2025-03-13 22:10:29,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:29,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:29,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:10:29,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:10:29,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513429610] [2025-03-13 22:10:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513429610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:29,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641326772] [2025-03-13 22:10:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:29,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:29,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:29,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:29,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 145 [2025-03-13 22:10:29,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:29,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 145 [2025-03-13 22:10:29,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:29,770 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-13 22:10:29,770 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:10:29,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 4/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2025-03-13 22:10:29,775 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 7 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2025-03-13 22:10:29,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 276 flow [2025-03-13 22:10:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2025-03-13 22:10:29,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9126436781609195 [2025-03-13 22:10:29,776 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 260 flow. Second operand 3 states and 397 transitions. [2025-03-13 22:10:29,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 126 transitions, 276 flow [2025-03-13 22:10:29,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:10:29,780 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 261 flow [2025-03-13 22:10:29,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2025-03-13 22:10:29,781 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-03-13 22:10:29,782 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 261 flow [2025-03-13 22:10:29,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:29,782 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:29,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:10:29,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-13 22:10:29,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2095279254, now seen corresponding path program 1 times [2025-03-13 22:10:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:29,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102382802] [2025-03-13 22:10:29,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:29,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:10:29,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:10:29,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:29,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:29,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102382802] [2025-03-13 22:10:29,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102382802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:29,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:29,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697392888] [2025-03-13 22:10:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:29,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:10:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:29,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:10:29,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:10:29,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 145 [2025-03-13 22:10:29,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:29,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:29,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 145 [2025-03-13 22:10:29,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:29,987 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2025-03-13 22:10:29,989 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:10:29,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 132 events. 3/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2025-03-13 22:10:29,990 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 14 selfloop transitions, 0 changer transitions 4/129 dead transitions. [2025-03-13 22:10:29,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 303 flow [2025-03-13 22:10:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:10:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:10:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2025-03-13 22:10:29,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744827586206897 [2025-03-13 22:10:29,994 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 261 flow. Second operand 5 states and 634 transitions. [2025-03-13 22:10:29,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 303 flow [2025-03-13 22:10:29,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:29,998 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 261 flow [2025-03-13 22:10:29,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-03-13 22:10:30,000 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-03-13 22:10:30,001 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 261 flow [2025-03-13 22:10:30,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:30,003 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:10:30,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-13 22:10:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1504439492, now seen corresponding path program 1 times [2025-03-13 22:10:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698067444] [2025-03-13 22:10:30,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:30,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:10:30,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:10:30,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:30,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:10:30,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:10:30,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:10:30,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:10:30,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:10:30,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:10:30,071 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:10:30,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-13 22:10:30,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-13 22:10:30,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-13 22:10:30,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-13 22:10:30,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-13 22:10:30,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-13 22:10:30,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-13 22:10:30,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-13 22:10:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-13 22:10:30,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:10:30,077 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-13 22:10:30,079 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:10:30,079 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:10:30,149 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:10:30,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 215 transitions, 440 flow [2025-03-13 22:10:30,178 INFO L124 PetriNetUnfolderBase]: 12/233 cut-off events. [2025-03-13 22:10:30,178 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:10:30,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 233 events. 12/233 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 509 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 154. Up to 3 conditions per place. [2025-03-13 22:10:30,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 215 transitions, 440 flow [2025-03-13 22:10:30,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 215 transitions, 440 flow [2025-03-13 22:10:30,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:10:30,186 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;@148e4bd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:10:30,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-13 22:10:30,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:10:30,189 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-13 22:10:30,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:10:30,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:30,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:30,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:10:30,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash 356875689, now seen corresponding path program 1 times [2025-03-13 22:10:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218834893] [2025-03-13 22:10:30,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:30,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:30,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:10:30,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:10:30,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:30,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:30,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218834893] [2025-03-13 22:10:30,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218834893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:30,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:30,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844871299] [2025-03-13 22:10:30,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:30,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:30,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:30,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:30,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2025-03-13 22:10:30,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 215 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:30,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2025-03-13 22:10:30,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:30,348 INFO L124 PetriNetUnfolderBase]: 70/670 cut-off events. [2025-03-13 22:10:30,348 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-13 22:10:30,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 670 events. 70/670 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3796 event pairs, 42 based on Foata normal form. 84/639 useless extension candidates. Maximal degree in co-relation 615. Up to 102 conditions per place. [2025-03-13 22:10:30,356 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 17 selfloop transitions, 2 changer transitions 1/200 dead transitions. [2025-03-13 22:10:30,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 448 flow [2025-03-13 22:10:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2025-03-13 22:10:30,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054263565891473 [2025-03-13 22:10:30,360 INFO L175 Difference]: Start difference. First operand has 208 places, 215 transitions, 440 flow. Second operand 3 states and 584 transitions. [2025-03-13 22:10:30,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 448 flow [2025-03-13 22:10:30,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:10:30,363 INFO L231 Difference]: Finished difference. Result has 200 places, 199 transitions, 412 flow [2025-03-13 22:10:30,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=200, PETRI_TRANSITIONS=199} [2025-03-13 22:10:30,365 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -8 predicate places. [2025-03-13 22:10:30,365 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 199 transitions, 412 flow [2025-03-13 22:10:30,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:30,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:30,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:10:30,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:10:30,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2006252707, now seen corresponding path program 1 times [2025-03-13 22:10:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659410708] [2025-03-13 22:10:30,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:30,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:10:30,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:10:30,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:30,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659410708] [2025-03-13 22:10:30,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659410708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:30,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:30,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426611504] [2025-03-13 22:10:30,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:30,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:30,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:30,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:30,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-03-13 22:10:30,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:30,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-03-13 22:10:30,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:30,499 INFO L124 PetriNetUnfolderBase]: 42/526 cut-off events. [2025-03-13 22:10:30,499 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-13 22:10:30,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 526 events. 42/526 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2575 event pairs, 20 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 576. Up to 57 conditions per place. [2025-03-13 22:10:30,505 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 16 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-03-13 22:10:30,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 198 transitions, 446 flow [2025-03-13 22:10:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2025-03-13 22:10:30,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992248062015504 [2025-03-13 22:10:30,507 INFO L175 Difference]: Start difference. First operand has 200 places, 199 transitions, 412 flow. Second operand 3 states and 580 transitions. [2025-03-13 22:10:30,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 198 transitions, 446 flow [2025-03-13 22:10:30,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:30,510 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 410 flow [2025-03-13 22:10:30,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-03-13 22:10:30,511 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-03-13 22:10:30,511 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 410 flow [2025-03-13 22:10:30,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:30,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:30,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:10:30,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:10:30,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1961932619, now seen corresponding path program 1 times [2025-03-13 22:10:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:30,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971523135] [2025-03-13 22:10:30,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:30,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:10:30,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:10:30,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:30,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971523135] [2025-03-13 22:10:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971523135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:30,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438928251] [2025-03-13 22:10:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:30,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:30,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:30,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 215 [2025-03-13 22:10:30,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:30,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 215 [2025-03-13 22:10:30,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:30,664 INFO L124 PetriNetUnfolderBase]: 82/808 cut-off events. [2025-03-13 22:10:30,664 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:10:30,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 808 events. 82/808 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4765 event pairs, 42 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 908. Up to 109 conditions per place. [2025-03-13 22:10:30,670 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 20 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2025-03-13 22:10:30,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 438 flow [2025-03-13 22:10:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2025-03-13 22:10:30,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2025-03-13 22:10:30,673 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 410 flow. Second operand 3 states and 565 transitions. [2025-03-13 22:10:30,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 438 flow [2025-03-13 22:10:30,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 191 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:30,676 INFO L231 Difference]: Finished difference. Result has 191 places, 191 transitions, 394 flow [2025-03-13 22:10:30,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=191, PETRI_TRANSITIONS=191} [2025-03-13 22:10:30,678 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-03-13 22:10:30,678 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 394 flow [2025-03-13 22:10:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:30,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:30,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:10:30,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:10:30,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash 978818140, now seen corresponding path program 1 times [2025-03-13 22:10:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000700783] [2025-03-13 22:10:30,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:30,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:10:30,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:10:30,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:30,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:30,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:30,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000700783] [2025-03-13 22:10:30,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000700783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:30,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:30,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255481421] [2025-03-13 22:10:30,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:30,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:30,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:30,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:30,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:30,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 215 [2025-03-13 22:10:30,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:30,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 215 [2025-03-13 22:10:30,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:30,780 INFO L124 PetriNetUnfolderBase]: 31/442 cut-off events. [2025-03-13 22:10:30,781 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:10:30,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 442 events. 31/442 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1851 event pairs, 12 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 459. Up to 36 conditions per place. [2025-03-13 22:10:30,784 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 11 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-03-13 22:10:30,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 190 transitions, 418 flow [2025-03-13 22:10:30,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2025-03-13 22:10:30,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2025-03-13 22:10:30,786 INFO L175 Difference]: Start difference. First operand has 191 places, 191 transitions, 394 flow. Second operand 3 states and 590 transitions. [2025-03-13 22:10:30,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 190 transitions, 418 flow [2025-03-13 22:10:30,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:10:30,788 INFO L231 Difference]: Finished difference. Result has 191 places, 190 transitions, 395 flow [2025-03-13 22:10:30,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=191, PETRI_TRANSITIONS=190} [2025-03-13 22:10:30,789 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-03-13 22:10:30,789 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 190 transitions, 395 flow [2025-03-13 22:10:30,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:30,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:10:30,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:10:30,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1859491102, now seen corresponding path program 1 times [2025-03-13 22:10:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:30,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670908197] [2025-03-13 22:10:30,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:30,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:10:30,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:10:30,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:30,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670908197] [2025-03-13 22:10:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670908197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208240614] [2025-03-13 22:10:30,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:30,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:30,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:30,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:30,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 215 [2025-03-13 22:10:30,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 190 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:30,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:30,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 215 [2025-03-13 22:10:30,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:31,050 INFO L124 PetriNetUnfolderBase]: 195/1595 cut-off events. [2025-03-13 22:10:31,051 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-13 22:10:31,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 1595 events. 195/1595 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12504 event pairs, 57 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 1885. Up to 204 conditions per place. [2025-03-13 22:10:31,062 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 32 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2025-03-13 22:10:31,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 209 transitions, 530 flow [2025-03-13 22:10:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2025-03-13 22:10:31,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178294573643411 [2025-03-13 22:10:31,064 INFO L175 Difference]: Start difference. First operand has 191 places, 190 transitions, 395 flow. Second operand 3 states and 592 transitions. [2025-03-13 22:10:31,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 209 transitions, 530 flow [2025-03-13 22:10:31,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 209 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:31,068 INFO L231 Difference]: Finished difference. Result has 193 places, 204 transitions, 515 flow [2025-03-13 22:10:31,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=193, PETRI_TRANSITIONS=204} [2025-03-13 22:10:31,068 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -15 predicate places. [2025-03-13 22:10:31,068 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 204 transitions, 515 flow [2025-03-13 22:10:31,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:31,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:31,069 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:31,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:10:31,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:10:31,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -182745099, now seen corresponding path program 1 times [2025-03-13 22:10:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055098490] [2025-03-13 22:10:31,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:31,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 22:10:31,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 22:10:31,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:31,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055098490] [2025-03-13 22:10:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055098490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438857053] [2025-03-13 22:10:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:31,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:10:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:31,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:10:31,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:10:31,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-03-13 22:10:31,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 204 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:31,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:31,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-03-13 22:10:31,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:31,347 INFO L124 PetriNetUnfolderBase]: 130/1492 cut-off events. [2025-03-13 22:10:31,347 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-13 22:10:31,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 1492 events. 130/1492 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11585 event pairs, 41 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 1724. Up to 120 conditions per place. [2025-03-13 22:10:31,358 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 17 selfloop transitions, 0 changer transitions 4/207 dead transitions. [2025-03-13 22:10:31,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 207 transitions, 563 flow [2025-03-13 22:10:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:10:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:10:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 957 transitions. [2025-03-13 22:10:31,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8902325581395348 [2025-03-13 22:10:31,361 INFO L175 Difference]: Start difference. First operand has 193 places, 204 transitions, 515 flow. Second operand 5 states and 957 transitions. [2025-03-13 22:10:31,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 207 transitions, 563 flow [2025-03-13 22:10:31,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 207 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:31,365 INFO L231 Difference]: Finished difference. Result has 198 places, 203 transitions, 491 flow [2025-03-13 22:10:31,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=198, PETRI_TRANSITIONS=203} [2025-03-13 22:10:31,365 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-03-13 22:10:31,366 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 491 flow [2025-03-13 22:10:31,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:31,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:31,366 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:31,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:10:31,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:10:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 468078738, now seen corresponding path program 1 times [2025-03-13 22:10:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856269204] [2025-03-13 22:10:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:31,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:10:31,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:10:31,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:31,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:10:31,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:10:31,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:10:31,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:10:31,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:31,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:10:31,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:10:31,394 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-13 22:10:31,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-13 22:10:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-13 22:10:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-13 22:10:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-13 22:10:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-13 22:10:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-13 22:10:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-13 22:10:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-13 22:10:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-13 22:10:31,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:10:31,396 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:31,397 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:10:31,397 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:10:31,430 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:10:31,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 285 transitions, 588 flow [2025-03-13 22:10:31,463 INFO L124 PetriNetUnfolderBase]: 17/313 cut-off events. [2025-03-13 22:10:31,464 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:10:31,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 313 events. 17/313 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 961 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 237. Up to 4 conditions per place. [2025-03-13 22:10:31,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 285 transitions, 588 flow [2025-03-13 22:10:31,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 285 transitions, 588 flow [2025-03-13 22:10:31,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:10:31,470 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;@148e4bd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:10:31,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-13 22:10:31,472 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:10:31,472 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-13 22:10:31,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:10:31,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:31,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:31,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 22:10:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash -279688474, now seen corresponding path program 1 times [2025-03-13 22:10:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:31,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315938885] [2025-03-13 22:10:31,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:31,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:10:31,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:10:31,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:31,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315938885] [2025-03-13 22:10:31,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315938885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:31,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:31,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:31,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868044533] [2025-03-13 22:10:31,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:31,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:31,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:31,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:31,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:31,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 285 [2025-03-13 22:10:31,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:31,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:31,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 285 [2025-03-13 22:10:31,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:31,917 INFO L124 PetriNetUnfolderBase]: 829/4689 cut-off events. [2025-03-13 22:10:31,918 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-03-13 22:10:31,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 4689 events. 829/4689 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 48233 event pairs, 630 based on Foata normal form. 685/4575 useless extension candidates. Maximal degree in co-relation 4862. Up to 1033 conditions per place. [2025-03-13 22:10:31,967 INFO L140 encePairwiseOnDemand]: 274/285 looper letters, 24 selfloop transitions, 2 changer transitions 1/266 dead transitions. [2025-03-13 22:10:31,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2025-03-13 22:10:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-03-13 22:10:31,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.904093567251462 [2025-03-13 22:10:31,969 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 588 flow. Second operand 3 states and 773 transitions. [2025-03-13 22:10:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2025-03-13 22:10:31,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 22:10:31,972 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 550 flow [2025-03-13 22:10:31,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-03-13 22:10:31,973 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -10 predicate places. [2025-03-13 22:10:31,973 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 550 flow [2025-03-13 22:10:31,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:31,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:31,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:31,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:10:31,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 22:10:31,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:31,975 INFO L85 PathProgramCache]: Analyzing trace with hash -821136963, now seen corresponding path program 1 times [2025-03-13 22:10:31,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:31,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465814499] [2025-03-13 22:10:31,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:31,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:10:31,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:10:31,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:31,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465814499] [2025-03-13 22:10:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465814499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:32,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156377403] [2025-03-13 22:10:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:32,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:32,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:32,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 285 [2025-03-13 22:10:32,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:32,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:32,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 285 [2025-03-13 22:10:32,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:32,272 INFO L124 PetriNetUnfolderBase]: 335/2597 cut-off events. [2025-03-13 22:10:32,272 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-13 22:10:32,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 2597 events. 335/2597 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 23496 event pairs, 220 based on Foata normal form. 0/2136 useless extension candidates. Maximal degree in co-relation 3047. Up to 382 conditions per place. [2025-03-13 22:10:32,300 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-03-13 22:10:32,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 594 flow [2025-03-13 22:10:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2025-03-13 22:10:32,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017543859649123 [2025-03-13 22:10:32,302 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 550 flow. Second operand 3 states and 771 transitions. [2025-03-13 22:10:32,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 594 flow [2025-03-13 22:10:32,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:32,305 INFO L231 Difference]: Finished difference. Result has 263 places, 264 transitions, 548 flow [2025-03-13 22:10:32,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=263, PETRI_TRANSITIONS=264} [2025-03-13 22:10:32,309 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -12 predicate places. [2025-03-13 22:10:32,310 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 264 transitions, 548 flow [2025-03-13 22:10:32,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:32,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:32,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:32,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:10:32,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 22:10:32,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash -602249643, now seen corresponding path program 1 times [2025-03-13 22:10:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:32,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371615696] [2025-03-13 22:10:32,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:32,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:10:32,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:10:32,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:32,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:32,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371615696] [2025-03-13 22:10:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371615696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:32,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:32,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:32,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489558438] [2025-03-13 22:10:32,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:32,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:32,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:32,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 285 [2025-03-13 22:10:32,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:32,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:32,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 285 [2025-03-13 22:10:32,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:32,919 INFO L124 PetriNetUnfolderBase]: 985/6367 cut-off events. [2025-03-13 22:10:32,920 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-03-13 22:10:32,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7666 conditions, 6367 events. 985/6367 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 69337 event pairs, 630 based on Foata normal form. 0/5355 useless extension candidates. Maximal degree in co-relation 7625. Up to 1120 conditions per place. [2025-03-13 22:10:32,966 INFO L140 encePairwiseOnDemand]: 275/285 looper letters, 27 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-03-13 22:10:32,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 255 transitions, 586 flow [2025-03-13 22:10:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-03-13 22:10:32,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748538011695907 [2025-03-13 22:10:32,968 INFO L175 Difference]: Start difference. First operand has 263 places, 264 transitions, 548 flow. Second operand 3 states and 748 transitions. [2025-03-13 22:10:32,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 255 transitions, 586 flow [2025-03-13 22:10:32,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 255 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:32,973 INFO L231 Difference]: Finished difference. Result has 254 places, 255 transitions, 528 flow [2025-03-13 22:10:32,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=254, PETRI_TRANSITIONS=255} [2025-03-13 22:10:32,974 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-03-13 22:10:32,974 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 255 transitions, 528 flow [2025-03-13 22:10:32,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:32,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:32,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:32,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:10:32,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 22:10:32,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1140773124, now seen corresponding path program 1 times [2025-03-13 22:10:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390266519] [2025-03-13 22:10:32,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:32,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:10:32,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:10:32,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:32,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390266519] [2025-03-13 22:10:33,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390266519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:33,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:33,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:33,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459844689] [2025-03-13 22:10:33,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:33,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:33,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:33,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:33,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 285 [2025-03-13 22:10:33,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 255 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:33,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:33,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 285 [2025-03-13 22:10:33,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:33,203 INFO L124 PetriNetUnfolderBase]: 190/1767 cut-off events. [2025-03-13 22:10:33,203 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-13 22:10:33,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1767 events. 190/1767 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13830 event pairs, 108 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 1992. Up to 196 conditions per place. [2025-03-13 22:10:33,221 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 15 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-03-13 22:10:33,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 560 flow [2025-03-13 22:10:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2025-03-13 22:10:33,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-03-13 22:10:33,224 INFO L175 Difference]: Start difference. First operand has 254 places, 255 transitions, 528 flow. Second operand 3 states and 783 transitions. [2025-03-13 22:10:33,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 560 flow [2025-03-13 22:10:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 254 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:10:33,227 INFO L231 Difference]: Finished difference. Result has 254 places, 254 transitions, 529 flow [2025-03-13 22:10:33,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=254, PETRI_TRANSITIONS=254} [2025-03-13 22:10:33,229 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-03-13 22:10:33,229 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 254 transitions, 529 flow [2025-03-13 22:10:33,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:33,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:33,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:33,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:10:33,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 22:10:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 92832209, now seen corresponding path program 1 times [2025-03-13 22:10:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216021193] [2025-03-13 22:10:33,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:33,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:10:33,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:10:33,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:33,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:33,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:33,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216021193] [2025-03-13 22:10:33,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216021193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:33,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:33,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:33,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926330822] [2025-03-13 22:10:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:33,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:33,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:33,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:33,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 285 [2025-03-13 22:10:33,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 254 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:33,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:33,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 285 [2025-03-13 22:10:33,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:35,014 INFO L124 PetriNetUnfolderBase]: 4660/23982 cut-off events. [2025-03-13 22:10:35,015 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-13 22:10:35,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30441 conditions, 23982 events. 4660/23982 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 330653 event pairs, 1667 based on Foata normal form. 0/20559 useless extension candidates. Maximal degree in co-relation 30400. Up to 4132 conditions per place. [2025-03-13 22:10:35,197 INFO L140 encePairwiseOnDemand]: 255/285 looper letters, 48 selfloop transitions, 21 changer transitions 0/283 dead transitions. [2025-03-13 22:10:35,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 283 transitions, 735 flow [2025-03-13 22:10:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-03-13 22:10:35,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2025-03-13 22:10:35,200 INFO L175 Difference]: Start difference. First operand has 254 places, 254 transitions, 529 flow. Second operand 3 states and 780 transitions. [2025-03-13 22:10:35,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 283 transitions, 735 flow [2025-03-13 22:10:35,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 283 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:35,205 INFO L231 Difference]: Finished difference. Result has 256 places, 275 transitions, 711 flow [2025-03-13 22:10:35,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=256, PETRI_TRANSITIONS=275} [2025-03-13 22:10:35,206 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -19 predicate places. [2025-03-13 22:10:35,207 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 275 transitions, 711 flow [2025-03-13 22:10:35,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:35,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:35,208 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:10:35,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 22:10:35,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash -355772001, now seen corresponding path program 1 times [2025-03-13 22:10:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:35,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082346214] [2025-03-13 22:10:35,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:35,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-13 22:10:35,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-13 22:10:35,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:35,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082346214] [2025-03-13 22:10:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082346214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:35,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:10:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174350941] [2025-03-13 22:10:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:35,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:10:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:35,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:10:35,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:10:35,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 285 [2025-03-13 22:10:35,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 275 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:35,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:35,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 285 [2025-03-13 22:10:35,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:35,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([814] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 241#thrENTRYtrue, 286#(= |#race~len~0| 0), 276#true, 274#true, 290#true, 272#true, 295#true, 119#L1060-1true]) [2025-03-13 22:10:35,938 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-13 22:10:35,938 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-13 22:10:35,938 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:10:35,938 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-13 22:10:36,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([814] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 276#true, 274#true, 259#L1040true, 290#true, 272#true, 295#true, 119#L1060-1true]) [2025-03-13 22:10:36,246 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-13 22:10:36,246 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:10:36,246 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-13 22:10:36,246 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-13 22:10:36,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][161], [171#L1045true, 225#L1043true, Black: 290#true, 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 276#true, 274#true, 272#true, 68#L1045true, 295#true, 119#L1060-1true]) [2025-03-13 22:10:36,450 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-03-13 22:10:36,450 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-13 22:10:36,450 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-13 22:10:36,450 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-03-13 22:10:36,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][119], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 276#true, 274#true, 286#(= |#race~len~0| 0), 290#true, 272#true, 68#L1045true, 295#true, 119#L1060-1true]) [2025-03-13 22:10:36,476 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-03-13 22:10:36,476 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:10:36,476 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:10:36,476 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:10:36,844 INFO L124 PetriNetUnfolderBase]: 2516/17384 cut-off events. [2025-03-13 22:10:36,845 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-03-13 22:10:36,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21905 conditions, 17384 events. 2516/17384 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 237586 event pairs, 1056 based on Foata normal form. 1/15063 useless extension candidates. Maximal degree in co-relation 21863. Up to 2203 conditions per place. [2025-03-13 22:10:36,971 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 20 selfloop transitions, 0 changer transitions 4/278 dead transitions. [2025-03-13 22:10:36,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 278 transitions, 765 flow [2025-03-13 22:10:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:10:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:10:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1280 transitions. [2025-03-13 22:10:36,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2025-03-13 22:10:36,974 INFO L175 Difference]: Start difference. First operand has 256 places, 275 transitions, 711 flow. Second operand 5 states and 1280 transitions. [2025-03-13 22:10:36,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 278 transitions, 765 flow [2025-03-13 22:10:36,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 278 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:36,998 INFO L231 Difference]: Finished difference. Result has 261 places, 274 transitions, 673 flow [2025-03-13 22:10:36,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=261, PETRI_TRANSITIONS=274} [2025-03-13 22:10:37,000 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -14 predicate places. [2025-03-13 22:10:37,000 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 274 transitions, 673 flow [2025-03-13 22:10:37,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:37,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:37,001 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:37,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:10:37,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-13 22:10:37,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1540855367, now seen corresponding path program 1 times [2025-03-13 22:10:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:37,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074967919] [2025-03-13 22:10:37,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:37,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-13 22:10:37,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 22:10:37,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:37,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:10:37,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:10:37,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-13 22:10:37,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-13 22:10:37,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:37,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:10:37,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:10:37,042 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:10:37,042 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-03-13 22:10:37,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-03-13 22:10:37,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-03-13 22:10:37,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-03-13 22:10:37,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-03-13 22:10:37,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-03-13 22:10:37,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-03-13 22:10:37,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-03-13 22:10:37,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-03-13 22:10:37,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2025-03-13 22:10:37,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:10:37,045 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:37,045 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:10:37,045 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 22:10:37,083 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:10:37,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 355 transitions, 738 flow [2025-03-13 22:10:37,114 INFO L124 PetriNetUnfolderBase]: 22/393 cut-off events. [2025-03-13 22:10:37,114 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:10:37,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 393 events. 22/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1429 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 321. Up to 5 conditions per place. [2025-03-13 22:10:37,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 342 places, 355 transitions, 738 flow [2025-03-13 22:10:37,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 355 transitions, 738 flow [2025-03-13 22:10:37,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:10:37,123 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;@148e4bd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:10:37,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-13 22:10:37,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:10:37,126 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-13 22:10:37,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:10:37,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:37,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:37,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-13 22:10:37,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1790709801, now seen corresponding path program 1 times [2025-03-13 22:10:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812885694] [2025-03-13 22:10:37,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:37,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:10:37,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:10:37,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:37,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:37,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812885694] [2025-03-13 22:10:37,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812885694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:37,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:37,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:37,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120207787] [2025-03-13 22:10:37,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:37,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:37,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:37,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:37,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 355 [2025-03-13 22:10:37,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 355 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:37,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:37,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 355 [2025-03-13 22:10:37,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:40,550 INFO L124 PetriNetUnfolderBase]: 8203/34874 cut-off events. [2025-03-13 22:10:40,551 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-03-13 22:10:40,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46423 conditions, 34874 events. 8203/34874 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 484657 event pairs, 6804 based on Foata normal form. 5566/34841 useless extension candidates. Maximal degree in co-relation 38089. Up to 9608 conditions per place. [2025-03-13 22:10:40,863 INFO L140 encePairwiseOnDemand]: 342/355 looper letters, 31 selfloop transitions, 2 changer transitions 1/332 dead transitions. [2025-03-13 22:10:40,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 332 transitions, 758 flow [2025-03-13 22:10:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-13 22:10:40,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-03-13 22:10:40,865 INFO L175 Difference]: Start difference. First operand has 342 places, 355 transitions, 738 flow. Second operand 3 states and 962 transitions. [2025-03-13 22:10:40,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 332 transitions, 758 flow [2025-03-13 22:10:40,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 332 transitions, 752 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 22:10:40,869 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 688 flow [2025-03-13 22:10:40,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-03-13 22:10:40,870 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -12 predicate places. [2025-03-13 22:10:40,870 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 688 flow [2025-03-13 22:10:40,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:40,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:40,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:10:40,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-13 22:10:40,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1182511965, now seen corresponding path program 1 times [2025-03-13 22:10:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022212253] [2025-03-13 22:10:40,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:40,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:40,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:10:40,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:10:40,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:40,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:40,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:40,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022212253] [2025-03-13 22:10:40,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022212253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:40,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:40,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589388387] [2025-03-13 22:10:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:40,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:40,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:40,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:40,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 355 [2025-03-13 22:10:40,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:40,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:40,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 355 [2025-03-13 22:10:40,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:42,112 INFO L124 PetriNetUnfolderBase]: 2303/13468 cut-off events. [2025-03-13 22:10:42,113 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-03-13 22:10:42,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16452 conditions, 13468 events. 2303/13468 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 168630 event pairs, 1720 based on Foata normal form. 0/11135 useless extension candidates. Maximal degree in co-relation 16418. Up to 2507 conditions per place. [2025-03-13 22:10:42,260 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 26 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-03-13 22:10:42,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 330 transitions, 742 flow [2025-03-13 22:10:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-13 22:10:42,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-03-13 22:10:42,262 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 688 flow. Second operand 3 states and 962 transitions. [2025-03-13 22:10:42,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 330 transitions, 742 flow [2025-03-13 22:10:42,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 330 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:42,267 INFO L231 Difference]: Finished difference. Result has 328 places, 330 transitions, 686 flow [2025-03-13 22:10:42,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=328, PETRI_TRANSITIONS=330} [2025-03-13 22:10:42,268 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -14 predicate places. [2025-03-13 22:10:42,268 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 330 transitions, 686 flow [2025-03-13 22:10:42,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:42,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:42,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:42,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:10:42,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-13 22:10:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1920243893, now seen corresponding path program 1 times [2025-03-13 22:10:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:42,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136514340] [2025-03-13 22:10:42,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:42,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:10:42,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:10:42,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:42,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136514340] [2025-03-13 22:10:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136514340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:42,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:42,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:42,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219805004] [2025-03-13 22:10:42,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:42,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:42,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:42,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:42,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:42,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 355 [2025-03-13 22:10:42,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 330 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:42,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:42,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 355 [2025-03-13 22:10:42,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:47,220 INFO L124 PetriNetUnfolderBase]: 9761/49199 cut-off events. [2025-03-13 22:10:47,220 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2025-03-13 22:10:47,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61006 conditions, 49199 events. 9761/49199 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 737369 event pairs, 6804 based on Foata normal form. 0/41396 useless extension candidates. Maximal degree in co-relation 60964. Up to 10598 conditions per place. [2025-03-13 22:10:48,053 INFO L140 encePairwiseOnDemand]: 343/355 looper letters, 34 selfloop transitions, 1 changer transitions 0/319 dead transitions. [2025-03-13 22:10:48,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 734 flow [2025-03-13 22:10:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 931 transitions. [2025-03-13 22:10:48,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8741784037558685 [2025-03-13 22:10:48,055 INFO L175 Difference]: Start difference. First operand has 328 places, 330 transitions, 686 flow. Second operand 3 states and 931 transitions. [2025-03-13 22:10:48,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 734 flow [2025-03-13 22:10:48,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 319 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:10:48,059 INFO L231 Difference]: Finished difference. Result has 317 places, 319 transitions, 662 flow [2025-03-13 22:10:48,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=317, PETRI_TRANSITIONS=319} [2025-03-13 22:10:48,060 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-03-13 22:10:48,060 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 319 transitions, 662 flow [2025-03-13 22:10:48,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:48,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:48,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:48,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:10:48,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-13 22:10:48,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2047908772, now seen corresponding path program 1 times [2025-03-13 22:10:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272261638] [2025-03-13 22:10:48,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:48,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:10:48,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:10:48,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:48,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272261638] [2025-03-13 22:10:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272261638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:48,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:48,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252931831] [2025-03-13 22:10:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:48,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:48,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:48,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 355 [2025-03-13 22:10:48,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 319 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:48,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:48,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 355 [2025-03-13 22:10:48,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:10:48,968 INFO L124 PetriNetUnfolderBase]: 1021/7284 cut-off events. [2025-03-13 22:10:48,968 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-03-13 22:10:49,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8575 conditions, 7284 events. 1021/7284 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 80143 event pairs, 684 based on Foata normal form. 0/6099 useless extension candidates. Maximal degree in co-relation 8533. Up to 1028 conditions per place. [2025-03-13 22:10:49,088 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 19 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-13 22:10:49,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 702 flow [2025-03-13 22:10:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:10:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:10:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2025-03-13 22:10:49,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164319248826291 [2025-03-13 22:10:49,090 INFO L175 Difference]: Start difference. First operand has 317 places, 319 transitions, 662 flow. Second operand 3 states and 976 transitions. [2025-03-13 22:10:49,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 318 transitions, 702 flow [2025-03-13 22:10:49,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:10:49,094 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 663 flow [2025-03-13 22:10:49,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2025-03-13 22:10:49,094 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-03-13 22:10:49,095 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 663 flow [2025-03-13 22:10:49,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:49,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:10:49,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:10:49,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:10:49,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-13 22:10:49,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:10:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash -259623793, now seen corresponding path program 1 times [2025-03-13 22:10:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:10:49,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135568203] [2025-03-13 22:10:49,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:10:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:10:49,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:10:49,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:10:49,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:10:49,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:10:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:10:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:10:49,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135568203] [2025-03-13 22:10:49,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135568203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:10:49,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:10:49,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:10:49,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700424470] [2025-03-13 22:10:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:10:49,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:10:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:10:49,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:10:49,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:10:49,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 355 [2025-03-13 22:10:49,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:10:49,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:10:49,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 355 [2025-03-13 22:10:49,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand