/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-theta/exponential-64.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:07:03,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:07:03,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:07:03,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:07:03,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:07:03,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:07:03,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:07:03,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:07:03,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:07:03,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:07:03,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:07:03,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:07:03,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:07:03,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:07:03,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:07:03,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:07:03,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:07:03,250 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 21:07:03,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:07:03,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:07:03,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:07:03,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:07:03,499 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:07:03,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/exponential-64.i [2025-04-13 21:07:04,813 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4296902db/18d22350b14d413d8599e3944b3fe200/FLAG7afd3431c [2025-04-13 21:07:05,037 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:07:05,038 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/exponential-64.i [2025-04-13 21:07:05,046 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4296902db/18d22350b14d413d8599e3944b3fe200/FLAG7afd3431c [2025-04-13 21:07:05,815 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4296902db/18d22350b14d413d8599e3944b3fe200 [2025-04-13 21:07:05,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:07:05,818 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:07:05,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:07:05,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:07:05,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:07:05,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:07:05" (1/1) ... [2025-04-13 21:07:05,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1381f8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:05, skipping insertion in model container [2025-04-13 21:07:05,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:07:05" (1/1) ... [2025-04-13 21:07:05,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:07:06,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/exponential-64.i[33030,33043] [2025-04-13 21:07:06,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:07:06,166 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:07:06,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/exponential-64.i[33030,33043] [2025-04-13 21:07:06,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:07:06,240 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:07:06,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06 WrapperNode [2025-04-13 21:07:06,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:07:06,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:07:06,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:07:06,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:07:06,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,263 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-04-13 21:07:06,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:07:06,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:07:06,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:07:06,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:07:06,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,277 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:07:06,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:07:06,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:07:06,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:07:06,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:07:06,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (1/1) ... [2025-04-13 21:07:06,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:07:06,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:06,313 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-04-13 21:07:06,315 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-04-13 21:07:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:07:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 21:07:06,333 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 21:07:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 21:07:06,334 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 21:07:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:07:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:07:06,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:07:06,335 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:07:06,433 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:07:06,434 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:07:06,525 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:07:06,525 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:07:06,525 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:07:06,615 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:07:06,623 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:07:06,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:07:06 BoogieIcfgContainer [2025-04-13 21:07:06,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:07:06,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:07:06,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:07:06,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:07:06,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:07:05" (1/3) ... [2025-04-13 21:07:06,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1b9ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:07:06, skipping insertion in model container [2025-04-13 21:07:06,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:07:06" (2/3) ... [2025-04-13 21:07:06,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1b9ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:07:06, skipping insertion in model container [2025-04-13 21:07:06,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:07:06" (3/3) ... [2025-04-13 21:07:06,629 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-64.i [2025-04-13 21:07:06,638 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:07:06,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-64.i that has 3 procedures, 16 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 21:07:06,639 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:07:06,675 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:07:06,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 18 transitions, 44 flow [2025-04-13 21:07:06,721 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-13 21:07:06,724 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:06,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 20 events. 2/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2025-04-13 21:07:06,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 18 transitions, 44 flow [2025-04-13 21:07:06,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 39 flow [2025-04-13 21:07:06,733 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:06,741 INFO L340 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;@7e6d760b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:06,742 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:06,744 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:06,744 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-13 21:07:06,744 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:06,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:06,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:06,744 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:06,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 6522, now seen corresponding path program 1 times [2025-04-13 21:07:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:06,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237961737] [2025-04-13 21:07:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:06,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:06,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:06,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:06,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:06,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:06,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237961737] [2025-04-13 21:07:06,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237961737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:06,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:06,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:06,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818522910] [2025-04-13 21:07:06,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:06,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:06,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:06,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:06,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:06,937 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 18 [2025-04-13 21:07:06,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 39 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-04-13 21:07:06,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:06,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 18 [2025-04-13 21:07:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:07,005 INFO L116 PetriNetUnfolderBase]: 19/50 cut-off events. [2025-04-13 21:07:07,005 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 50 events. 19/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 156 event pairs, 15 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 86. Up to 41 conditions per place. [2025-04-13 21:07:07,007 INFO L140 encePairwiseOnDemand]: 17/18 looper letters, 10 selfloop transitions, 0 changer transitions 0/15 dead transitions. [2025-04-13 21:07:07,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 57 flow [2025-04-13 21:07:07,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2025-04-13 21:07:07,016 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-04-13 21:07:07,017 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 39 flow. Second operand 2 states and 23 transitions. [2025-04-13 21:07:07,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 57 flow [2025-04-13 21:07:07,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 15 transitions, 56 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:07,022 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 36 flow [2025-04-13 21:07:07,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=36, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2025-04-13 21:07:07,026 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2025-04-13 21:07:07,026 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 36 flow [2025-04-13 21:07:07,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-04-13 21:07:07,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:07,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:07,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:07:07,027 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:07,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1780855923, now seen corresponding path program 1 times [2025-04-13 21:07:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:07,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895848556] [2025-04-13 21:07:07,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:07,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:07,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:07,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:07,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:07,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895848556] [2025-04-13 21:07:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895848556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:07,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:07,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:07,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132320351] [2025-04-13 21:07:07,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:07,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:07,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:07,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:07,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 18 [2025-04-13 21:07:07,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 36 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-04-13 21:07:07,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:07,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 18 [2025-04-13 21:07:07,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:07,174 INFO L116 PetriNetUnfolderBase]: 23/58 cut-off events. [2025-04-13 21:07:07,175 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:07,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 58 events. 23/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 11 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 112. Up to 40 conditions per place. [2025-04-13 21:07:07,175 INFO L140 encePairwiseOnDemand]: 14/18 looper letters, 10 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2025-04-13 21:07:07,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 68 flow [2025-04-13 21:07:07,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-13 21:07:07,177 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-04-13 21:07:07,177 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 36 flow. Second operand 4 states and 38 transitions. [2025-04-13 21:07:07,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 68 flow [2025-04-13 21:07:07,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:07:07,178 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 50 flow [2025-04-13 21:07:07,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2025-04-13 21:07:07,179 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2025-04-13 21:07:07,179 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 50 flow [2025-04-13 21:07:07,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-04-13 21:07:07,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:07,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:07,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:07:07,179 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:07,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1780855973, now seen corresponding path program 1 times [2025-04-13 21:07:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:07,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259090130] [2025-04-13 21:07:07,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:07,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:07,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:07,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:07,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:07:07,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:07,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:07,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:07,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:07:07,218 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:07:07,219 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:07:07,220 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:07:07,220 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:07:07,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:07:07,221 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 21:07:07,223 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:07:07,223 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 21:07:07,240 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:07:07,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 72 flow [2025-04-13 21:07:07,251 INFO L116 PetriNetUnfolderBase]: 3/34 cut-off events. [2025-04-13 21:07:07,251 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 21:07:07,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2025-04-13 21:07:07,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 26 transitions, 72 flow [2025-04-13 21:07:07,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 24 transitions, 66 flow [2025-04-13 21:07:07,254 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:07,254 INFO L340 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;@7e6d760b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:07,254 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:07,257 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:07,257 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-13 21:07:07,257 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:07,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:07,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:07,258 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:07,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash 7354, now seen corresponding path program 1 times [2025-04-13 21:07:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:07,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116325787] [2025-04-13 21:07:07,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:07,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:07,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:07,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:07,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-04-13 21:07:07,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:07,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116325787] [2025-04-13 21:07:07,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116325787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:07,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:07,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:07,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526233195] [2025-04-13 21:07:07,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:07,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:07,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:07,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:07,276 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2025-04-13 21:07:07,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-04-13 21:07:07,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:07,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2025-04-13 21:07:07,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:07,343 INFO L116 PetriNetUnfolderBase]: 175/322 cut-off events. [2025-04-13 21:07:07,344 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-13 21:07:07,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 322 events. 175/322 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1623 event pairs, 155 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 266. Up to 277 conditions per place. [2025-04-13 21:07:07,346 INFO L140 encePairwiseOnDemand]: 25/26 looper letters, 14 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-04-13 21:07:07,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 92 flow [2025-04-13 21:07:07,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2025-04-13 21:07:07,347 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2025-04-13 21:07:07,347 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 66 flow. Second operand 2 states and 35 transitions. [2025-04-13 21:07:07,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 92 flow [2025-04-13 21:07:07,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 91 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:07,348 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 63 flow [2025-04-13 21:07:07,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=63, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-04-13 21:07:07,349 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2025-04-13 21:07:07,349 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 63 flow [2025-04-13 21:07:07,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-04-13 21:07:07,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:07,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:07,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:07:07,349 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:07,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1739393664, now seen corresponding path program 1 times [2025-04-13 21:07:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:07,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745170006] [2025-04-13 21:07:07,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:07,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:07,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:07,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:07,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:07,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745170006] [2025-04-13 21:07:07,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745170006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:07,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:07,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430554326] [2025-04-13 21:07:07,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:07,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:07,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:07,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:07,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:07,401 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2025-04-13 21:07:07,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-04-13 21:07:07,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:07,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2025-04-13 21:07:07,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:07,485 INFO L116 PetriNetUnfolderBase]: 211/378 cut-off events. [2025-04-13 21:07:07,485 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-13 21:07:07,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 378 events. 211/378 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1922 event pairs, 123 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 752. Up to 276 conditions per place. [2025-04-13 21:07:07,487 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 16 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-04-13 21:07:07,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 111 flow [2025-04-13 21:07:07,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-13 21:07:07,488 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2025-04-13 21:07:07,488 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 63 flow. Second operand 4 states and 60 transitions. [2025-04-13 21:07:07,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 111 flow [2025-04-13 21:07:07,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 111 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:07:07,490 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 77 flow [2025-04-13 21:07:07,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=77, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-04-13 21:07:07,491 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2025-04-13 21:07:07,491 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 77 flow [2025-04-13 21:07:07,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-04-13 21:07:07,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:07,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:07,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:07:07,491 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:07,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1913371426, now seen corresponding path program 1 times [2025-04-13 21:07:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:07,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014719270] [2025-04-13 21:07:07,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:07,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:07:07,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:07:07,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:07,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:07,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014719270] [2025-04-13 21:07:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014719270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:07,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:07,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561409379] [2025-04-13 21:07:07,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:07,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:07:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:07,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:07:07,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:07:07,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 26 [2025-04-13 21:07:07,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-04-13 21:07:07,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:07,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 26 [2025-04-13 21:07:07,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:07,632 INFO L116 PetriNetUnfolderBase]: 195/350 cut-off events. [2025-04-13 21:07:07,632 INFO L117 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-04-13 21:07:07,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 350 events. 195/350 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1705 event pairs, 127 based on Foata normal form. 4/306 useless extension candidates. Maximal degree in co-relation 777. Up to 293 conditions per place. [2025-04-13 21:07:07,636 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 17 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-04-13 21:07:07,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 123 flow [2025-04-13 21:07:07,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:07:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:07:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 21:07:07,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-04-13 21:07:07,638 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 77 flow. Second operand 3 states and 49 transitions. [2025-04-13 21:07:07,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 123 flow [2025-04-13 21:07:07,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 117 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:07:07,639 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 83 flow [2025-04-13 21:07:07,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2025-04-13 21:07:07,640 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-04-13 21:07:07,640 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 83 flow [2025-04-13 21:07:07,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-04-13 21:07:07,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:07,640 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:07,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:07:07,642 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:07,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1502734656, now seen corresponding path program 1 times [2025-04-13 21:07:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:07,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202247668] [2025-04-13 21:07:07,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:07,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:07:07,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:07:07,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:07,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:07:07,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:07:07,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:07:07,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:07,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:07:07,670 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:07:07,670 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:07:07,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:07:07,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:07:07,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:07:07,670 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 21:07:07,671 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:07:07,671 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 21:07:07,694 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:07:07,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 104 flow [2025-04-13 21:07:07,700 INFO L116 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-04-13 21:07:07,700 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-13 21:07:07,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 48 events. 4/48 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 55. Up to 8 conditions per place. [2025-04-13 21:07:07,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 34 transitions, 104 flow [2025-04-13 21:07:07,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 32 transitions, 97 flow [2025-04-13 21:07:07,702 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:07,703 INFO L340 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;@7e6d760b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:07,703 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:07,705 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:07,705 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-13 21:07:07,705 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:07,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:07,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:07,705 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:07,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash 8442, now seen corresponding path program 1 times [2025-04-13 21:07:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:07,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163313945] [2025-04-13 21:07:07,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:07,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:07,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:07,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:07,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:07,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163313945] [2025-04-13 21:07:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163313945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:07,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:07,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:07,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027142966] [2025-04-13 21:07:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:07,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:07,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:07,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:07,731 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 21:07:07,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 97 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-04-13 21:07:07,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:07,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 21:07:07,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:07,868 INFO L116 PetriNetUnfolderBase]: 1119/1730 cut-off events. [2025-04-13 21:07:07,868 INFO L117 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-04-13 21:07:07,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 1730 events. 1119/1730 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9856 event pairs, 1035 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 1538. Up to 1541 conditions per place. [2025-04-13 21:07:07,878 INFO L140 encePairwiseOnDemand]: 33/34 looper letters, 18 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2025-04-13 21:07:07,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 131 flow [2025-04-13 21:07:07,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2025-04-13 21:07:07,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2025-04-13 21:07:07,880 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 97 flow. Second operand 2 states and 47 transitions. [2025-04-13 21:07:07,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 131 flow [2025-04-13 21:07:07,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 31 transitions, 126 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:07,883 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 90 flow [2025-04-13 21:07:07,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2025-04-13 21:07:07,884 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-04-13 21:07:07,884 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 90 flow [2025-04-13 21:07:07,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-04-13 21:07:07,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:07,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:07,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:07:07,884 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:07,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash -728008307, now seen corresponding path program 1 times [2025-04-13 21:07:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:07,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837603612] [2025-04-13 21:07:07,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:07,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:07,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:07,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:07,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:07,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:07,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837603612] [2025-04-13 21:07:07,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837603612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:07,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:07,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617606867] [2025-04-13 21:07:07,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:07,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:07,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:07,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:07,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 21:07:07,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-04-13 21:07:07,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:07,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 21:07:07,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:08,102 INFO L116 PetriNetUnfolderBase]: 1347/2042 cut-off events. [2025-04-13 21:07:08,103 INFO L117 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-04-13 21:07:08,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4088 conditions, 2042 events. 1347/2042 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11503 event pairs, 1035 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 4080. Up to 1540 conditions per place. [2025-04-13 21:07:08,115 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 22 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2025-04-13 21:07:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 154 flow [2025-04-13 21:07:08,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-13 21:07:08,117 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2025-04-13 21:07:08,117 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 90 flow. Second operand 4 states and 82 transitions. [2025-04-13 21:07:08,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 154 flow [2025-04-13 21:07:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:07:08,119 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 104 flow [2025-04-13 21:07:08,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2025-04-13 21:07:08,120 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-04-13 21:07:08,120 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 104 flow [2025-04-13 21:07:08,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-04-13 21:07:08,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:08,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:08,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:07:08,120 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:08,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1093420841, now seen corresponding path program 1 times [2025-04-13 21:07:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:08,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118733467] [2025-04-13 21:07:08,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:08,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:07:08,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:07:08,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:08,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:08,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118733467] [2025-04-13 21:07:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118733467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:08,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503395000] [2025-04-13 21:07:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:08,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:07:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:08,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:07:08,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:07:08,160 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 21:07:08,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-04-13 21:07:08,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:08,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 21:07:08,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:08,320 INFO L116 PetriNetUnfolderBase]: 1331/2014 cut-off events. [2025-04-13 21:07:08,320 INFO L117 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-04-13 21:07:08,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4435 conditions, 2014 events. 1331/2014 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11071 event pairs, 1007 based on Foata normal form. 4/1782 useless extension candidates. Maximal degree in co-relation 4425. Up to 1813 conditions per place. [2025-04-13 21:07:08,332 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 21 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2025-04-13 21:07:08,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 36 transitions, 158 flow [2025-04-13 21:07:08,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:07:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:07:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-13 21:07:08,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2025-04-13 21:07:08,334 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 104 flow. Second operand 3 states and 65 transitions. [2025-04-13 21:07:08,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 36 transitions, 158 flow [2025-04-13 21:07:08,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 152 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:07:08,339 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 110 flow [2025-04-13 21:07:08,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-04-13 21:07:08,341 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-04-13 21:07:08,341 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 110 flow [2025-04-13 21:07:08,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-04-13 21:07:08,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:08,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:08,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:07:08,341 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:08,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1172500190, now seen corresponding path program 1 times [2025-04-13 21:07:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:08,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314773428] [2025-04-13 21:07:08,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:08,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:08,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:07:08,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:07:08,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:08,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:08,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:08,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314773428] [2025-04-13 21:07:08,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314773428] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:08,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:08,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:07:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99960235] [2025-04-13 21:07:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:08,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:08,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:08,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:08,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:08,402 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 21:07:08,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04-13 21:07:08,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:08,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 21:07:08,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:08,556 INFO L116 PetriNetUnfolderBase]: 1219/1854 cut-off events. [2025-04-13 21:07:08,556 INFO L117 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-04-13 21:07:08,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4060 conditions, 1854 events. 1219/1854 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9933 event pairs, 527 based on Foata normal form. 16/1684 useless extension candidates. Maximal degree in co-relation 4049. Up to 1569 conditions per place. [2025-04-13 21:07:08,568 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 26 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-04-13 21:07:08,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 188 flow [2025-04-13 21:07:08,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-13 21:07:08,569 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-13 21:07:08,569 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 110 flow. Second operand 4 states and 85 transitions. [2025-04-13 21:07:08,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 188 flow [2025-04-13 21:07:08,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:08,571 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 124 flow [2025-04-13 21:07:08,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-04-13 21:07:08,572 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2025-04-13 21:07:08,572 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 124 flow [2025-04-13 21:07:08,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04-13 21:07:08,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:08,572 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:08,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:07:08,572 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:08,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1077430071, now seen corresponding path program 1 times [2025-04-13 21:07:08,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:08,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547557848] [2025-04-13 21:07:08,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:08,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:08,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:07:08,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:07:08,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:08,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:08,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:07:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:07:08,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:07:08,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:08,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:08,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:07:08,593 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:07:08,593 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:07:08,593 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:07:08,593 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:07:08,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:07:08,593 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 21:07:08,594 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:07:08,594 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 21:07:08,621 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:07:08,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 42 transitions, 140 flow [2025-04-13 21:07:08,628 INFO L116 PetriNetUnfolderBase]: 5/62 cut-off events. [2025-04-13 21:07:08,628 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-13 21:07:08,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 62 events. 5/62 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 79. Up to 10 conditions per place. [2025-04-13 21:07:08,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 42 transitions, 140 flow [2025-04-13 21:07:08,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 40 transitions, 132 flow [2025-04-13 21:07:08,630 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:08,631 INFO L340 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;@7e6d760b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:08,631 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:08,632 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:08,633 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-13 21:07:08,633 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:08,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:08,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:08,633 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:08,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash 9786, now seen corresponding path program 1 times [2025-04-13 21:07:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:08,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970825853] [2025-04-13 21:07:08,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:08,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:08,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:08,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:08,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970825853] [2025-04-13 21:07:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970825853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:08,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:08,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177554777] [2025-04-13 21:07:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:08,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:08,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:08,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:08,653 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-04-13 21:07:08,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-04-13 21:07:08,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:08,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-04-13 21:07:08,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:09,174 INFO L116 PetriNetUnfolderBase]: 6175/8642 cut-off events. [2025-04-13 21:07:09,175 INFO L117 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2025-04-13 21:07:09,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17722 conditions, 8642 events. 6175/8642 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 50906 event pairs, 5835 based on Foata normal form. 0/7241 useless extension candidates. Maximal degree in co-relation 8002. Up to 7877 conditions per place. [2025-04-13 21:07:09,225 INFO L140 encePairwiseOnDemand]: 41/42 looper letters, 22 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-04-13 21:07:09,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 39 transitions, 174 flow [2025-04-13 21:07:09,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2025-04-13 21:07:09,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2025-04-13 21:07:09,226 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 132 flow. Second operand 2 states and 59 transitions. [2025-04-13 21:07:09,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 39 transitions, 174 flow [2025-04-13 21:07:09,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 39 transitions, 161 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:09,237 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 117 flow [2025-04-13 21:07:09,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=117, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-04-13 21:07:09,239 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-04-13 21:07:09,239 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 117 flow [2025-04-13 21:07:09,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-04-13 21:07:09,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:09,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:09,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 21:07:09,239 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:09,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:09,239 INFO L85 PathProgramCache]: Analyzing trace with hash 520044698, now seen corresponding path program 1 times [2025-04-13 21:07:09,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:09,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202650448] [2025-04-13 21:07:09,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:09,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:09,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:09,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:09,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:09,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:09,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202650448] [2025-04-13 21:07:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202650448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:09,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:09,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839832359] [2025-04-13 21:07:09,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:09,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:09,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:09,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:09,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:09,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-04-13 21:07:09,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-04-13 21:07:09,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:09,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-04-13 21:07:09,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:09,882 INFO L116 PetriNetUnfolderBase]: 7427/10234 cut-off events. [2025-04-13 21:07:09,883 INFO L117 PetriNetUnfolderBase]: For 1660/1660 co-relation queries the response was YES. [2025-04-13 21:07:09,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20474 conditions, 10234 events. 7427/10234 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 59394 event pairs, 5835 based on Foata normal form. 0/9003 useless extension candidates. Maximal degree in co-relation 20464. Up to 7876 conditions per place. [2025-04-13 21:07:09,944 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 28 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-04-13 21:07:09,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 197 flow [2025-04-13 21:07:09,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-13 21:07:09,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-04-13 21:07:09,946 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 117 flow. Second operand 4 states and 104 transitions. [2025-04-13 21:07:09,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 197 flow [2025-04-13 21:07:09,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 48 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:07:09,948 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 131 flow [2025-04-13 21:07:09,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-04-13 21:07:09,949 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2025-04-13 21:07:09,949 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 131 flow [2025-04-13 21:07:09,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-04-13 21:07:09,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:09,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:09,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 21:07:09,950 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:09,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1058483308, now seen corresponding path program 1 times [2025-04-13 21:07:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:09,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659515594] [2025-04-13 21:07:09,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:09,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:07:09,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:07:09,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:09,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:09,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659515594] [2025-04-13 21:07:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659515594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325304845] [2025-04-13 21:07:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:09,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:07:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:09,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:07:09,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:07:09,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-04-13 21:07:09,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-04-13 21:07:09,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:09,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-04-13 21:07:09,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:10,686 INFO L116 PetriNetUnfolderBase]: 7411/10206 cut-off events. [2025-04-13 21:07:10,686 INFO L117 PetriNetUnfolderBase]: For 2340/2340 co-relation queries the response was YES. [2025-04-13 21:07:10,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22101 conditions, 10206 events. 7411/10206 cut-off events. For 2340/2340 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 58890 event pairs, 5055 based on Foata normal form. 4/9171 useless extension candidates. Maximal degree in co-relation 22089. Up to 9429 conditions per place. [2025-04-13 21:07:10,735 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 25 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-04-13 21:07:10,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 44 transitions, 193 flow [2025-04-13 21:07:10,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:07:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:07:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-04-13 21:07:10,736 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-04-13 21:07:10,736 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 131 flow. Second operand 3 states and 81 transitions. [2025-04-13 21:07:10,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 44 transitions, 193 flow [2025-04-13 21:07:10,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 44 transitions, 187 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:07:10,754 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 137 flow [2025-04-13 21:07:10,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2025-04-13 21:07:10,755 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-04-13 21:07:10,755 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 137 flow [2025-04-13 21:07:10,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-04-13 21:07:10,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:10,755 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:10,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 21:07:10,755 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:10,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 751862322, now seen corresponding path program 1 times [2025-04-13 21:07:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:10,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962686467] [2025-04-13 21:07:10,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:10,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:07:10,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:07:10,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:10,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:10,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962686467] [2025-04-13 21:07:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962686467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:10,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:07:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165079894] [2025-04-13 21:07:10,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:10,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:10,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:10,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:10,806 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-04-13 21:07:10,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-04-13 21:07:10,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:10,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-04-13 21:07:10,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:11,255 INFO L116 PetriNetUnfolderBase]: 7299/10046 cut-off events. [2025-04-13 21:07:11,255 INFO L117 PetriNetUnfolderBase]: For 2506/2506 co-relation queries the response was YES. [2025-04-13 21:07:11,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21726 conditions, 10046 events. 7299/10046 cut-off events. For 2506/2506 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 57323 event pairs, 3087 based on Foata normal form. 16/9143 useless extension candidates. Maximal degree in co-relation 21713. Up to 9185 conditions per place. [2025-04-13 21:07:11,305 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 30 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-04-13 21:07:11,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 50 transitions, 223 flow [2025-04-13 21:07:11,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-04-13 21:07:11,306 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-13 21:07:11,306 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 137 flow. Second operand 4 states and 105 transitions. [2025-04-13 21:07:11,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 50 transitions, 223 flow [2025-04-13 21:07:11,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 50 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:11,316 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 151 flow [2025-04-13 21:07:11,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-04-13 21:07:11,316 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places. [2025-04-13 21:07:11,316 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 151 flow [2025-04-13 21:07:11,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-04-13 21:07:11,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:11,316 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:11,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 21:07:11,317 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:11,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash -342294834, now seen corresponding path program 1 times [2025-04-13 21:07:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:11,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602498312] [2025-04-13 21:07:11,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:11,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:07:11,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:07:11,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:11,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:11,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602498312] [2025-04-13 21:07:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602498312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:11,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:11,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:07:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793660082] [2025-04-13 21:07:11,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:11,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:07:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:11,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:07:11,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:07:11,373 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-04-13 21:07:11,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-04-13 21:07:11,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:11,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-04-13 21:07:11,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:11,939 INFO L116 PetriNetUnfolderBase]: 6659/9214 cut-off events. [2025-04-13 21:07:11,939 INFO L117 PetriNetUnfolderBase]: For 3854/3854 co-relation queries the response was YES. [2025-04-13 21:07:11,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20416 conditions, 9214 events. 6659/9214 cut-off events. For 3854/3854 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 51968 event pairs, 2047 based on Foata normal form. 64/8543 useless extension candidates. Maximal degree in co-relation 20402. Up to 7873 conditions per place. [2025-04-13 21:07:11,994 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 37 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-04-13 21:07:11,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 58 transitions, 269 flow [2025-04-13 21:07:11,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:07:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:07:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-13 21:07:11,996 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6238095238095238 [2025-04-13 21:07:11,996 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 151 flow. Second operand 5 states and 131 transitions. [2025-04-13 21:07:11,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 58 transitions, 269 flow [2025-04-13 21:07:12,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 58 transitions, 263 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:07:12,006 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 165 flow [2025-04-13 21:07:12,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2025-04-13 21:07:12,006 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2025-04-13 21:07:12,006 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 165 flow [2025-04-13 21:07:12,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-04-13 21:07:12,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:12,006 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:12,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 21:07:12,006 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:12,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash -984952950, now seen corresponding path program 1 times [2025-04-13 21:07:12,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:12,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207676855] [2025-04-13 21:07:12,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:07:12,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:12,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:12,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:12,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:07:12,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:07:12,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:12,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:12,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:12,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:07:12,025 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:07:12,025 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:07:12,025 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:07:12,025 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:07:12,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 21:07:12,026 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:12,026 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:07:12,026 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 21:07:12,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:07:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 50 transitions, 180 flow [2025-04-13 21:07:12,057 INFO L116 PetriNetUnfolderBase]: 6/76 cut-off events. [2025-04-13 21:07:12,057 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 21:07:12,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 76 events. 6/76 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 105. Up to 12 conditions per place. [2025-04-13 21:07:12,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 50 transitions, 180 flow [2025-04-13 21:07:12,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 48 transitions, 171 flow [2025-04-13 21:07:12,059 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:12,059 INFO L340 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;@7e6d760b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:12,059 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:12,060 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:12,060 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-13 21:07:12,060 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:12,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:12,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:12,060 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:12,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 11386, now seen corresponding path program 1 times [2025-04-13 21:07:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:12,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943931152] [2025-04-13 21:07:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:12,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:12,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:12,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:12,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:12,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943931152] [2025-04-13 21:07:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943931152] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:12,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:12,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061074417] [2025-04-13 21:07:12,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:12,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:12,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:12,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:12,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:12,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-04-13 21:07:12,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 171 flow. Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-04-13 21:07:12,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:12,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-04-13 21:07:12,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:14,295 INFO L116 PetriNetUnfolderBase]: 31519/41410 cut-off events. [2025-04-13 21:07:14,295 INFO L117 PetriNetUnfolderBase]: For 19228/19228 co-relation queries the response was YES. [2025-04-13 21:07:14,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85564 conditions, 41410 events. 31519/41410 cut-off events. For 19228/19228 co-relation queries the response was YES. Maximal size of possible extension queue 1713. Compared 247649 event pairs, 30155 based on Foata normal form. 0/35789 useless extension candidates. Maximal degree in co-relation 39362. Up to 38341 conditions per place. [2025-04-13 21:07:14,575 INFO L140 encePairwiseOnDemand]: 49/50 looper letters, 26 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2025-04-13 21:07:14,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 47 transitions, 221 flow [2025-04-13 21:07:14,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2025-04-13 21:07:14,576 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.71 [2025-04-13 21:07:14,577 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 171 flow. Second operand 2 states and 71 transitions. [2025-04-13 21:07:14,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 47 transitions, 221 flow [2025-04-13 21:07:14,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 47 transitions, 196 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:14,643 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 144 flow [2025-04-13 21:07:14,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-04-13 21:07:14,643 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-04-13 21:07:14,643 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 144 flow [2025-04-13 21:07:14,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-04-13 21:07:14,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:14,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:14,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 21:07:14,643 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:14,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2004765351, now seen corresponding path program 1 times [2025-04-13 21:07:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:14,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679229679] [2025-04-13 21:07:14,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:14,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:14,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:14,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:14,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:14,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:14,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679229679] [2025-04-13 21:07:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679229679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:14,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993812828] [2025-04-13 21:07:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:14,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:14,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:14,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:14,673 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-04-13 21:07:14,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-04-13 21:07:14,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:14,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-04-13 21:07:14,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:17,236 INFO L116 PetriNetUnfolderBase]: 37891/49146 cut-off events. [2025-04-13 21:07:17,236 INFO L117 PetriNetUnfolderBase]: For 10748/10748 co-relation queries the response was YES. [2025-04-13 21:07:17,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98300 conditions, 49146 events. 37891/49146 cut-off events. For 10748/10748 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 288565 event pairs, 30155 based on Foata normal form. 0/44207 useless extension candidates. Maximal degree in co-relation 98288. Up to 38340 conditions per place. [2025-04-13 21:07:17,755 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 34 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-04-13 21:07:17,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 58 transitions, 240 flow [2025-04-13 21:07:17,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-04-13 21:07:17,756 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.63 [2025-04-13 21:07:17,756 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 144 flow. Second operand 4 states and 126 transitions. [2025-04-13 21:07:17,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 58 transitions, 240 flow [2025-04-13 21:07:17,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 58 transitions, 240 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:07:17,775 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 158 flow [2025-04-13 21:07:17,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2025-04-13 21:07:17,775 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 4 predicate places. [2025-04-13 21:07:17,775 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 158 flow [2025-04-13 21:07:17,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-04-13 21:07:17,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:17,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:17,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 21:07:17,776 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:17,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2018184025, now seen corresponding path program 1 times [2025-04-13 21:07:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:17,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316337762] [2025-04-13 21:07:17,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:17,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:07:17,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:07:17,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:17,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:17,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:17,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316337762] [2025-04-13 21:07:17,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316337762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:17,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:17,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631154052] [2025-04-13 21:07:17,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:17,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:07:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:17,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:07:17,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:07:17,811 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-04-13 21:07:17,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-04-13 21:07:17,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:17,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-04-13 21:07:17,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:20,516 INFO L116 PetriNetUnfolderBase]: 37875/49118 cut-off events. [2025-04-13 21:07:20,516 INFO L117 PetriNetUnfolderBase]: For 13480/13480 co-relation queries the response was YES. [2025-04-13 21:07:20,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105047 conditions, 49118 events. 37875/49118 cut-off events. For 13480/13480 co-relation queries the response was YES. Maximal size of possible extension queue 1969. Compared 287698 event pairs, 32431 based on Foata normal form. 4/44885 useless extension candidates. Maximal degree in co-relation 105033. Up to 46037 conditions per place. [2025-04-13 21:07:20,881 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-04-13 21:07:20,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 52 transitions, 228 flow [2025-04-13 21:07:20,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:07:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:07:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-04-13 21:07:20,882 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-04-13 21:07:20,882 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 158 flow. Second operand 3 states and 97 transitions. [2025-04-13 21:07:20,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 52 transitions, 228 flow [2025-04-13 21:07:21,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 52 transitions, 222 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:07:21,310 INFO L231 Difference]: Finished difference. Result has 73 places, 49 transitions, 164 flow [2025-04-13 21:07:21,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2025-04-13 21:07:21,312 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-04-13 21:07:21,312 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 164 flow [2025-04-13 21:07:21,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-04-13 21:07:21,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:21,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:21,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 21:07:21,312 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:21,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2137984586, now seen corresponding path program 1 times [2025-04-13 21:07:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:21,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619978367] [2025-04-13 21:07:21,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:21,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:07:21,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:07:21,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:21,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:21,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619978367] [2025-04-13 21:07:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619978367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:21,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:07:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410341982] [2025-04-13 21:07:21,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:21,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:21,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:21,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:21,347 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-04-13 21:07:21,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 49 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-04-13 21:07:21,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:21,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-04-13 21:07:21,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:24,104 INFO L116 PetriNetUnfolderBase]: 37763/48958 cut-off events. [2025-04-13 21:07:24,104 INFO L117 PetriNetUnfolderBase]: For 14166/14166 co-relation queries the response was YES. [2025-04-13 21:07:24,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104672 conditions, 48958 events. 37763/48958 cut-off events. For 14166/14166 co-relation queries the response was YES. Maximal size of possible extension queue 1964. Compared 286256 event pairs, 24255 based on Foata normal form. 16/44783 useless extension candidates. Maximal degree in co-relation 104657. Up to 45793 conditions per place. [2025-04-13 21:07:24,442 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 34 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-04-13 21:07:24,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 58 transitions, 258 flow [2025-04-13 21:07:24,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:07:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:07:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2025-04-13 21:07:24,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-13 21:07:24,443 INFO L175 Difference]: Start difference. First operand has 73 places, 49 transitions, 164 flow. Second operand 4 states and 125 transitions. [2025-04-13 21:07:24,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 58 transitions, 258 flow [2025-04-13 21:07:24,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 58 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:24,594 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 178 flow [2025-04-13 21:07:24,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2025-04-13 21:07:24,595 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2025-04-13 21:07:24,595 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 178 flow [2025-04-13 21:07:24,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-04-13 21:07:24,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:24,595 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:24,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 21:07:24,595 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:24,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2142993849, now seen corresponding path program 1 times [2025-04-13 21:07:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:24,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837883907] [2025-04-13 21:07:24,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:24,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:07:24,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:07:24,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:24,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:24,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837883907] [2025-04-13 21:07:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837883907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:24,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:24,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:07:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134145517] [2025-04-13 21:07:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:24,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:07:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:24,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:07:24,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:07:24,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-04-13 21:07:24,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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-04-13 21:07:24,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:24,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-04-13 21:07:24,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:27,374 INFO L116 PetriNetUnfolderBase]: 37123/48126 cut-off events. [2025-04-13 21:07:27,374 INFO L117 PetriNetUnfolderBase]: For 19550/19550 co-relation queries the response was YES. [2025-04-13 21:07:27,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105410 conditions, 48126 events. 37123/48126 cut-off events. For 19550/19550 co-relation queries the response was YES. Maximal size of possible extension queue 1964. Compared 279707 event pairs, 12351 based on Foata normal form. 64/44319 useless extension candidates. Maximal degree in co-relation 105394. Up to 44481 conditions per place. [2025-04-13 21:07:27,687 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 41 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-04-13 21:07:27,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 66 transitions, 304 flow [2025-04-13 21:07:27,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:07:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:07:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-04-13 21:07:27,688 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-04-13 21:07:27,688 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 178 flow. Second operand 5 states and 155 transitions. [2025-04-13 21:07:27,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 66 transitions, 304 flow [2025-04-13 21:07:27,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 66 transitions, 298 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:07:27,834 INFO L231 Difference]: Finished difference. Result has 79 places, 51 transitions, 192 flow [2025-04-13 21:07:27,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=79, PETRI_TRANSITIONS=51} [2025-04-13 21:07:27,834 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2025-04-13 21:07:27,834 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 51 transitions, 192 flow [2025-04-13 21:07:27,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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-04-13 21:07:27,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:27,834 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:27,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 21:07:27,834 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:27,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1643517274, now seen corresponding path program 1 times [2025-04-13 21:07:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:27,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014739241] [2025-04-13 21:07:27,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:27,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:07:27,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:07:27,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:27,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:07:27,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:27,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014739241] [2025-04-13 21:07:27,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014739241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:27,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:27,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:07:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783151438] [2025-04-13 21:07:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:27,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:07:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:27,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:07:27,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:07:27,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2025-04-13 21:07:27,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 51 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-04-13 21:07:27,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:27,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2025-04-13 21:07:27,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:30,427 INFO L116 PetriNetUnfolderBase]: 33795/44030 cut-off events. [2025-04-13 21:07:30,428 INFO L117 PetriNetUnfolderBase]: For 27146/27146 co-relation queries the response was YES. [2025-04-13 21:07:30,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98359 conditions, 44030 events. 33795/44030 cut-off events. For 27146/27146 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 255031 event pairs, 5199 based on Foata normal form. 256/41447 useless extension candidates. Maximal degree in co-relation 98342. Up to 37889 conditions per place. [2025-04-13 21:07:30,727 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 50 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-04-13 21:07:30,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 358 flow [2025-04-13 21:07:30,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:07:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:07:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2025-04-13 21:07:30,729 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6233333333333333 [2025-04-13 21:07:30,729 INFO L175 Difference]: Start difference. First operand has 79 places, 51 transitions, 192 flow. Second operand 6 states and 187 transitions. [2025-04-13 21:07:30,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 358 flow [2025-04-13 21:07:30,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 348 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 21:07:30,851 INFO L231 Difference]: Finished difference. Result has 82 places, 52 transitions, 206 flow [2025-04-13 21:07:30,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=82, PETRI_TRANSITIONS=52} [2025-04-13 21:07:30,851 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 14 predicate places. [2025-04-13 21:07:30,851 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 52 transitions, 206 flow [2025-04-13 21:07:30,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-04-13 21:07:30,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:30,852 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:30,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 21:07:30,852 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:30,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash 678672697, now seen corresponding path program 1 times [2025-04-13 21:07:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:30,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787702832] [2025-04-13 21:07:30,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:30,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:07:30,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:07:30,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:30,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:30,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:07:30,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:07:30,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:07:30,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:30,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:07:30,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:07:30,877 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:07:30,877 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:07:30,877 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:07:30,877 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:07:30,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 21:07:30,879 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:30,880 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:07:30,880 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 21:07:30,906 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:07:30,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 58 transitions, 224 flow [2025-04-13 21:07:30,912 INFO L116 PetriNetUnfolderBase]: 7/90 cut-off events. [2025-04-13 21:07:30,912 INFO L117 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-04-13 21:07:30,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 90 events. 7/90 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 186 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 133. Up to 14 conditions per place. [2025-04-13 21:07:30,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 58 transitions, 224 flow [2025-04-13 21:07:30,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 56 transitions, 214 flow [2025-04-13 21:07:30,914 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:07:30,914 INFO L340 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;@7e6d760b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:07:30,914 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:07:30,915 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:07:30,915 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-13 21:07:30,915 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:07:30,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:30,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:07:30,915 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:30,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash 13242, now seen corresponding path program 1 times [2025-04-13 21:07:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:30,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130851840] [2025-04-13 21:07:30,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:30,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:07:30,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:07:30,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:30,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:30,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:30,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130851840] [2025-04-13 21:07:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130851840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:30,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:30,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:07:30,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525051193] [2025-04-13 21:07:30,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:30,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:07:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:30,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:07:30,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:07:30,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-04-13 21:07:30,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 56 transitions, 214 flow. Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-04-13 21:07:30,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:30,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-04-13 21:07:30,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:42,246 INFO L116 PetriNetUnfolderBase]: 153375/192962 cut-off events. [2025-04-13 21:07:42,246 INFO L117 PetriNetUnfolderBase]: For 116508/116508 co-relation queries the response was YES. [2025-04-13 21:07:43,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400958 conditions, 192962 events. 153375/192962 cut-off events. For 116508/116508 co-relation queries the response was YES. Maximal size of possible extension queue 6552. Compared 1178660 event pairs, 147915 based on Foata normal form. 0/170440 useless extension candidates. Maximal degree in co-relation 186818. Up to 180677 conditions per place. [2025-04-13 21:07:44,052 INFO L140 encePairwiseOnDemand]: 57/58 looper letters, 30 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2025-04-13 21:07:44,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 55 transitions, 272 flow [2025-04-13 21:07:44,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:07:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:07:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2025-04-13 21:07:44,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7155172413793104 [2025-04-13 21:07:44,054 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 214 flow. Second operand 2 states and 83 transitions. [2025-04-13 21:07:44,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 55 transitions, 272 flow [2025-04-13 21:07:44,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 55 transitions, 231 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-04-13 21:07:44,916 INFO L231 Difference]: Finished difference. Result has 80 places, 55 transitions, 171 flow [2025-04-13 21:07:44,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=171, PETRI_PLACES=80, PETRI_TRANSITIONS=55} [2025-04-13 21:07:44,916 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places. [2025-04-13 21:07:44,916 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 55 transitions, 171 flow [2025-04-13 21:07:44,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-04-13 21:07:44,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:44,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 21:07:44,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 21:07:44,917 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:44,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -568813644, now seen corresponding path program 1 times [2025-04-13 21:07:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:44,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488227517] [2025-04-13 21:07:44,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:07:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:44,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:07:44,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:07:44,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:07:44,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:07:44,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:44,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488227517] [2025-04-13 21:07:44,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488227517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:07:44,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:07:44,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:07:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553374036] [2025-04-13 21:07:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:07:44,948 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:07:44,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:44,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:07:44,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:07:44,948 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-04-13 21:07:44,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 55 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-04-13 21:07:44,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:44,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-04-13 21:07:44,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:58,057 INFO L116 PetriNetUnfolderBase]: 184323/229370 cut-off events. [2025-04-13 21:07:58,057 INFO L117 PetriNetUnfolderBase]: For 63484/63484 co-relation queries the response was YES. [2025-04-13 21:07:59,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458750 conditions, 229370 events. 184323/229370 cut-off events. For 63484/63484 co-relation queries the response was YES. Maximal size of possible extension queue 7562. Compared 1362937 event pairs, 127107 based on Foata normal form. 0/212182 useless extension candidates. Maximal degree in co-relation 458736. Up to 180676 conditions per place. [2025-04-13 21:08:00,196 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 40 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-04-13 21:08:00,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 68 transitions, 283 flow [2025-04-13 21:08:00,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-04-13 21:08:00,197 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2025-04-13 21:08:00,197 INFO L175 Difference]: Start difference. First operand has 80 places, 55 transitions, 171 flow. Second operand 4 states and 148 transitions. [2025-04-13 21:08:00,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 68 transitions, 283 flow [2025-04-13 21:08:00,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 68 transitions, 283 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:08:00,420 INFO L231 Difference]: Finished difference. Result has 84 places, 56 transitions, 185 flow [2025-04-13 21:08:00,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=84, PETRI_TRANSITIONS=56} [2025-04-13 21:08:00,421 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 4 predicate places. [2025-04-13 21:08:00,421 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 56 transitions, 185 flow [2025-04-13 21:08:00,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-04-13 21:08:00,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:00,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:00,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 21:08:00,421 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:08:00,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:00,421 INFO L85 PathProgramCache]: Analyzing trace with hash -453353434, now seen corresponding path program 1 times [2025-04-13 21:08:00,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:00,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259545734] [2025-04-13 21:08:00,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:00,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:00,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:08:00,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:08:00,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:00,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:00,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:00,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259545734] [2025-04-13 21:08:00,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259545734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:00,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:00,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:08:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372883266] [2025-04-13 21:08:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:00,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:08:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:00,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:08:00,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:08:00,439 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-04-13 21:08:00,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 56 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-04-13 21:08:00,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:00,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-04-13 21:08:00,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:14,429 INFO L116 PetriNetUnfolderBase]: 184307/229342 cut-off events. [2025-04-13 21:08:14,429 INFO L117 PetriNetUnfolderBase]: For 74408/74408 co-relation queries the response was YES. [2025-04-13 21:08:15,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485977 conditions, 229342 events. 184307/229342 cut-off events. For 74408/74408 co-relation queries the response was YES. Maximal size of possible extension queue 7401. Compared 1359246 event pairs, 162479 based on Foata normal form. 4/212306 useless extension candidates. Maximal degree in co-relation 485961. Up to 217045 conditions per place. [2025-04-13 21:08:16,750 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-04-13 21:08:16,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 60 transitions, 263 flow [2025-04-13 21:08:16,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:08:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:08:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-04-13 21:08:16,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6494252873563219 [2025-04-13 21:08:16,751 INFO L175 Difference]: Start difference. First operand has 84 places, 56 transitions, 185 flow. Second operand 3 states and 113 transitions. [2025-04-13 21:08:16,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 60 transitions, 263 flow [2025-04-13 21:08:22,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 60 transitions, 257 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:08:22,903 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 191 flow [2025-04-13 21:08:22,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2025-04-13 21:08:22,903 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 5 predicate places. [2025-04-13 21:08:22,904 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 191 flow [2025-04-13 21:08:22,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-04-13 21:08:22,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:22,904 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:22,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 21:08:22,904 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:08:22,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1309100694, now seen corresponding path program 1 times [2025-04-13 21:08:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:22,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345377014] [2025-04-13 21:08:22,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:22,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:08:22,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:08:22,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:22,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:22,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:22,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345377014] [2025-04-13 21:08:22,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345377014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:22,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:22,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:08:22,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049351817] [2025-04-13 21:08:22,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:22,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:08:22,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:22,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:08:22,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:08:22,942 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-04-13 21:08:22,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 57 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-04-13 21:08:22,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:22,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-04-13 21:08:22,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:37,956 INFO L116 PetriNetUnfolderBase]: 184195/229182 cut-off events. [2025-04-13 21:08:37,956 INFO L117 PetriNetUnfolderBase]: For 77130/77130 co-relation queries the response was YES. [2025-04-13 21:08:39,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485602 conditions, 229182 events. 184195/229182 cut-off events. For 77130/77130 co-relation queries the response was YES. Maximal size of possible extension queue 7377. Compared 1357316 event pairs, 113423 based on Foata normal form. 16/212200 useless extension candidates. Maximal degree in co-relation 485585. Up to 216801 conditions per place. [2025-04-13 21:08:40,474 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 38 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-04-13 21:08:40,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 66 transitions, 293 flow [2025-04-13 21:08:40,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:08:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:08:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-04-13 21:08:40,475 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-13 21:08:40,475 INFO L175 Difference]: Start difference. First operand has 85 places, 57 transitions, 191 flow. Second operand 4 states and 145 transitions. [2025-04-13 21:08:40,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 66 transitions, 293 flow [2025-04-13 21:08:43,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 66 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:08:43,168 INFO L231 Difference]: Finished difference. Result has 88 places, 58 transitions, 205 flow [2025-04-13 21:08:43,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=88, PETRI_TRANSITIONS=58} [2025-04-13 21:08:43,169 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-04-13 21:08:43,169 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 58 transitions, 205 flow [2025-04-13 21:08:43,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-04-13 21:08:43,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:43,169 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:08:43,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 21:08:43,169 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:08:43,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2093476436, now seen corresponding path program 1 times [2025-04-13 21:08:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:43,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050613323] [2025-04-13 21:08:43,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:08:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:43,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:08:43,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:08:43,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:08:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:08:43,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:43,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050613323] [2025-04-13 21:08:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050613323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:08:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:08:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:08:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255563039] [2025-04-13 21:08:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:08:43,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:08:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:43,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:08:43,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:08:43,206 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-04-13 21:08:43,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 58 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-04-13 21:08:43,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:43,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-04-13 21:08:43,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:56,440 INFO L116 PetriNetUnfolderBase]: 183555/228350 cut-off events. [2025-04-13 21:08:56,440 INFO L117 PetriNetUnfolderBase]: For 98962/98962 co-relation queries the response was YES. [2025-04-13 21:08:57,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494532 conditions, 228350 events. 183555/228350 cut-off events. For 98962/98962 co-relation queries the response was YES. Maximal size of possible extension queue 7374. Compared 1351383 event pairs, 97039 based on Foata normal form. 64/211574 useless extension candidates. Maximal degree in co-relation 494514. Up to 215489 conditions per place. [2025-04-13 21:08:58,492 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 45 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-04-13 21:08:58,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 74 transitions, 339 flow [2025-04-13 21:08:58,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:08:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:08:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-04-13 21:08:58,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6172413793103448 [2025-04-13 21:08:58,494 INFO L175 Difference]: Start difference. First operand has 88 places, 58 transitions, 205 flow. Second operand 5 states and 179 transitions. [2025-04-13 21:08:58,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 74 transitions, 339 flow [2025-04-13 21:09:01,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 74 transitions, 333 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 21:09:01,053 INFO L231 Difference]: Finished difference. Result has 91 places, 59 transitions, 219 flow [2025-04-13 21:09:01,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=91, PETRI_TRANSITIONS=59} [2025-04-13 21:09:01,053 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 11 predicate places. [2025-04-13 21:09:01,053 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 59 transitions, 219 flow [2025-04-13 21:09:01,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-04-13 21:09:01,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:01,054 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:01,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 21:09:01,054 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:01,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash -350301716, now seen corresponding path program 1 times [2025-04-13 21:09:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:01,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002409138] [2025-04-13 21:09:01,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:01,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:09:01,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:09:01,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:01,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:09:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:01,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002409138] [2025-04-13 21:09:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002409138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:01,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:01,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:09:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497725666] [2025-04-13 21:09:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:01,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:09:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:01,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:09:01,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:09:01,102 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-04-13 21:09:01,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 59 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-04-13 21:09:01,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:01,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-04-13 21:09:01,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:13,902 INFO L116 PetriNetUnfolderBase]: 180227/224254 cut-off events. [2025-04-13 21:09:13,902 INFO L117 PetriNetUnfolderBase]: For 131082/131082 co-relation queries the response was YES. [2025-04-13 21:09:15,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495673 conditions, 224254 events. 180227/224254 cut-off events. For 131082/131082 co-relation queries the response was YES. Maximal size of possible extension queue 7367. Compared 1324923 event pairs, 49231 based on Foata normal form. 256/208694 useless extension candidates. Maximal degree in co-relation 495654. Up to 208897 conditions per place. [2025-04-13 21:09:15,976 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 54 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-04-13 21:09:15,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 84 transitions, 393 flow [2025-04-13 21:09:15,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:09:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:09:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-04-13 21:09:15,977 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.617816091954023 [2025-04-13 21:09:15,977 INFO L175 Difference]: Start difference. First operand has 91 places, 59 transitions, 219 flow. Second operand 6 states and 215 transitions. [2025-04-13 21:09:15,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 84 transitions, 393 flow [2025-04-13 21:09:18,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 383 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 21:09:18,379 INFO L231 Difference]: Finished difference. Result has 94 places, 60 transitions, 233 flow [2025-04-13 21:09:18,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=94, PETRI_TRANSITIONS=60} [2025-04-13 21:09:18,379 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 14 predicate places. [2025-04-13 21:09:18,379 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 60 transitions, 233 flow [2025-04-13 21:09:18,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-04-13 21:09:18,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:18,379 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:18,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 21:09:18,380 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:18,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1317190442, now seen corresponding path program 1 times [2025-04-13 21:09:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:18,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908417347] [2025-04-13 21:09:18,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:18,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:18,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:09:18,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:09:18,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:18,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:09:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:18,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908417347] [2025-04-13 21:09:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908417347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:18,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:09:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827648725] [2025-04-13 21:09:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:18,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:09:18,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:18,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:09:18,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:09:18,509 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 58 [2025-04-13 21:09:18,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 60 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 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-04-13 21:09:18,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:18,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 58 [2025-04-13 21:09:18,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:30,573 INFO L116 PetriNetUnfolderBase]: 163843/204798 cut-off events. [2025-04-13 21:09:30,574 INFO L117 PetriNetUnfolderBase]: For 171126/171126 co-relation queries the response was YES. [2025-04-13 21:09:31,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460234 conditions, 204798 events. 163843/204798 cut-off events. For 171126/171126 co-relation queries the response was YES. Maximal size of possible extension queue 6910. Compared 1209565 event pairs, 21503 based on Foata normal form. 1024/192440 useless extension candidates. Maximal degree in co-relation 460214. Up to 177153 conditions per place. [2025-04-13 21:09:32,435 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 65 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2025-04-13 21:09:32,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 455 flow [2025-04-13 21:09:32,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:09:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:09:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 253 transitions. [2025-04-13 21:09:32,436 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6231527093596059 [2025-04-13 21:09:32,436 INFO L175 Difference]: Start difference. First operand has 94 places, 60 transitions, 233 flow. Second operand 7 states and 253 transitions. [2025-04-13 21:09:32,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 455 flow [2025-04-13 21:09:34,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 441 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 21:09:34,389 INFO L231 Difference]: Finished difference. Result has 97 places, 61 transitions, 247 flow [2025-04-13 21:09:34,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=97, PETRI_TRANSITIONS=61} [2025-04-13 21:09:34,390 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 17 predicate places. [2025-04-13 21:09:34,390 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 61 transitions, 247 flow [2025-04-13 21:09:34,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 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-04-13 21:09:34,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:34,390 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:34,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 21:09:34,390 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:34,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:34,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1680379332, now seen corresponding path program 1 times [2025-04-13 21:09:34,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:34,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14599027] [2025-04-13 21:09:34,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:34,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:34,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 21:09:34,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:09:34,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:34,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:09:34,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:09:34,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 21:09:34,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 21:09:34,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:09:34,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:09:34,410 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:09:34,411 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 21:09:34,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 21:09:34,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:09:34,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 21:09:34,411 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:34,411 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:09:34,411 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-13 21:09:34,435 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:09:34,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 66 transitions, 272 flow [2025-04-13 21:09:34,441 INFO L116 PetriNetUnfolderBase]: 8/104 cut-off events. [2025-04-13 21:09:34,441 INFO L117 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-04-13 21:09:34,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 104 events. 8/104 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 194 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 163. Up to 16 conditions per place. [2025-04-13 21:09:34,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 66 transitions, 272 flow [2025-04-13 21:09:34,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 64 transitions, 261 flow [2025-04-13 21:09:34,442 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:09:34,442 INFO L340 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;@7e6d760b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:09:34,443 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:09:34,443 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:09:34,443 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-13 21:09:34,443 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 21:09:34,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:34,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-13 21:09:34,443 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:34,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 15354, now seen corresponding path program 1 times [2025-04-13 21:09:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:34,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840823978] [2025-04-13 21:09:34,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:34,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 21:09:34,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 21:09:34,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:34,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:34,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840823978] [2025-04-13 21:09:34,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840823978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:09:34,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:09:34,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:09:34,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422487291] [2025-04-13 21:09:34,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:09:34,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:09:34,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:34,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:09:34,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:09:34,454 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-04-13 21:09:34,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 261 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-04-13 21:09:34,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:34,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-04-13 21:09:34,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand