./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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-theta/unwind3-100.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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:21:14,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:21:14,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:21:14,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:21:14,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:21:14,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:21:14,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:21:14,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:21:14,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:21:14,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:21:14,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:21:14,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:21:14,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:21:14,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:21:14,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:21:14,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:21:14,557 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:21:14,557 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:21:14,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:21:14,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:21:14,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:21:14,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:21:14,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:21:14,558 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-03-17 11:21:14,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:21:14,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:21:14,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:21:14,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:21:14,801 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:21:14,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-03-17 11:21:15,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d637cde02/bd39d4b9211d47b6bdb5b1b46700e0db/FLAGc9302b8f5 [2025-03-17 11:21:16,191 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:21:16,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-03-17 11:21:16,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d637cde02/bd39d4b9211d47b6bdb5b1b46700e0db/FLAGc9302b8f5 [2025-03-17 11:21:16,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d637cde02/bd39d4b9211d47b6bdb5b1b46700e0db [2025-03-17 11:21:16,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:21:16,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:21:16,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:21:16,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:21:16,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:21:16,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df2e29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16, skipping insertion in model container [2025-03-17 11:21:16,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:21:16,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:21:16,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:21:16,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:21:16,877 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:21:16,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16 WrapperNode [2025-03-17 11:21:16,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:21:16,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:21:16,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:21:16,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:21:16,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,898 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-03-17 11:21:16,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:21:16,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:21:16,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:21:16,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:21:16,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:21:16,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:21:16,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:21:16,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:21:16,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:21:16,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:21:16,936 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-17 11:21:16,941 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-17 11:21:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:21:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-17 11:21:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-17 11:21:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-17 11:21:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-17 11:21:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:21:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:21:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:21:16,955 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:21:17,048 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:21:17,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:21:17,164 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:21:17,164 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:21:17,178 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:21:17,179 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:21:17,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:21:17 BoogieIcfgContainer [2025-03-17 11:21:17,180 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:21:17,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:21:17,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:21:17,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:21:17,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:21:16" (1/3) ... [2025-03-17 11:21:17,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bf9e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:21:17, skipping insertion in model container [2025-03-17 11:21:17,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (2/3) ... [2025-03-17 11:21:17,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bf9e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:21:17, skipping insertion in model container [2025-03-17 11:21:17,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:21:17" (3/3) ... [2025-03-17 11:21:17,186 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-03-17 11:21:17,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:21:17,196 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 99 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-17 11:21:17,196 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:21:17,240 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:17,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 105 transitions, 218 flow [2025-03-17 11:21:17,314 INFO L124 PetriNetUnfolderBase]: 10/154 cut-off events. [2025-03-17 11:21:17,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:17,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 154 events. 10/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 278 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2025-03-17 11:21:17,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 105 transitions, 218 flow [2025-03-17 11:21:17,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 88 transitions, 183 flow [2025-03-17 11:21:17,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:17,334 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:17,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 11:21:17,337 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:17,337 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:17,338 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:17,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:17,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:17,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:21:17,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1266920311, now seen corresponding path program 1 times [2025-03-17 11:21:17,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433177722] [2025-03-17 11:21:17,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:17,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:17,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:17,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:17,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:17,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:17,479 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-17 11:21:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433177722] [2025-03-17 11:21:17,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433177722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:17,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:17,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:17,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174172878] [2025-03-17 11:21:17,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:17,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:17,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:17,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:17,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2025-03-17 11:21:17,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-17 11:21:17,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:17,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2025-03-17 11:21:17,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:17,578 INFO L124 PetriNetUnfolderBase]: 11/144 cut-off events. [2025-03-17 11:21:17,580 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:21:17,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 144 events. 11/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 291 event pairs, 8 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 101. Up to 33 conditions per place. [2025-03-17 11:21:17,583 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 13 selfloop transitions, 2 changer transitions 1/85 dead transitions. [2025-03-17 11:21:17,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 207 flow [2025-03-17 11:21:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2025-03-17 11:21:17,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-17 11:21:17,595 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 183 flow. Second operand 3 states and 270 transitions. [2025-03-17 11:21:17,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 207 flow [2025-03-17 11:21:17,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:17,602 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 178 flow [2025-03-17 11:21:17,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2025-03-17 11:21:17,607 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-03-17 11:21:17,608 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 178 flow [2025-03-17 11:21:17,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-17 11:21:17,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:17,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:17,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:21:17,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:21:17,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1349731182, now seen corresponding path program 1 times [2025-03-17 11:21:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233022410] [2025-03-17 11:21:17,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:17,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:17,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:17,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:17,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:17,674 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-17 11:21:17,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:17,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233022410] [2025-03-17 11:21:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233022410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:17,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:17,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298944534] [2025-03-17 11:21:17,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:17,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:17,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:17,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:17,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:17,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-03-17 11:21:17,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-17 11:21:17,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:17,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-03-17 11:21:17,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:17,742 INFO L124 PetriNetUnfolderBase]: 7/126 cut-off events. [2025-03-17 11:21:17,744 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:21:17,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 126 events. 7/126 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 221 event pairs, 4 based on Foata normal form. 3/121 useless extension candidates. Maximal degree in co-relation 144. Up to 25 conditions per place. [2025-03-17 11:21:17,746 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 11 selfloop transitions, 1 changer transitions 24/79 dead transitions. [2025-03-17 11:21:17,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 196 flow [2025-03-17 11:21:17,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-03-17 11:21:17,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-03-17 11:21:17,747 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 178 flow. Second operand 3 states and 259 transitions. [2025-03-17 11:21:17,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 196 flow [2025-03-17 11:21:17,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:17,749 INFO L231 Difference]: Finished difference. Result has 84 places, 55 transitions, 116 flow [2025-03-17 11:21:17,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=84, PETRI_TRANSITIONS=55} [2025-03-17 11:21:17,749 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-03-17 11:21:17,749 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 55 transitions, 116 flow [2025-03-17 11:21:17,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-17 11:21:17,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:17,750 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:17,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:21:17,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:21:17,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash -744453045, now seen corresponding path program 1 times [2025-03-17 11:21:17,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:17,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058947858] [2025-03-17 11:21:17,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:17,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:17,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:21:17,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:21:17,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:17,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:17,871 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-17 11:21:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058947858] [2025-03-17 11:21:17,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058947858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:17,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:17,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262640625] [2025-03-17 11:21:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:17,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:17,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:17,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:17,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:17,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2025-03-17 11:21:17,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 55 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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-17 11:21:17,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:17,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2025-03-17 11:21:17,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:17,920 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2025-03-17 11:21:17,921 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:21:17,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 61 events. 0/61 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-03-17 11:21:17,922 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 7 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-03-17 11:21:17,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 134 flow [2025-03-17 11:21:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-17 11:21:17,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547619047619047 [2025-03-17 11:21:17,923 INFO L175 Difference]: Start difference. First operand has 84 places, 55 transitions, 116 flow. Second operand 4 states and 359 transitions. [2025-03-17 11:21:17,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 134 flow [2025-03-17 11:21:17,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 54 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:17,924 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 119 flow [2025-03-17 11:21:17,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-03-17 11:21:17,925 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -29 predicate places. [2025-03-17 11:21:17,925 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 119 flow [2025-03-17 11:21:17,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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-17 11:21:17,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:17,928 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:17,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:21:17,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:21:17,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash -133445760, now seen corresponding path program 1 times [2025-03-17 11:21:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:17,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266034412] [2025-03-17 11:21:17,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:17,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:17,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:21:17,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:21:17,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:17,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:17,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:17,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:21:17,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:21:17,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:17,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:17,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:17,989 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:17,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-17 11:21:17,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-17 11:21:17,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-17 11:21:17,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-17 11:21:17,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-17 11:21:17,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-17 11:21:17,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-03-17 11:21:17,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-17 11:21:17,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-17 11:21:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:21:17,992 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:17,994 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:17,994 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:21:18,023 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:18,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 302 flow [2025-03-17 11:21:18,042 INFO L124 PetriNetUnfolderBase]: 14/217 cut-off events. [2025-03-17 11:21:18,042 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:21:18,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 217 events. 14/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 466 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 228. Up to 6 conditions per place. [2025-03-17 11:21:18,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 141 transitions, 302 flow [2025-03-17 11:21:18,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 95 transitions, 203 flow [2025-03-17 11:21:18,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:18,044 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:18,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 11:21:18,046 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:18,046 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:18,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:18,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:21:18,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1094109161, now seen corresponding path program 1 times [2025-03-17 11:21:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882356535] [2025-03-17 11:21:18,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:18,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:18,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,061 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-17 11:21:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882356535] [2025-03-17 11:21:18,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882356535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033194983] [2025-03-17 11:21:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2025-03-17 11:21:18,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-17 11:21:18,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2025-03-17 11:21:18,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,136 INFO L124 PetriNetUnfolderBase]: 38/268 cut-off events. [2025-03-17 11:21:18,136 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 11:21:18,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 268 events. 38/268 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 891 event pairs, 34 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 185. Up to 83 conditions per place. [2025-03-17 11:21:18,140 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 15 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-03-17 11:21:18,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 231 flow [2025-03-17 11:21:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-03-17 11:21:18,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8486997635933806 [2025-03-17 11:21:18,142 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 203 flow. Second operand 3 states and 359 transitions. [2025-03-17 11:21:18,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 231 flow [2025-03-17 11:21:18,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 92 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:18,145 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 198 flow [2025-03-17 11:21:18,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2025-03-17 11:21:18,145 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2025-03-17 11:21:18,145 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 198 flow [2025-03-17 11:21:18,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-17 11:21:18,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:21:18,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:21:18,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 99464955, now seen corresponding path program 1 times [2025-03-17 11:21:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008100343] [2025-03-17 11:21:18,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:18,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:18,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,173 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-17 11:21:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008100343] [2025-03-17 11:21:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008100343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682028448] [2025-03-17 11:21:18,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 141 [2025-03-17 11:21:18,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-17 11:21:18,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 141 [2025-03-17 11:21:18,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,259 INFO L124 PetriNetUnfolderBase]: 26/230 cut-off events. [2025-03-17 11:21:18,259 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:21:18,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 230 events. 26/230 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 700 event pairs, 22 based on Foata normal form. 7/220 useless extension candidates. Maximal degree in co-relation 300. Up to 63 conditions per place. [2025-03-17 11:21:18,260 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 13 selfloop transitions, 1 changer transitions 18/86 dead transitions. [2025-03-17 11:21:18,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 86 transitions, 220 flow [2025-03-17 11:21:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-17 11:21:18,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8085106382978723 [2025-03-17 11:21:18,261 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 198 flow. Second operand 3 states and 342 transitions. [2025-03-17 11:21:18,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 86 transitions, 220 flow [2025-03-17 11:21:18,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 86 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:18,263 INFO L231 Difference]: Finished difference. Result has 93 places, 68 transitions, 148 flow [2025-03-17 11:21:18,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=93, PETRI_TRANSITIONS=68} [2025-03-17 11:21:18,263 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -6 predicate places. [2025-03-17 11:21:18,263 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 68 transitions, 148 flow [2025-03-17 11:21:18,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-17 11:21:18,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,264 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:21:18,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:21:18,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,265 INFO L85 PathProgramCache]: Analyzing trace with hash 797752002, now seen corresponding path program 1 times [2025-03-17 11:21:18,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725902511] [2025-03-17 11:21:18,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:21:18,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:21:18,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,327 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-17 11:21:18,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725902511] [2025-03-17 11:21:18,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725902511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:18,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276185222] [2025-03-17 11:21:18,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:18,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:18,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:18,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2025-03-17 11:21:18,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 68 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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-17 11:21:18,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2025-03-17 11:21:18,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,369 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2025-03-17 11:21:18,369 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 11:21:18,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 107 events. 2/107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 2 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 112. Up to 12 conditions per place. [2025-03-17 11:21:18,370 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 9 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-03-17 11:21:18,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 170 flow [2025-03-17 11:21:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2025-03-17 11:21:18,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528368794326241 [2025-03-17 11:21:18,371 INFO L175 Difference]: Start difference. First operand has 93 places, 68 transitions, 148 flow. Second operand 4 states and 481 transitions. [2025-03-17 11:21:18,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 170 flow [2025-03-17 11:21:18,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 67 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:18,373 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 151 flow [2025-03-17 11:21:18,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-03-17 11:21:18,373 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -23 predicate places. [2025-03-17 11:21:18,373 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 151 flow [2025-03-17 11:21:18,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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-17 11:21:18,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,374 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:21:18,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:21:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,375 INFO L85 PathProgramCache]: Analyzing trace with hash 78833892, now seen corresponding path program 1 times [2025-03-17 11:21:18,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181216710] [2025-03-17 11:21:18,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:21:18,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:21:18,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:18,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:18,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:21:18,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:21:18,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:18,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:18,400 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:18,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 11:21:18,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 11:21:18,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 11:21:18,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 11:21:18,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 11:21:18,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 11:21:18,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2025-03-17 11:21:18,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 11:21:18,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 11:21:18,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 11:21:18,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:21:18,402 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:18,403 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:18,403 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 11:21:18,434 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:18,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 177 transitions, 390 flow [2025-03-17 11:21:18,449 INFO L124 PetriNetUnfolderBase]: 18/280 cut-off events. [2025-03-17 11:21:18,449 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:21:18,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 280 events. 18/280 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 662 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 297. Up to 8 conditions per place. [2025-03-17 11:21:18,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 177 transitions, 390 flow [2025-03-17 11:21:18,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 102 transitions, 225 flow [2025-03-17 11:21:18,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:18,451 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:18,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-17 11:21:18,452 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:18,452 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:18,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:18,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-17 11:21:18,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1607746871, now seen corresponding path program 1 times [2025-03-17 11:21:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15587299] [2025-03-17 11:21:18,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:18,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:18,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,476 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-17 11:21:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15587299] [2025-03-17 11:21:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15587299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691190087] [2025-03-17 11:21:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 177 [2025-03-17 11:21:18,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 177 [2025-03-17 11:21:18,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,595 INFO L124 PetriNetUnfolderBase]: 115/514 cut-off events. [2025-03-17 11:21:18,596 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 11:21:18,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 514 events. 115/514 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2375 event pairs, 110 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 384. Up to 207 conditions per place. [2025-03-17 11:21:18,598 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 17 selfloop transitions, 2 changer transitions 1/99 dead transitions. [2025-03-17 11:21:18,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 257 flow [2025-03-17 11:21:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2025-03-17 11:21:18,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8436911487758946 [2025-03-17 11:21:18,600 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 225 flow. Second operand 3 states and 448 transitions. [2025-03-17 11:21:18,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 257 flow [2025-03-17 11:21:18,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 99 transitions, 254 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:18,604 INFO L231 Difference]: Finished difference. Result has 108 places, 98 transitions, 218 flow [2025-03-17 11:21:18,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=98} [2025-03-17 11:21:18,605 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2025-03-17 11:21:18,606 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 98 transitions, 218 flow [2025-03-17 11:21:18,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:21:18,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-17 11:21:18,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1088685740, now seen corresponding path program 1 times [2025-03-17 11:21:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002174193] [2025-03-17 11:21:18,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:18,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:18,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,626 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-17 11:21:18,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002174193] [2025-03-17 11:21:18,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002174193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755160582] [2025-03-17 11:21:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 177 [2025-03-17 11:21:18,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 98 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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-17 11:21:18,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 177 [2025-03-17 11:21:18,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,702 INFO L124 PetriNetUnfolderBase]: 83/432 cut-off events. [2025-03-17 11:21:18,702 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 11:21:18,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 432 events. 83/432 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1867 event pairs, 78 based on Foata normal form. 15/417 useless extension candidates. Maximal degree in co-relation 626. Up to 159 conditions per place. [2025-03-17 11:21:18,703 INFO L140 encePairwiseOnDemand]: 171/177 looper letters, 15 selfloop transitions, 1 changer transitions 18/93 dead transitions. [2025-03-17 11:21:18,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 93 transitions, 244 flow [2025-03-17 11:21:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2025-03-17 11:21:18,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.800376647834275 [2025-03-17 11:21:18,705 INFO L175 Difference]: Start difference. First operand has 108 places, 98 transitions, 218 flow. Second operand 3 states and 425 transitions. [2025-03-17 11:21:18,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 93 transitions, 244 flow [2025-03-17 11:21:18,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 93 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:18,707 INFO L231 Difference]: Finished difference. Result has 102 places, 75 transitions, 168 flow [2025-03-17 11:21:18,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=102, PETRI_TRANSITIONS=75} [2025-03-17 11:21:18,707 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -6 predicate places. [2025-03-17 11:21:18,707 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 75 transitions, 168 flow [2025-03-17 11:21:18,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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-17 11:21:18,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,708 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:21:18,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-17 11:21:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1835052990, now seen corresponding path program 1 times [2025-03-17 11:21:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739258183] [2025-03-17 11:21:18,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:21:18,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:21:18,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,777 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-17 11:21:18,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739258183] [2025-03-17 11:21:18,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739258183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328880592] [2025-03-17 11:21:18,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:18,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:18,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:18,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 177 [2025-03-17 11:21:18,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 75 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 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-17 11:21:18,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 177 [2025-03-17 11:21:18,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,833 INFO L124 PetriNetUnfolderBase]: 10/159 cut-off events. [2025-03-17 11:21:18,833 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 11:21:18,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 159 events. 10/159 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 305 event pairs, 10 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 192. Up to 28 conditions per place. [2025-03-17 11:21:18,835 INFO L140 encePairwiseOnDemand]: 173/177 looper letters, 11 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-17 11:21:18,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 74 transitions, 194 flow [2025-03-17 11:21:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2025-03-17 11:21:18,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8516949152542372 [2025-03-17 11:21:18,837 INFO L175 Difference]: Start difference. First operand has 102 places, 75 transitions, 168 flow. Second operand 4 states and 603 transitions. [2025-03-17 11:21:18,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 74 transitions, 194 flow [2025-03-17 11:21:18,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 74 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:18,839 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 171 flow [2025-03-17 11:21:18,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2025-03-17 11:21:18,840 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, -23 predicate places. [2025-03-17 11:21:18,840 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 171 flow [2025-03-17 11:21:18,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 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-17 11:21:18,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,840 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:21:18,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-17 11:21:18,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -311238927, now seen corresponding path program 1 times [2025-03-17 11:21:18,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960954195] [2025-03-17 11:21:18,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 11:21:18,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:21:18,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:18,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:18,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 11:21:18,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:21:18,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:18,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:18,881 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:18,881 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-17 11:21:18,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-17 11:21:18,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-17 11:21:18,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-17 11:21:18,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-17 11:21:18,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-17 11:21:18,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-03-17 11:21:18,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-17 11:21:18,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-17 11:21:18,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-17 11:21:18,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-17 11:21:18,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:21:18,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:18,882 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:18,882 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 11:21:18,922 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:18,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 213 transitions, 482 flow [2025-03-17 11:21:18,943 INFO L124 PetriNetUnfolderBase]: 22/343 cut-off events. [2025-03-17 11:21:18,943 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 11:21:18,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 343 events. 22/343 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 866 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 367. Up to 10 conditions per place. [2025-03-17 11:21:18,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 213 transitions, 482 flow [2025-03-17 11:21:18,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 249 flow [2025-03-17 11:21:18,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:18,946 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:18,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 11:21:18,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:18,948 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:18,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:18,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-17 11:21:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -782553815, now seen corresponding path program 1 times [2025-03-17 11:21:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459855730] [2025-03-17 11:21:18,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:18,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:18,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,960 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-17 11:21:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459855730] [2025-03-17 11:21:18,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459855730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633713167] [2025-03-17 11:21:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 213 [2025-03-17 11:21:19,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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-17 11:21:19,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 213 [2025-03-17 11:21:19,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,092 INFO L124 PetriNetUnfolderBase]: 316/1028 cut-off events. [2025-03-17 11:21:19,092 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-03-17 11:21:19,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 1028 events. 316/1028 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5858 event pairs, 310 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 835. Up to 503 conditions per place. [2025-03-17 11:21:19,100 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 19 selfloop transitions, 2 changer transitions 1/106 dead transitions. [2025-03-17 11:21:19,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 106 transitions, 285 flow [2025-03-17 11:21:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2025-03-17 11:21:19,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403755868544601 [2025-03-17 11:21:19,102 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 249 flow. Second operand 3 states and 537 transitions. [2025-03-17 11:21:19,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 106 transitions, 285 flow [2025-03-17 11:21:19,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 106 transitions, 278 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:19,105 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 238 flow [2025-03-17 11:21:19,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2025-03-17 11:21:19,106 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2025-03-17 11:21:19,106 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 238 flow [2025-03-17 11:21:19,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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-17 11:21:19,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:21:19,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-17 11:21:19,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,107 INFO L85 PathProgramCache]: Analyzing trace with hash 22426241, now seen corresponding path program 1 times [2025-03-17 11:21:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271815655] [2025-03-17 11:21:19,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:19,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:19,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,119 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-17 11:21:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271815655] [2025-03-17 11:21:19,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271815655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226621790] [2025-03-17 11:21:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:19,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:19,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2025-03-17 11:21:19,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-17 11:21:19,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2025-03-17 11:21:19,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,252 INFO L124 PetriNetUnfolderBase]: 236/850 cut-off events. [2025-03-17 11:21:19,252 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 11:21:19,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 850 events. 236/850 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4610 event pairs, 230 based on Foata normal form. 31/834 useless extension candidates. Maximal degree in co-relation 1332. Up to 391 conditions per place. [2025-03-17 11:21:19,257 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 17 selfloop transitions, 1 changer transitions 18/100 dead transitions. [2025-03-17 11:21:19,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 100 transitions, 268 flow [2025-03-17 11:21:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2025-03-17 11:21:19,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7949921752738655 [2025-03-17 11:21:19,259 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 238 flow. Second operand 3 states and 508 transitions. [2025-03-17 11:21:19,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 100 transitions, 268 flow [2025-03-17 11:21:19,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:19,261 INFO L231 Difference]: Finished difference. Result has 111 places, 82 transitions, 188 flow [2025-03-17 11:21:19,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2025-03-17 11:21:19,263 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -6 predicate places. [2025-03-17 11:21:19,263 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 188 flow [2025-03-17 11:21:19,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-17 11:21:19,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,263 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:19,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:21:19,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-17 11:21:19,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,264 INFO L85 PathProgramCache]: Analyzing trace with hash -724127361, now seen corresponding path program 1 times [2025-03-17 11:21:19,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436494372] [2025-03-17 11:21:19,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:21:19,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:21:19,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,340 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-17 11:21:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436494372] [2025-03-17 11:21:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436494372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014992594] [2025-03-17 11:21:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:19,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:19,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 213 [2025-03-17 11:21:19,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 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-17 11:21:19,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 213 [2025-03-17 11:21:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,398 INFO L124 PetriNetUnfolderBase]: 34/251 cut-off events. [2025-03-17 11:21:19,399 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 11:21:19,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 251 events. 34/251 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 744 event pairs, 34 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 348. Up to 68 conditions per place. [2025-03-17 11:21:19,400 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 13 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-03-17 11:21:19,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 81 transitions, 218 flow [2025-03-17 11:21:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions. [2025-03-17 11:21:19,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509389671361502 [2025-03-17 11:21:19,401 INFO L175 Difference]: Start difference. First operand has 111 places, 82 transitions, 188 flow. Second operand 4 states and 725 transitions. [2025-03-17 11:21:19,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 81 transitions, 218 flow [2025-03-17 11:21:19,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 81 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:19,403 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 191 flow [2025-03-17 11:21:19,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2025-03-17 11:21:19,403 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -23 predicate places. [2025-03-17 11:21:19,403 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 191 flow [2025-03-17 11:21:19,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 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-17 11:21:19,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,404 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:19,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:21:19,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-17 11:21:19,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash -25308441, now seen corresponding path program 1 times [2025-03-17 11:21:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546711813] [2025-03-17 11:21:19,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:21:19,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:21:19,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:19,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:19,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:21:19,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:21:19,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:19,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:19,429 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-17 11:21:19,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-17 11:21:19,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-17 11:21:19,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-17 11:21:19,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:21:19,430 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:19,430 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:19,430 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 11:21:19,457 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:19,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 249 transitions, 578 flow [2025-03-17 11:21:19,485 INFO L124 PetriNetUnfolderBase]: 26/406 cut-off events. [2025-03-17 11:21:19,485 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 11:21:19,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 406 events. 26/406 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1058 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 438. Up to 12 conditions per place. [2025-03-17 11:21:19,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 249 transitions, 578 flow [2025-03-17 11:21:19,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 116 transitions, 275 flow [2025-03-17 11:21:19,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:19,491 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:19,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 11:21:19,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:19,493 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:19,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:19,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:21:19,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash -725278967, now seen corresponding path program 1 times [2025-03-17 11:21:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426689419] [2025-03-17 11:21:19,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:19,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:19,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,509 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-17 11:21:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426689419] [2025-03-17 11:21:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426689419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:19,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128467439] [2025-03-17 11:21:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:19,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:19,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 249 [2025-03-17 11:21:19,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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-17 11:21:19,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 249 [2025-03-17 11:21:19,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,733 INFO L124 PetriNetUnfolderBase]: 813/2126 cut-off events. [2025-03-17 11:21:19,733 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-03-17 11:21:19,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 2126 events. 813/2126 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13744 event pairs, 806 based on Foata normal form. 1/2038 useless extension candidates. Maximal degree in co-relation 1830. Up to 1191 conditions per place. [2025-03-17 11:21:19,745 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 21 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-03-17 11:21:19,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 113 transitions, 315 flow [2025-03-17 11:21:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-03-17 11:21:19,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8380187416331994 [2025-03-17 11:21:19,746 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 275 flow. Second operand 3 states and 626 transitions. [2025-03-17 11:21:19,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 113 transitions, 315 flow [2025-03-17 11:21:19,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 113 transitions, 302 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:19,749 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 258 flow [2025-03-17 11:21:19,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2025-03-17 11:21:19,750 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2025-03-17 11:21:19,750 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 258 flow [2025-03-17 11:21:19,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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-17 11:21:19,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:21:19,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:21:19,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1195653754, now seen corresponding path program 1 times [2025-03-17 11:21:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800298053] [2025-03-17 11:21:19,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:19,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:19,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,768 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-17 11:21:19,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800298053] [2025-03-17 11:21:19,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800298053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881521993] [2025-03-17 11:21:19,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:19,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:19,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 249 [2025-03-17 11:21:19,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-17 11:21:19,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 249 [2025-03-17 11:21:19,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,946 INFO L124 PetriNetUnfolderBase]: 621/1740 cut-off events. [2025-03-17 11:21:19,946 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-17 11:21:19,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1740 events. 621/1740 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10817 event pairs, 614 based on Foata normal form. 63/1735 useless extension candidates. Maximal degree in co-relation 2878. Up to 935 conditions per place. [2025-03-17 11:21:19,953 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 19 selfloop transitions, 1 changer transitions 18/107 dead transitions. [2025-03-17 11:21:19,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 107 transitions, 292 flow [2025-03-17 11:21:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2025-03-17 11:21:19,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911646586345381 [2025-03-17 11:21:19,955 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 258 flow. Second operand 3 states and 591 transitions. [2025-03-17 11:21:19,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 107 transitions, 292 flow [2025-03-17 11:21:19,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 107 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:19,957 INFO L231 Difference]: Finished difference. Result has 120 places, 89 transitions, 208 flow [2025-03-17 11:21:19,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=120, PETRI_TRANSITIONS=89} [2025-03-17 11:21:19,958 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -6 predicate places. [2025-03-17 11:21:19,958 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 89 transitions, 208 flow [2025-03-17 11:21:19,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-17 11:21:19,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,959 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:19,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:21:19,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:21:19,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1523832389, now seen corresponding path program 1 times [2025-03-17 11:21:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526606390] [2025-03-17 11:21:19,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 11:21:19,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 11:21:19,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:20,015 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-17 11:21:20,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:20,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526606390] [2025-03-17 11:21:20,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526606390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:20,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:20,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:20,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293143437] [2025-03-17 11:21:20,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:20,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:20,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:20,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:20,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:20,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 249 [2025-03-17 11:21:20,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 89 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-17 11:21:20,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:20,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 249 [2025-03-17 11:21:20,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:20,113 INFO L124 PetriNetUnfolderBase]: 98/431 cut-off events. [2025-03-17 11:21:20,113 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-03-17 11:21:20,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 431 events. 98/431 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1763 event pairs, 98 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 672. Up to 164 conditions per place. [2025-03-17 11:21:20,115 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 15 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-03-17 11:21:20,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 242 flow [2025-03-17 11:21:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 847 transitions. [2025-03-17 11:21:20,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504016064257028 [2025-03-17 11:21:20,118 INFO L175 Difference]: Start difference. First operand has 120 places, 89 transitions, 208 flow. Second operand 4 states and 847 transitions. [2025-03-17 11:21:20,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 88 transitions, 242 flow [2025-03-17 11:21:20,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 88 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:20,119 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 211 flow [2025-03-17 11:21:20,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2025-03-17 11:21:20,120 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -23 predicate places. [2025-03-17 11:21:20,120 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 211 flow [2025-03-17 11:21:20,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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-17 11:21:20,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:20,121 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:20,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:21:20,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:21:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1175044602, now seen corresponding path program 1 times [2025-03-17 11:21:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:20,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817398704] [2025-03-17 11:21:20,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:20,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 11:21:20,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 11:21:20,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:20,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:20,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 11:21:20,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 11:21:20,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:20,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:20,167 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-17 11:21:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-17 11:21:20,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-17 11:21:20,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-17 11:21:20,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-17 11:21:20,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:21:20,168 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:20,168 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:20,168 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-17 11:21:20,209 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:20,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 285 transitions, 678 flow [2025-03-17 11:21:20,246 INFO L124 PetriNetUnfolderBase]: 30/469 cut-off events. [2025-03-17 11:21:20,246 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 11:21:20,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 469 events. 30/469 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1224 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 510. Up to 14 conditions per place. [2025-03-17 11:21:20,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 285 transitions, 678 flow [2025-03-17 11:21:20,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 123 transitions, 303 flow [2025-03-17 11:21:20,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:20,251 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:20,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 11:21:20,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:20,252 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:20,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:20,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:20,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:20,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-17 11:21:20,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1435922327, now seen corresponding path program 1 times [2025-03-17 11:21:20,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:20,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747138880] [2025-03-17 11:21:20,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:20,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:20,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:20,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:20,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:20,275 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-17 11:21:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747138880] [2025-03-17 11:21:20,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747138880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:20,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:20,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:20,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845822850] [2025-03-17 11:21:20,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:20,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:20,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:20,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:20,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:20,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 285 [2025-03-17 11:21:20,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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-17 11:21:20,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:20,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 285 [2025-03-17 11:21:20,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:20,765 INFO L124 PetriNetUnfolderBase]: 1998/4488 cut-off events. [2025-03-17 11:21:20,766 INFO L125 PetriNetUnfolderBase]: For 1165/1165 co-relation queries the response was YES. [2025-03-17 11:21:20,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7895 conditions, 4488 events. 1998/4488 cut-off events. For 1165/1165 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 31838 event pairs, 1990 based on Foata normal form. 1/4372 useless extension candidates. Maximal degree in co-relation 4009. Up to 2759 conditions per place. [2025-03-17 11:21:20,792 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 23 selfloop transitions, 2 changer transitions 1/120 dead transitions. [2025-03-17 11:21:20,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 120 transitions, 347 flow [2025-03-17 11:21:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-03-17 11:21:20,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8362573099415205 [2025-03-17 11:21:20,794 INFO L175 Difference]: Start difference. First operand has 135 places, 123 transitions, 303 flow. Second operand 3 states and 715 transitions. [2025-03-17 11:21:20,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 120 transitions, 347 flow [2025-03-17 11:21:20,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 120 transitions, 326 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:20,796 INFO L231 Difference]: Finished difference. Result has 135 places, 119 transitions, 278 flow [2025-03-17 11:21:20,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=135, PETRI_TRANSITIONS=119} [2025-03-17 11:21:20,797 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2025-03-17 11:21:20,797 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 119 transitions, 278 flow [2025-03-17 11:21:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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-17 11:21:20,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:20,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:20,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:21:20,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-17 11:21:20,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 313400983, now seen corresponding path program 1 times [2025-03-17 11:21:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430153034] [2025-03-17 11:21:20,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:20,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:20,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:20,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:20,814 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-17 11:21:20,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:20,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430153034] [2025-03-17 11:21:20,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430153034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:20,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:20,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:20,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383591066] [2025-03-17 11:21:20,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:20,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:20,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:20,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:20,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 285 [2025-03-17 11:21:20,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 119 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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-17 11:21:20,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:20,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 285 [2025-03-17 11:21:20,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:21,150 INFO L124 PetriNetUnfolderBase]: 1550/3654 cut-off events. [2025-03-17 11:21:21,151 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-17 11:21:21,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 3654 events. 1550/3654 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 25058 event pairs, 1542 based on Foata normal form. 127/3688 useless extension candidates. Maximal degree in co-relation 6264. Up to 2183 conditions per place. [2025-03-17 11:21:21,168 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 21 selfloop transitions, 1 changer transitions 18/114 dead transitions. [2025-03-17 11:21:21,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 316 flow [2025-03-17 11:21:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2025-03-17 11:21:21,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7883040935672515 [2025-03-17 11:21:21,171 INFO L175 Difference]: Start difference. First operand has 135 places, 119 transitions, 278 flow. Second operand 3 states and 674 transitions. [2025-03-17 11:21:21,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 316 flow [2025-03-17 11:21:21,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 114 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:21,173 INFO L231 Difference]: Finished difference. Result has 129 places, 96 transitions, 228 flow [2025-03-17 11:21:21,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=129, PETRI_TRANSITIONS=96} [2025-03-17 11:21:21,175 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -6 predicate places. [2025-03-17 11:21:21,175 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 96 transitions, 228 flow [2025-03-17 11:21:21,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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-17 11:21:21,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:21,176 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:21,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:21:21,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-17 11:21:21,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1441006672, now seen corresponding path program 1 times [2025-03-17 11:21:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553927556] [2025-03-17 11:21:21,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:21,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:21,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:21:21,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:21:21,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:21,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:21,312 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-17 11:21:21,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553927556] [2025-03-17 11:21:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553927556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:21,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:21,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032263654] [2025-03-17 11:21:21,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:21,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:21,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:21,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:21,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 285 [2025-03-17 11:21:21,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 96 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 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-17 11:21:21,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:21,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 285 [2025-03-17 11:21:21,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:21,459 INFO L124 PetriNetUnfolderBase]: 258/803 cut-off events. [2025-03-17 11:21:21,459 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-03-17 11:21:21,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 803 events. 258/803 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4055 event pairs, 258 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1364. Up to 388 conditions per place. [2025-03-17 11:21:21,465 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 17 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-03-17 11:21:21,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 95 transitions, 266 flow [2025-03-17 11:21:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 969 transitions. [2025-03-17 11:21:21,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-17 11:21:21,467 INFO L175 Difference]: Start difference. First operand has 129 places, 96 transitions, 228 flow. Second operand 4 states and 969 transitions. [2025-03-17 11:21:21,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 95 transitions, 266 flow [2025-03-17 11:21:21,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 95 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:21,469 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 231 flow [2025-03-17 11:21:21,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2025-03-17 11:21:21,469 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -23 predicate places. [2025-03-17 11:21:21,469 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 231 flow [2025-03-17 11:21:21,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 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-17 11:21:21,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:21,470 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:21,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:21:21,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-17 11:21:21,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1442125426, now seen corresponding path program 1 times [2025-03-17 11:21:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:21,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589543448] [2025-03-17 11:21:21,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:21,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 11:21:21,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:21:21,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:21,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:21,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:21,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 11:21:21,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:21:21,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:21,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:21,512 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-17 11:21:21,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-17 11:21:21,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-17 11:21:21,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-17 11:21:21,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:21:21,513 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:21,513 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:21,513 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-17 11:21:21,556 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:21,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 321 transitions, 782 flow [2025-03-17 11:21:21,599 INFO L124 PetriNetUnfolderBase]: 34/532 cut-off events. [2025-03-17 11:21:21,599 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-17 11:21:21,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 532 events. 34/532 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1449 event pairs, 0 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 583. Up to 16 conditions per place. [2025-03-17 11:21:21,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 321 transitions, 782 flow [2025-03-17 11:21:21,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 130 transitions, 333 flow [2025-03-17 11:21:21,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:21,602 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:21,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-17 11:21:21,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:21,603 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:21,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:21,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:21,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:21,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:21:21,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1380483401, now seen corresponding path program 1 times [2025-03-17 11:21:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589381313] [2025-03-17 11:21:21,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:21,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:21,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:21,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:21,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:21,617 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-17 11:21:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589381313] [2025-03-17 11:21:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589381313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106519750] [2025-03-17 11:21:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:21,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:21,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:21,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:21,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 321 [2025-03-17 11:21:21,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 130 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-17 11:21:21,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:21,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 321 [2025-03-17 11:21:21,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:22,548 INFO L124 PetriNetUnfolderBase]: 4751/9570 cut-off events. [2025-03-17 11:21:22,549 INFO L125 PetriNetUnfolderBase]: For 3091/3091 co-relation queries the response was YES. [2025-03-17 11:21:22,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17266 conditions, 9570 events. 4751/9570 cut-off events. For 3091/3091 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 72588 event pairs, 4742 based on Foata normal form. 1/9422 useless extension candidates. Maximal degree in co-relation 8748. Up to 6279 conditions per place. [2025-03-17 11:21:22,617 INFO L140 encePairwiseOnDemand]: 316/321 looper letters, 25 selfloop transitions, 2 changer transitions 1/127 dead transitions. [2025-03-17 11:21:22,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 127 transitions, 381 flow [2025-03-17 11:21:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2025-03-17 11:21:22,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8348909657320872 [2025-03-17 11:21:22,620 INFO L175 Difference]: Start difference. First operand has 144 places, 130 transitions, 333 flow. Second operand 3 states and 804 transitions. [2025-03-17 11:21:22,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 127 transitions, 381 flow [2025-03-17 11:21:22,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 127 transitions, 350 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:22,623 INFO L231 Difference]: Finished difference. Result has 144 places, 126 transitions, 298 flow [2025-03-17 11:21:22,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=144, PETRI_TRANSITIONS=126} [2025-03-17 11:21:22,624 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2025-03-17 11:21:22,624 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 298 flow [2025-03-17 11:21:22,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-17 11:21:22,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:22,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:21:22,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:21:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1670635224, now seen corresponding path program 1 times [2025-03-17 11:21:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544759328] [2025-03-17 11:21:22,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:22,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:22,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:22,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:22,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:22,638 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-17 11:21:22,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:22,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544759328] [2025-03-17 11:21:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544759328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:22,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:22,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:22,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537136058] [2025-03-17 11:21:22,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:22,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:22,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:22,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:22,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 321 [2025-03-17 11:21:22,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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-17 11:21:22,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:22,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 321 [2025-03-17 11:21:22,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:23,354 INFO L124 PetriNetUnfolderBase]: 3727/7776 cut-off events. [2025-03-17 11:21:23,354 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-17 11:21:23,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 7776 events. 3727/7776 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 57140 event pairs, 3718 based on Foata normal form. 255/7909 useless extension candidates. Maximal degree in co-relation 13650. Up to 4999 conditions per place. [2025-03-17 11:21:23,394 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 23 selfloop transitions, 1 changer transitions 18/121 dead transitions. [2025-03-17 11:21:23,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 121 transitions, 340 flow [2025-03-17 11:21:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2025-03-17 11:21:23,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7860851505711319 [2025-03-17 11:21:23,400 INFO L175 Difference]: Start difference. First operand has 144 places, 126 transitions, 298 flow. Second operand 3 states and 757 transitions. [2025-03-17 11:21:23,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 121 transitions, 340 flow [2025-03-17 11:21:23,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 121 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:23,401 INFO L231 Difference]: Finished difference. Result has 138 places, 103 transitions, 248 flow [2025-03-17 11:21:23,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=138, PETRI_TRANSITIONS=103} [2025-03-17 11:21:23,402 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -6 predicate places. [2025-03-17 11:21:23,402 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 103 transitions, 248 flow [2025-03-17 11:21:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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-17 11:21:23,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:23,407 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:23,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:21:23,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:21:23,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1313476128, now seen corresponding path program 1 times [2025-03-17 11:21:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617887183] [2025-03-17 11:21:23,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:23,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 11:21:23,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 11:21:23,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:23,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:23,547 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-17 11:21:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:23,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617887183] [2025-03-17 11:21:23,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617887183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:23,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:23,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434914663] [2025-03-17 11:21:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:23,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:23,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:23,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:23,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 321 [2025-03-17 11:21:23,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 103 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 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-17 11:21:23,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:23,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 321 [2025-03-17 11:21:23,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:23,749 INFO L124 PetriNetUnfolderBase]: 642/1591 cut-off events. [2025-03-17 11:21:23,749 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2025-03-17 11:21:23,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 1591 events. 642/1591 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9348 event pairs, 642 based on Foata normal form. 0/1492 useless extension candidates. Maximal degree in co-relation 2856. Up to 900 conditions per place. [2025-03-17 11:21:23,763 INFO L140 encePairwiseOnDemand]: 317/321 looper letters, 19 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-03-17 11:21:23,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 102 transitions, 290 flow [2025-03-17 11:21:23,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1091 transitions. [2025-03-17 11:21:23,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8496884735202492 [2025-03-17 11:21:23,765 INFO L175 Difference]: Start difference. First operand has 138 places, 103 transitions, 248 flow. Second operand 4 states and 1091 transitions. [2025-03-17 11:21:23,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 102 transitions, 290 flow [2025-03-17 11:21:23,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 102 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:23,767 INFO L231 Difference]: Finished difference. Result has 121 places, 102 transitions, 251 flow [2025-03-17 11:21:23,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=121, PETRI_TRANSITIONS=102} [2025-03-17 11:21:23,768 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -23 predicate places. [2025-03-17 11:21:23,768 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 102 transitions, 251 flow [2025-03-17 11:21:23,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 270.5) internal successors, (1082), 4 states have internal predecessors, (1082), 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-17 11:21:23,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:23,769 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:23,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:21:23,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:21:23,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1309863615, now seen corresponding path program 1 times [2025-03-17 11:21:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:23,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501814068] [2025-03-17 11:21:23,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:23,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:21:23,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:21:23,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:23,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:23,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:21:23,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:21:23,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:23,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:23,813 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:23,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-17 11:21:23,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-17 11:21:23,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-17 11:21:23,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-17 11:21:23,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-17 11:21:23,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-17 11:21:23,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-17 11:21:23,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:21:23,815 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:23,816 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:23,816 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-03-17 11:21:23,871 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:23,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 364 places, 357 transitions, 890 flow [2025-03-17 11:21:23,916 INFO L124 PetriNetUnfolderBase]: 38/595 cut-off events. [2025-03-17 11:21:23,917 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-17 11:21:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 595 events. 38/595 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1596 event pairs, 0 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 657. Up to 18 conditions per place. [2025-03-17 11:21:23,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 357 transitions, 890 flow [2025-03-17 11:21:23,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 137 transitions, 365 flow [2025-03-17 11:21:23,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:23,920 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:23,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 11:21:23,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:23,922 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-17 11:21:23,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:23,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:23,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:23,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:21:23,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash -865996375, now seen corresponding path program 1 times [2025-03-17 11:21:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189292208] [2025-03-17 11:21:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:23,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:23,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:23,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:23,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:23,937 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-17 11:21:23,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:23,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189292208] [2025-03-17 11:21:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189292208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:23,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526186782] [2025-03-17 11:21:23,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:23,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:23,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:23,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:23,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 357 [2025-03-17 11:21:23,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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-17 11:21:23,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:23,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 357 [2025-03-17 11:21:23,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:25,876 INFO L124 PetriNetUnfolderBase]: 11024/20476 cut-off events. [2025-03-17 11:21:25,876 INFO L125 PetriNetUnfolderBase]: For 7962/7962 co-relation queries the response was YES. [2025-03-17 11:21:25,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37645 conditions, 20476 events. 11024/20476 cut-off events. For 7962/7962 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 164340 event pairs, 11014 based on Foata normal form. 1/20292 useless extension candidates. Maximal degree in co-relation 18991. Up to 14087 conditions per place. [2025-03-17 11:21:26,022 INFO L140 encePairwiseOnDemand]: 352/357 looper letters, 27 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-03-17 11:21:26,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 134 transitions, 417 flow [2025-03-17 11:21:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-17 11:21:26,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8338001867413632 [2025-03-17 11:21:26,024 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 365 flow. Second operand 3 states and 893 transitions. [2025-03-17 11:21:26,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 134 transitions, 417 flow [2025-03-17 11:21:26,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 134 transitions, 374 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:26,028 INFO L231 Difference]: Finished difference. Result has 153 places, 133 transitions, 318 flow [2025-03-17 11:21:26,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=153, PETRI_TRANSITIONS=133} [2025-03-17 11:21:26,028 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2025-03-17 11:21:26,028 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 133 transitions, 318 flow [2025-03-17 11:21:26,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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-17 11:21:26,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:26,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:26,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:21:26,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:21:26,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 972389181, now seen corresponding path program 1 times [2025-03-17 11:21:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:26,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215506127] [2025-03-17 11:21:26,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:26,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:26,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:26,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:26,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:26,042 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-17 11:21:26,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215506127] [2025-03-17 11:21:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215506127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587188369] [2025-03-17 11:21:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:26,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:26,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:26,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 357 [2025-03-17 11:21:26,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 133 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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-17 11:21:26,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:26,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 357 [2025-03-17 11:21:26,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:27,611 INFO L124 PetriNetUnfolderBase]: 8720/16634 cut-off events. [2025-03-17 11:21:27,611 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-03-17 11:21:27,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29705 conditions, 16634 events. 8720/16634 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 129966 event pairs, 8710 based on Foata normal form. 511/16990 useless extension candidates. Maximal degree in co-relation 29676. Up to 11271 conditions per place. [2025-03-17 11:21:27,707 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 25 selfloop transitions, 1 changer transitions 18/128 dead transitions. [2025-03-17 11:21:27,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 128 transitions, 364 flow [2025-03-17 11:21:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2025-03-17 11:21:27,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-03-17 11:21:27,817 INFO L175 Difference]: Start difference. First operand has 153 places, 133 transitions, 318 flow. Second operand 3 states and 840 transitions. [2025-03-17 11:21:27,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 128 transitions, 364 flow [2025-03-17 11:21:27,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 128 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:27,819 INFO L231 Difference]: Finished difference. Result has 147 places, 110 transitions, 268 flow [2025-03-17 11:21:27,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=147, PETRI_TRANSITIONS=110} [2025-03-17 11:21:27,820 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -6 predicate places. [2025-03-17 11:21:27,820 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 110 transitions, 268 flow [2025-03-17 11:21:27,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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-17 11:21:27,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:27,820 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:27,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:21:27,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:21:27,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -510188235, now seen corresponding path program 1 times [2025-03-17 11:21:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:27,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390488536] [2025-03-17 11:21:27,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:27,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 11:21:27,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 11:21:27,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:27,882 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-17 11:21:27,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:27,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390488536] [2025-03-17 11:21:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390488536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:27,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218951182] [2025-03-17 11:21:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:27,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:27,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:27,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:27,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:27,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 357 [2025-03-17 11:21:27,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 110 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 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-17 11:21:27,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:27,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 357 [2025-03-17 11:21:27,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:28,172 INFO L124 PetriNetUnfolderBase]: 1538/3275 cut-off events. [2025-03-17 11:21:28,172 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2025-03-17 11:21:28,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 3275 events. 1538/3275 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 21565 event pairs, 1538 based on Foata normal form. 0/3112 useless extension candidates. Maximal degree in co-relation 6076. Up to 2052 conditions per place. [2025-03-17 11:21:28,200 INFO L140 encePairwiseOnDemand]: 353/357 looper letters, 21 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-03-17 11:21:28,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 109 transitions, 314 flow [2025-03-17 11:21:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1213 transitions. [2025-03-17 11:21:28,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8494397759103641 [2025-03-17 11:21:28,203 INFO L175 Difference]: Start difference. First operand has 147 places, 110 transitions, 268 flow. Second operand 4 states and 1213 transitions. [2025-03-17 11:21:28,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 109 transitions, 314 flow [2025-03-17 11:21:28,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 109 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:28,205 INFO L231 Difference]: Finished difference. Result has 130 places, 109 transitions, 271 flow [2025-03-17 11:21:28,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=130, PETRI_TRANSITIONS=109} [2025-03-17 11:21:28,206 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -23 predicate places. [2025-03-17 11:21:28,206 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 271 flow [2025-03-17 11:21:28,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 300.75) internal successors, (1203), 4 states have internal predecessors, (1203), 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-17 11:21:28,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:28,206 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:28,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:21:28,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:21:28,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1655289561, now seen corresponding path program 1 times [2025-03-17 11:21:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221987233] [2025-03-17 11:21:28,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:28,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:21:28,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:21:28,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:28,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:28,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:28,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:21:28,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:21:28,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:28,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:28,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:28,249 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:28,249 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-17 11:21:28,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-17 11:21:28,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-17 11:21:28,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:21:28,251 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:28,251 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:28,251 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-03-17 11:21:28,297 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:28,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 393 transitions, 1002 flow [2025-03-17 11:21:28,332 INFO L124 PetriNetUnfolderBase]: 42/658 cut-off events. [2025-03-17 11:21:28,332 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-17 11:21:28,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 658 events. 42/658 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1789 event pairs, 0 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 732. Up to 20 conditions per place. [2025-03-17 11:21:28,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 393 transitions, 1002 flow [2025-03-17 11:21:28,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 144 transitions, 399 flow [2025-03-17 11:21:28,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:28,336 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:28,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-17 11:21:28,338 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:28,338 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:28,338 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:28,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:28,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:28,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 11:21:28,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash 414572937, now seen corresponding path program 1 times [2025-03-17 11:21:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:28,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259337010] [2025-03-17 11:21:28,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:28,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:28,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:28,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:28,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:28,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:28,352 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-17 11:21:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259337010] [2025-03-17 11:21:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259337010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:28,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:28,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456271921] [2025-03-17 11:21:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:28,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:28,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:28,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:28,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 393 [2025-03-17 11:21:28,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 144 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-17 11:21:28,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:28,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 393 [2025-03-17 11:21:28,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:32,528 INFO L124 PetriNetUnfolderBase]: 25105/43798 cut-off events. [2025-03-17 11:21:32,528 INFO L125 PetriNetUnfolderBase]: For 20002/20002 co-relation queries the response was YES. [2025-03-17 11:21:32,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81704 conditions, 43798 events. 25105/43798 cut-off events. For 20002/20002 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 366579 event pairs, 25094 based on Foata normal form. 1/43574 useless extension candidates. Maximal degree in co-relation 41010. Up to 31239 conditions per place. [2025-03-17 11:21:32,929 INFO L140 encePairwiseOnDemand]: 388/393 looper letters, 29 selfloop transitions, 2 changer transitions 1/141 dead transitions. [2025-03-17 11:21:32,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 141 transitions, 455 flow [2025-03-17 11:21:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2025-03-17 11:21:32,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8329092451229856 [2025-03-17 11:21:32,931 INFO L175 Difference]: Start difference. First operand has 162 places, 144 transitions, 399 flow. Second operand 3 states and 982 transitions. [2025-03-17 11:21:32,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 141 transitions, 455 flow [2025-03-17 11:21:32,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 141 transitions, 398 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:32,936 INFO L231 Difference]: Finished difference. Result has 162 places, 140 transitions, 338 flow [2025-03-17 11:21:32,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=162, PETRI_TRANSITIONS=140} [2025-03-17 11:21:32,936 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 0 predicate places. [2025-03-17 11:21:32,936 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 140 transitions, 338 flow [2025-03-17 11:21:32,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-17 11:21:32,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:32,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:32,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:21:32,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 11:21:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1781337146, now seen corresponding path program 1 times [2025-03-17 11:21:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:32,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730549855] [2025-03-17 11:21:32,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:32,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:32,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:32,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:32,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:32,949 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-17 11:21:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:32,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730549855] [2025-03-17 11:21:32,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730549855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:32,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:32,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82298845] [2025-03-17 11:21:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:32,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:32,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:32,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:32,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 393 [2025-03-17 11:21:32,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 140 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-17 11:21:32,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:32,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 393 [2025-03-17 11:21:32,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:36,260 INFO L124 PetriNetUnfolderBase]: 19985/35604 cut-off events. [2025-03-17 11:21:36,260 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2025-03-17 11:21:36,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64292 conditions, 35604 events. 19985/35604 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 290540 event pairs, 19974 based on Foata normal form. 1023/36435 useless extension candidates. Maximal degree in co-relation 64262. Up to 25095 conditions per place. [2025-03-17 11:21:36,465 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 27 selfloop transitions, 1 changer transitions 18/135 dead transitions. [2025-03-17 11:21:36,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 135 transitions, 388 flow [2025-03-17 11:21:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-03-17 11:21:36,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7828668363019508 [2025-03-17 11:21:36,467 INFO L175 Difference]: Start difference. First operand has 162 places, 140 transitions, 338 flow. Second operand 3 states and 923 transitions. [2025-03-17 11:21:36,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 135 transitions, 388 flow [2025-03-17 11:21:36,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:36,469 INFO L231 Difference]: Finished difference. Result has 156 places, 117 transitions, 288 flow [2025-03-17 11:21:36,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=156, PETRI_TRANSITIONS=117} [2025-03-17 11:21:36,470 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -6 predicate places. [2025-03-17 11:21:36,470 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 117 transitions, 288 flow [2025-03-17 11:21:36,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-17 11:21:36,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:36,470 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:36,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:21:36,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 11:21:36,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash -772803441, now seen corresponding path program 1 times [2025-03-17 11:21:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:36,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551444715] [2025-03-17 11:21:36,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:36,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 11:21:36,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 11:21:36,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:36,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:36,516 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-17 11:21:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551444715] [2025-03-17 11:21:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551444715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:36,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:21:36,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425367071] [2025-03-17 11:21:36,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:36,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:21:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:36,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:21:36,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:21:36,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 393 [2025-03-17 11:21:36,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 117 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 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-17 11:21:36,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:36,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 393 [2025-03-17 11:21:36,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:37,484 INFO L124 PetriNetUnfolderBase]: 3586/6879 cut-off events. [2025-03-17 11:21:37,484 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-03-17 11:21:37,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13040 conditions, 6879 events. 3586/6879 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 49336 event pairs, 3586 based on Foata normal form. 0/6623 useless extension candidates. Maximal degree in co-relation 13008. Up to 4612 conditions per place. [2025-03-17 11:21:37,552 INFO L140 encePairwiseOnDemand]: 389/393 looper letters, 23 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-03-17 11:21:37,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 116 transitions, 338 flow [2025-03-17 11:21:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:21:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 11:21:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1335 transitions. [2025-03-17 11:21:37,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8492366412213741 [2025-03-17 11:21:37,554 INFO L175 Difference]: Start difference. First operand has 156 places, 117 transitions, 288 flow. Second operand 4 states and 1335 transitions. [2025-03-17 11:21:37,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 116 transitions, 338 flow [2025-03-17 11:21:37,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 116 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:37,557 INFO L231 Difference]: Finished difference. Result has 139 places, 116 transitions, 291 flow [2025-03-17 11:21:37,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=139, PETRI_TRANSITIONS=116} [2025-03-17 11:21:37,557 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -23 predicate places. [2025-03-17 11:21:37,557 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 116 transitions, 291 flow [2025-03-17 11:21:37,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 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-17 11:21:37,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:37,558 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:21:37,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:21:37,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 11:21:37,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash -993330404, now seen corresponding path program 1 times [2025-03-17 11:21:37,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:37,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847906467] [2025-03-17 11:21:37,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:37,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 11:21:37,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 11:21:37,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:37,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:37,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:37,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 11:21:37,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 11:21:37,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:37,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:37,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:37,597 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 17 remaining) [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-03-17 11:21:37,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-03-17 11:21:37,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-03-17 11:21:37,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-03-17 11:21:37,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-03-17 11:21:37,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-03-17 11:21:37,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-03-17 11:21:37,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-03-17 11:21:37,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-03-17 11:21:37,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-03-17 11:21:37,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:21:37,598 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:37,599 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:37,599 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-03-17 11:21:37,649 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:37,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 438 places, 429 transitions, 1118 flow [2025-03-17 11:21:37,866 INFO L124 PetriNetUnfolderBase]: 46/721 cut-off events. [2025-03-17 11:21:37,866 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-17 11:21:37,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 721 events. 46/721 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1981 event pairs, 0 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 808. Up to 22 conditions per place. [2025-03-17 11:21:37,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 438 places, 429 transitions, 1118 flow [2025-03-17 11:21:37,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 151 transitions, 435 flow [2025-03-17 11:21:37,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:37,869 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;@752ef962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:37,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 11:21:37,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:37,870 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-17 11:21:37,870 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:37,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:37,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:37,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-17 11:21:37,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:37,870 INFO L85 PathProgramCache]: Analyzing trace with hash 927224041, now seen corresponding path program 1 times [2025-03-17 11:21:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:37,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161548585] [2025-03-17 11:21:37,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:37,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:37,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:21:37,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:21:37,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:37,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:37,880 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-17 11:21:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:37,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161548585] [2025-03-17 11:21:37,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161548585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:37,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:37,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:37,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18771850] [2025-03-17 11:21:37,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:37,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:37,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:37,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:37,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 429 [2025-03-17 11:21:37,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 151 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 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-17 11:21:37,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:37,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 429 [2025-03-17 11:21:37,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:47,936 INFO L124 PetriNetUnfolderBase]: 56338/93488 cut-off events. [2025-03-17 11:21:47,936 INFO L125 PetriNetUnfolderBase]: For 49195/49195 co-relation queries the response was YES. [2025-03-17 11:21:48,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176451 conditions, 93488 events. 56338/93488 cut-off events. For 49195/49195 co-relation queries the response was YES. Maximal size of possible extension queue 2442. Compared 811518 event pairs, 56326 based on Foata normal form. 1/93220 useless extension candidates. Maximal degree in co-relation 88117. Up to 68615 conditions per place. [2025-03-17 11:21:48,797 INFO L140 encePairwiseOnDemand]: 424/429 looper letters, 31 selfloop transitions, 2 changer transitions 1/148 dead transitions. [2025-03-17 11:21:48,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 148 transitions, 495 flow [2025-03-17 11:21:48,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-03-17 11:21:48,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8321678321678322 [2025-03-17 11:21:48,799 INFO L175 Difference]: Start difference. First operand has 171 places, 151 transitions, 435 flow. Second operand 3 states and 1071 transitions. [2025-03-17 11:21:48,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 148 transitions, 495 flow [2025-03-17 11:21:48,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 148 transitions, 422 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:48,809 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 358 flow [2025-03-17 11:21:48,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=429, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2025-03-17 11:21:48,810 INFO L279 CegarLoopForPetriNet]: 171 programPoint places, 0 predicate places. [2025-03-17 11:21:48,810 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 358 flow [2025-03-17 11:21:48,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 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-17 11:21:48,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:48,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:48,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:21:48,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-17 11:21:48,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1999390835, now seen corresponding path program 1 times [2025-03-17 11:21:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:48,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690317711] [2025-03-17 11:21:48,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:48,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:21:48,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:21:48,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:48,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:48,822 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-17 11:21:48,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690317711] [2025-03-17 11:21:48,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690317711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:48,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:48,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353316214] [2025-03-17 11:21:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:48,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:48,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:48,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:48,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:48,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 429 [2025-03-17 11:21:48,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 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-17 11:21:48,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:48,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 429 [2025-03-17 11:21:48,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand