./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.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 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:19:45,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:19:45,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:19:45,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:19:45,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:19:46,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:19:46,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:19:46,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:19:46,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:19:46,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:19:46,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:19:46,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:19:46,011 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:19:46,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:19:46,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:19:46,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:19:46,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:19:46,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:19:46,013 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 -> 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed [2025-03-14 01:19:46,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:19:46,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:19:46,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:19:46,286 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:19:46,286 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:19:46,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2025-03-14 01:19:47,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef9e8017/29687f90dc5840968738cde94538d2f0/FLAGf5229f83e [2025-03-14 01:19:47,784 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:19:47,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2025-03-14 01:19:47,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef9e8017/29687f90dc5840968738cde94538d2f0/FLAGf5229f83e [2025-03-14 01:19:48,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef9e8017/29687f90dc5840968738cde94538d2f0 [2025-03-14 01:19:48,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:19:48,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:19:48,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:19:48,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:19:48,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:19:48,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20977ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48, skipping insertion in model container [2025-03-14 01:19:48,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:19:48,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:19:48,358 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:19:48,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:19:48,420 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:19:48,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48 WrapperNode [2025-03-14 01:19:48,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:19:48,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:19:48,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:19:48,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:19:48,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,444 INFO L138 Inliner]: procedures = 166, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2025-03-14 01:19:48,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:19:48,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:19:48,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:19:48,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:19:48,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:19:48,462 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:19:48,463 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:19:48,463 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:19:48,463 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (1/1) ... [2025-03-14 01:19:48,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:19:48,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:19:48,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:19:48,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:19:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:19:48,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:19:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:19:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:19:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:19:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:19:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:19:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:19:48,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:19:48,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:19:48,512 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:19:48,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:19:48,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:19:48,721 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:19:48,722 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:19:48,722 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:19:48,755 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:19:48,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:19:48 BoogieIcfgContainer [2025-03-14 01:19:48,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:19:48,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:19:48,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:19:48,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:19:48,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:19:48" (1/3) ... [2025-03-14 01:19:48,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205c24a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:19:48, skipping insertion in model container [2025-03-14 01:19:48,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:19:48" (2/3) ... [2025-03-14 01:19:48,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205c24a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:19:48, skipping insertion in model container [2025-03-14 01:19:48,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:19:48" (3/3) ... [2025-03-14 01:19:48,765 INFO L128 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2025-03-14 01:19:48,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:19:48,777 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 39_rand_lock_p0_vs.i that has 2 procedures, 70 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-14 01:19:48,778 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:19:48,822 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:19:48,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 72 transitions, 148 flow [2025-03-14 01:19:48,882 INFO L124 PetriNetUnfolderBase]: 2/79 cut-off events. [2025-03-14 01:19:48,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:19:48,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 79 events. 2/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-03-14 01:19:48,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 72 transitions, 148 flow [2025-03-14 01:19:48,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 72 transitions, 148 flow [2025-03-14 01:19:48,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:19:48,917 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;@75e6f0da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:19:48,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 01:19:48,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:19:48,932 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2025-03-14 01:19:48,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:19:48,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:48,936 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] [2025-03-14 01:19:48,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 01:19:48,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash 806892855, now seen corresponding path program 1 times [2025-03-14 01:19:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528134018] [2025-03-14 01:19:48,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:49,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:19:49,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:19:49,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:49,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:49,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:19:49,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:19:49,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:19:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:49,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:19:49,085 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:19:49,086 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-14 01:19:49,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-14 01:19:49,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-14 01:19:49,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-14 01:19:49,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-14 01:19:49,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-14 01:19:49,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-14 01:19:49,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:19:49,090 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-14 01:19:49,094 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:19:49,094 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:19:49,136 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:19:49,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 117 transitions, 244 flow [2025-03-14 01:19:49,199 INFO L124 PetriNetUnfolderBase]: 4/133 cut-off events. [2025-03-14 01:19:49,199 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:19:49,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 133 events. 4/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 97. Up to 3 conditions per place. [2025-03-14 01:19:49,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 117 transitions, 244 flow [2025-03-14 01:19:49,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 117 transitions, 244 flow [2025-03-14 01:19:49,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:19:49,205 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;@75e6f0da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:19:49,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-14 01:19:49,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:19:49,215 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-03-14 01:19:49,215 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:19:49,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:49,215 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] [2025-03-14 01:19:49,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:19:49,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash -569156281, now seen corresponding path program 1 times [2025-03-14 01:19:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484403275] [2025-03-14 01:19:49,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:49,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:19:49,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:19:49,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:49,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:49,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484403275] [2025-03-14 01:19:49,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484403275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:49,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:49,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:19:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207028198] [2025-03-14 01:19:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:19:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:49,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:19:49,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:19:49,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2025-03-14 01:19:49,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 244 flow. Second operand has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:49,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:49,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2025-03-14 01:19:49,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:49,401 INFO L124 PetriNetUnfolderBase]: 27/349 cut-off events. [2025-03-14 01:19:49,401 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-14 01:19:49,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 349 events. 27/349 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1333 event pairs, 20 based on Foata normal form. 39/370 useless extension candidates. Maximal degree in co-relation 255. Up to 51 conditions per place. [2025-03-14 01:19:49,404 INFO L140 encePairwiseOnDemand]: 110/117 looper letters, 10 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2025-03-14 01:19:49,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 244 flow [2025-03-14 01:19:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:19:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:19:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 217 transitions. [2025-03-14 01:19:49,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9273504273504274 [2025-03-14 01:19:49,422 INFO L175 Difference]: Start difference. First operand has 118 places, 117 transitions, 244 flow. Second operand 2 states and 217 transitions. [2025-03-14 01:19:49,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 244 flow [2025-03-14 01:19:49,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 107 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:49,428 INFO L231 Difference]: Finished difference. Result has 111 places, 107 transitions, 224 flow [2025-03-14 01:19:49,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=224, PETRI_PLACES=111, PETRI_TRANSITIONS=107} [2025-03-14 01:19:49,432 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -7 predicate places. [2025-03-14 01:19:49,432 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 107 transitions, 224 flow [2025-03-14 01:19:49,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:49,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:49,433 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] [2025-03-14 01:19:49,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:19:49,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:19:49,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1078375029, now seen corresponding path program 1 times [2025-03-14 01:19:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211098977] [2025-03-14 01:19:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:49,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:19:49,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:19:49,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:49,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211098977] [2025-03-14 01:19:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211098977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:49,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:49,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:19:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190208584] [2025-03-14 01:19:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:49,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:19:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:49,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:19:49,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:19:49,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2025-03-14 01:19:49,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:49,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:49,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2025-03-14 01:19:49,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:49,607 INFO L124 PetriNetUnfolderBase]: 64/537 cut-off events. [2025-03-14 01:19:49,607 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:19:49,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 537 events. 64/537 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2613 event pairs, 20 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 688. Up to 80 conditions per place. [2025-03-14 01:19:49,613 INFO L140 encePairwiseOnDemand]: 107/117 looper letters, 21 selfloop transitions, 8 changer transitions 0/120 dead transitions. [2025-03-14 01:19:49,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 120 transitions, 313 flow [2025-03-14 01:19:49,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:19:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:19:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2025-03-14 01:19:49,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8917378917378918 [2025-03-14 01:19:49,615 INFO L175 Difference]: Start difference. First operand has 111 places, 107 transitions, 224 flow. Second operand 3 states and 313 transitions. [2025-03-14 01:19:49,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 120 transitions, 313 flow [2025-03-14 01:19:49,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 313 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:49,621 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 292 flow [2025-03-14 01:19:49,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2025-03-14 01:19:49,622 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2025-03-14 01:19:49,622 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 292 flow [2025-03-14 01:19:49,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:49,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:49,623 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] [2025-03-14 01:19:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:19:49,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 01:19:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 809115541, now seen corresponding path program 1 times [2025-03-14 01:19:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221161794] [2025-03-14 01:19:49,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:49,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:19:49,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:19:49,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:49,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:49,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:19:49,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:19:49,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:19:49,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:49,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:49,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:19:49,670 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:19:49,671 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-14 01:19:49,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-14 01:19:49,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-14 01:19:49,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-14 01:19:49,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-14 01:19:49,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-14 01:19:49,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-14 01:19:49,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-14 01:19:49,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-14 01:19:49,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-14 01:19:49,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:19:49,675 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-14 01:19:49,676 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:19:49,676 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:19:49,710 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:19:49,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 162 transitions, 342 flow [2025-03-14 01:19:49,750 INFO L124 PetriNetUnfolderBase]: 6/187 cut-off events. [2025-03-14 01:19:49,750 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:19:49,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 6/187 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 427 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2025-03-14 01:19:49,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 342 flow [2025-03-14 01:19:49,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 162 transitions, 342 flow [2025-03-14 01:19:49,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:19:49,754 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;@75e6f0da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:19:49,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-14 01:19:49,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:19:49,759 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-03-14 01:19:49,759 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:19:49,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:49,759 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] [2025-03-14 01:19:49,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-14 01:19:49,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash 829849371, now seen corresponding path program 1 times [2025-03-14 01:19:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370432315] [2025-03-14 01:19:49,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:49,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:19:49,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:19:49,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:49,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370432315] [2025-03-14 01:19:49,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370432315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:49,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:49,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:19:49,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034690906] [2025-03-14 01:19:49,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:49,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:19:49,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:49,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:19:49,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:19:49,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2025-03-14 01:19:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 342 flow. Second operand has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:49,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2025-03-14 01:19:49,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:50,043 INFO L124 PetriNetUnfolderBase]: 253/1865 cut-off events. [2025-03-14 01:19:50,044 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-14 01:19:50,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 1865 events. 253/1865 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14485 event pairs, 220 based on Foata normal form. 214/1976 useless extension candidates. Maximal degree in co-relation 537. Up to 376 conditions per place. [2025-03-14 01:19:50,061 INFO L140 encePairwiseOnDemand]: 152/162 looper letters, 15 selfloop transitions, 0 changer transitions 0/149 dead transitions. [2025-03-14 01:19:50,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 149 transitions, 346 flow [2025-03-14 01:19:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:19:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:19:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2025-03-14 01:19:50,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228395061728395 [2025-03-14 01:19:50,064 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 342 flow. Second operand 2 states and 299 transitions. [2025-03-14 01:19:50,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 149 transitions, 346 flow [2025-03-14 01:19:50,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 149 transitions, 344 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:50,069 INFO L231 Difference]: Finished difference. Result has 154 places, 149 transitions, 314 flow [2025-03-14 01:19:50,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=314, PETRI_PLACES=154, PETRI_TRANSITIONS=149} [2025-03-14 01:19:50,070 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -9 predicate places. [2025-03-14 01:19:50,070 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 149 transitions, 314 flow [2025-03-14 01:19:50,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:50,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:50,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:19:50,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:19:50,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-14 01:19:50,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2036630049, now seen corresponding path program 1 times [2025-03-14 01:19:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:50,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163936853] [2025-03-14 01:19:50,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:50,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:19:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:19:50,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:50,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:50,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:50,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163936853] [2025-03-14 01:19:50,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163936853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:50,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:50,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:19:50,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516009413] [2025-03-14 01:19:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:50,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:19:50,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:50,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:19:50,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:19:50,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 162 [2025-03-14 01:19:50,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 149 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:50,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:50,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 162 [2025-03-14 01:19:50,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:50,720 INFO L124 PetriNetUnfolderBase]: 1172/5313 cut-off events. [2025-03-14 01:19:50,720 INFO L125 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2025-03-14 01:19:50,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7345 conditions, 5313 events. 1172/5313 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 51605 event pairs, 427 based on Foata normal form. 0/5049 useless extension candidates. Maximal degree in co-relation 7339. Up to 1116 conditions per place. [2025-03-14 01:19:50,762 INFO L140 encePairwiseOnDemand]: 147/162 looper letters, 32 selfloop transitions, 12 changer transitions 0/169 dead transitions. [2025-03-14 01:19:50,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 169 transitions, 452 flow [2025-03-14 01:19:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:19:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:19:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2025-03-14 01:19:50,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868312757201646 [2025-03-14 01:19:50,766 INFO L175 Difference]: Start difference. First operand has 154 places, 149 transitions, 314 flow. Second operand 3 states and 431 transitions. [2025-03-14 01:19:50,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 169 transitions, 452 flow [2025-03-14 01:19:50,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 169 transitions, 452 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:50,770 INFO L231 Difference]: Finished difference. Result has 158 places, 161 transitions, 416 flow [2025-03-14 01:19:50,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=158, PETRI_TRANSITIONS=161} [2025-03-14 01:19:50,772 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -5 predicate places. [2025-03-14 01:19:50,772 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 161 transitions, 416 flow [2025-03-14 01:19:50,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:50,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:50,773 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] [2025-03-14 01:19:50,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:19:50,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-14 01:19:50,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -153601703, now seen corresponding path program 1 times [2025-03-14 01:19:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:50,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138527438] [2025-03-14 01:19:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:50,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:19:50,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:19:50,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:50,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:50,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:19:50,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:19:50,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:19:50,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:50,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:50,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:19:50,822 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:19:50,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-14 01:19:50,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-14 01:19:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:19:50,824 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-14 01:19:50,825 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:19:50,825 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:19:50,885 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:19:50,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 207 transitions, 442 flow [2025-03-14 01:19:50,918 INFO L124 PetriNetUnfolderBase]: 8/241 cut-off events. [2025-03-14 01:19:50,918 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:19:50,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 241 events. 8/241 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 686 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 195. Up to 5 conditions per place. [2025-03-14 01:19:50,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 207 transitions, 442 flow [2025-03-14 01:19:50,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 207 transitions, 442 flow [2025-03-14 01:19:50,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:19:50,924 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;@75e6f0da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:19:50,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-14 01:19:50,927 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:19:50,927 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-03-14 01:19:50,927 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:19:50,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:50,928 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] [2025-03-14 01:19:50,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-14 01:19:50,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 670668635, now seen corresponding path program 1 times [2025-03-14 01:19:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67342513] [2025-03-14 01:19:50,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:50,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:19:50,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:19:50,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:50,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:50,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:50,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67342513] [2025-03-14 01:19:50,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67342513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:50,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:50,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:19:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445177706] [2025-03-14 01:19:50,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:50,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:19:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:50,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:19:50,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:19:50,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 207 [2025-03-14 01:19:50,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 207 transitions, 442 flow. Second operand has 2 states, 2 states have (on average 175.0) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:50,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:50,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 207 [2025-03-14 01:19:50,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:52,047 INFO L124 PetriNetUnfolderBase]: 1859/9901 cut-off events. [2025-03-14 01:19:52,048 INFO L125 PetriNetUnfolderBase]: For 1548/1548 co-relation queries the response was YES. [2025-03-14 01:19:52,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13149 conditions, 9901 events. 1859/9901 cut-off events. For 1548/1548 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 110885 event pairs, 1720 based on Foata normal form. 1185/10561 useless extension candidates. Maximal degree in co-relation 2373. Up to 2501 conditions per place. [2025-03-14 01:19:52,155 INFO L140 encePairwiseOnDemand]: 194/207 looper letters, 20 selfloop transitions, 0 changer transitions 0/191 dead transitions. [2025-03-14 01:19:52,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 191 transitions, 450 flow [2025-03-14 01:19:52,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:19:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:19:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 381 transitions. [2025-03-14 01:19:52,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9202898550724637 [2025-03-14 01:19:52,158 INFO L175 Difference]: Start difference. First operand has 208 places, 207 transitions, 442 flow. Second operand 2 states and 381 transitions. [2025-03-14 01:19:52,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 191 transitions, 450 flow [2025-03-14 01:19:52,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 191 transitions, 444 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:52,162 INFO L231 Difference]: Finished difference. Result has 197 places, 191 transitions, 404 flow [2025-03-14 01:19:52,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=404, PETRI_PLACES=197, PETRI_TRANSITIONS=191} [2025-03-14 01:19:52,162 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -11 predicate places. [2025-03-14 01:19:52,162 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 191 transitions, 404 flow [2025-03-14 01:19:52,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 175.0) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:52,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:52,163 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] [2025-03-14 01:19:52,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:19:52,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-14 01:19:52,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -640787233, now seen corresponding path program 1 times [2025-03-14 01:19:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:52,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35017362] [2025-03-14 01:19:52,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:52,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:19:52,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:19:52,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:52,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35017362] [2025-03-14 01:19:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35017362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:52,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:52,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:19:52,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192370220] [2025-03-14 01:19:52,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:52,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:19:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:52,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:19:52,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:19:52,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 207 [2025-03-14 01:19:52,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 191 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:52,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:52,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 207 [2025-03-14 01:19:52,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:56,820 INFO L124 PetriNetUnfolderBase]: 15875/52949 cut-off events. [2025-03-14 01:19:56,820 INFO L125 PetriNetUnfolderBase]: For 2260/2260 co-relation queries the response was YES. [2025-03-14 01:19:57,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76766 conditions, 52949 events. 15875/52949 cut-off events. For 2260/2260 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 711642 event pairs, 6167 based on Foata normal form. 0/50076 useless extension candidates. Maximal degree in co-relation 76759. Up to 13336 conditions per place. [2025-03-14 01:19:57,349 INFO L140 encePairwiseOnDemand]: 187/207 looper letters, 43 selfloop transitions, 16 changer transitions 0/218 dead transitions. [2025-03-14 01:19:57,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 218 transitions, 591 flow [2025-03-14 01:19:57,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:19:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:19:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2025-03-14 01:19:57,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2025-03-14 01:19:57,351 INFO L175 Difference]: Start difference. First operand has 197 places, 191 transitions, 404 flow. Second operand 3 states and 549 transitions. [2025-03-14 01:19:57,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 218 transitions, 591 flow [2025-03-14 01:19:57,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 218 transitions, 591 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:57,357 INFO L231 Difference]: Finished difference. Result has 201 places, 207 transitions, 540 flow [2025-03-14 01:19:57,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=201, PETRI_TRANSITIONS=207} [2025-03-14 01:19:57,359 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -7 predicate places. [2025-03-14 01:19:57,359 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 207 transitions, 540 flow [2025-03-14 01:19:57,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:57,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:57,360 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:19:57,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:19:57,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-14 01:19:57,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2133517347, now seen corresponding path program 1 times [2025-03-14 01:19:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917803308] [2025-03-14 01:19:57,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:57,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-14 01:19:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-14 01:19:57,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:57,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:57,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:19:57,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-14 01:19:57,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-14 01:19:57,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:57,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:57,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:19:57,398 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:19:57,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-14 01:19:57,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-14 01:19:57,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-14 01:19:57,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-14 01:19:57,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-14 01:19:57,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:19:57,400 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-14 01:19:57,400 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:19:57,400 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-14 01:19:57,449 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:19:57,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 252 transitions, 544 flow [2025-03-14 01:19:57,484 INFO L124 PetriNetUnfolderBase]: 10/295 cut-off events. [2025-03-14 01:19:57,484 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-14 01:19:57,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 295 events. 10/295 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 953 event pairs, 0 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 254. Up to 6 conditions per place. [2025-03-14 01:19:57,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 252 transitions, 544 flow [2025-03-14 01:19:57,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 253 places, 252 transitions, 544 flow [2025-03-14 01:19:57,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:19:57,490 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;@75e6f0da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:19:57,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-14 01:19:57,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:19:57,492 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-03-14 01:19:57,492 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:19:57,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:57,492 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] [2025-03-14 01:19:57,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-14 01:19:57,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1843116285, now seen corresponding path program 1 times [2025-03-14 01:19:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:57,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473019690] [2025-03-14 01:19:57,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:57,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:19:57,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:19:57,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:57,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:57,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:57,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473019690] [2025-03-14 01:19:57,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473019690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:57,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:57,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:19:57,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123980018] [2025-03-14 01:19:57,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:57,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:19:57,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:57,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:19:57,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:19:57,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 252 [2025-03-14 01:19:57,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 252 transitions, 544 flow. Second operand has 2 states, 2 states have (on average 212.0) internal successors, (424), 2 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:57,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:57,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 252 [2025-03-14 01:19:57,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:03,434 INFO L124 PetriNetUnfolderBase]: 12349/52573 cut-off events. [2025-03-14 01:20:03,434 INFO L125 PetriNetUnfolderBase]: For 11651/11651 co-relation queries the response was YES. [2025-03-14 01:20:03,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72697 conditions, 52573 events. 12349/52573 cut-off events. For 11651/11651 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 748385 event pairs, 11720 based on Foata normal form. 6628/56571 useless extension candidates. Maximal degree in co-relation 13284. Up to 15626 conditions per place. [2025-03-14 01:20:03,949 INFO L140 encePairwiseOnDemand]: 236/252 looper letters, 25 selfloop transitions, 0 changer transitions 0/233 dead transitions. [2025-03-14 01:20:03,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 556 flow [2025-03-14 01:20:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:20:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:20:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 463 transitions. [2025-03-14 01:20:03,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9186507936507936 [2025-03-14 01:20:03,951 INFO L175 Difference]: Start difference. First operand has 253 places, 252 transitions, 544 flow. Second operand 2 states and 463 transitions. [2025-03-14 01:20:03,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 556 flow [2025-03-14 01:20:03,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 233 transitions, 544 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:03,961 INFO L231 Difference]: Finished difference. Result has 240 places, 233 transitions, 494 flow [2025-03-14 01:20:03,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=494, PETRI_PLACES=240, PETRI_TRANSITIONS=233} [2025-03-14 01:20:03,962 INFO L279 CegarLoopForPetriNet]: 253 programPoint places, -13 predicate places. [2025-03-14 01:20:03,962 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 494 flow [2025-03-14 01:20:03,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 212.0) internal successors, (424), 2 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:03,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:03,963 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] [2025-03-14 01:20:03,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:20:03,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-14 01:20:03,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash -894784377, now seen corresponding path program 1 times [2025-03-14 01:20:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376092113] [2025-03-14 01:20:03,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:03,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:20:03,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:20:03,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:03,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:03,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:03,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376092113] [2025-03-14 01:20:03,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376092113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:03,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:03,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:03,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137759450] [2025-03-14 01:20:03,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:03,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:03,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:03,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:03,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:04,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 252 [2025-03-14 01:20:04,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 233 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:04,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:04,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 252 [2025-03-14 01:20:04,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand