/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:50:10,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:50:10,721 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 23:50:10,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:50:10,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:50:10,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:50:10,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:50:10,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:50:10,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:50:10,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:50:10,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:50:10,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:50:10,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:50:10,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:50:10,752 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:50:10,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:50:10,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:50:10,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:50:10,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:50:10,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:50:10,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:50:10,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:50:10,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:50:10,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:50:10,756 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:50:10,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:50:10,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:50:10,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:50:10,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:50:10,986 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:50:10,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i [2025-04-13 23:50:12,310 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9975b146/a372e67cd2a4403d8c52044467ae58ac/FLAG25797b4f8 [2025-04-13 23:50:12,567 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:50:12,568 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i [2025-04-13 23:50:12,581 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9975b146/a372e67cd2a4403d8c52044467ae58ac/FLAG25797b4f8 [2025-04-13 23:50:13,311 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9975b146/a372e67cd2a4403d8c52044467ae58ac [2025-04-13 23:50:13,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:50:13,314 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:50:13,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:50:13,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:50:13,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:50:13,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b68c75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13, skipping insertion in model container [2025-04-13 23:50:13,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:50:13,649 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-ext/14_spin2003.i[30419,30432] [2025-04-13 23:50:13,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:50:13,672 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:50:13,719 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-ext/14_spin2003.i[30419,30432] [2025-04-13 23:50:13,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:50:13,748 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:50:13,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13 WrapperNode [2025-04-13 23:50:13,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:50:13,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:50:13,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:50:13,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:50:13,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,772 INFO L138 Inliner]: procedures = 161, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-04-13 23:50:13,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:50:13,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:50:13,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:50:13,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:50:13,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,792 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 23:50:13,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:50:13,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:50:13,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:50:13,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:50:13,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (1/1) ... [2025-04-13 23:50:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:50:13,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:13,826 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 23:50:13,832 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 23:50:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:50:13,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:50:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:50:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:50:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:50:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:50:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:50:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:50:13,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:50:13,847 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:50:13,935 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:50:13,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:50:14,012 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:50:14,013 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:50:14,013 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:50:14,089 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:50:14,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:50:14 BoogieIcfgContainer [2025-04-13 23:50:14,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:50:14,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:50:14,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:50:14,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:50:14,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:50:13" (1/3) ... [2025-04-13 23:50:14,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea32644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:50:14, skipping insertion in model container [2025-04-13 23:50:14,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:13" (2/3) ... [2025-04-13 23:50:14,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea32644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:50:14, skipping insertion in model container [2025-04-13 23:50:14,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:50:14" (3/3) ... [2025-04-13 23:50:14,096 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2025-04-13 23:50:14,106 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:50:14,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 11 locations, 10 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-13 23:50:14,107 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:50:14,128 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:14,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 11 transitions, 26 flow [2025-04-13 23:50:14,177 INFO L116 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-04-13 23:50:14,183 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:50:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 13 events. 0/13 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 23:50:14,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 14 places, 11 transitions, 26 flow [2025-04-13 23:50:14,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 11 transitions, 26 flow [2025-04-13 23:50:14,196 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:14,208 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;@13eefef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:14,209 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:50:14,213 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:14,213 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:50:14,213 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:50:14,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:14,213 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-04-13 23:50:14,214 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:50:14,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash 103200582, now seen corresponding path program 1 times [2025-04-13 23:50:14,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:14,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461416677] [2025-04-13 23:50:14,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:14,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:14,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:50:14,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:50:14,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:14,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:14,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:50:14,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:50:14,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:14,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:14,320 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:14,321 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:50:14,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:50:14,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 23:50:14,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:50:14,323 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:50:14,328 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:14,328 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:50:14,339 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:14,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2025-04-13 23:50:14,346 INFO L116 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-04-13 23:50:14,346 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:50:14,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-04-13 23:50:14,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2025-04-13 23:50:14,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2025-04-13 23:50:14,347 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:14,347 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;@13eefef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:14,347 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:50:14,350 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:14,350 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 23:50:14,350 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:50:14,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:14,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:50:14,350 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:50:14,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -563056641, now seen corresponding path program 1 times [2025-04-13 23:50:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:14,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289249907] [2025-04-13 23:50:14,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:14,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:14,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:14,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:50:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:14,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289249907] [2025-04-13 23:50:14,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289249907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:14,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:14,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:14,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607656035] [2025-04-13 23:50:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:14,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:14,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:14,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:14,460 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 23:50:14,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 23:50:14,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:14,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 23:50:14,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:14,544 INFO L116 PetriNetUnfolderBase]: 64/133 cut-off events. [2025-04-13 23:50:14,544 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 23:50:14,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 133 events. 64/133 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 439 event pairs, 64 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 165. Up to 127 conditions per place. [2025-04-13 23:50:14,547 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 12 selfloop transitions, 0 changer transitions 0/15 dead transitions. [2025-04-13 23:50:14,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 64 flow [2025-04-13 23:50:14,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2025-04-13 23:50:14,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 23:50:14,558 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 2 states and 21 transitions. [2025-04-13 23:50:14,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 64 flow [2025-04-13 23:50:14,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 15 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:14,562 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 40 flow [2025-04-13 23:50:14,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, 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=40, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2025-04-13 23:50:14,566 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, -2 predicate places. [2025-04-13 23:50:14,566 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 40 flow [2025-04-13 23:50:14,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 23:50:14,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:14,566 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-04-13 23:50:14,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:50:14,566 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:50:14,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash -275237768, now seen corresponding path program 1 times [2025-04-13 23:50:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:14,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031536084] [2025-04-13 23:50:14,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:14,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:14,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:50:14,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:50:14,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:14,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:14,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:50:14,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:50:14,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:14,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:14,595 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:14,595 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:50:14,595 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:50:14,595 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:50:14,595 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:50:14,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:50:14,595 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:50:14,596 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:14,596 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:50:14,611 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:14,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 68 flow [2025-04-13 23:50:14,622 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-13 23:50:14,622 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:50:14,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-04-13 23:50:14,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 68 flow [2025-04-13 23:50:14,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 68 flow [2025-04-13 23:50:14,623 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:14,623 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;@13eefef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:14,623 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:50:14,625 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:14,625 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 23:50:14,625 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:14,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:14,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:50:14,626 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:50:14,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:14,626 INFO L85 PathProgramCache]: Analyzing trace with hash 176708505, now seen corresponding path program 1 times [2025-04-13 23:50:14,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:14,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58923890] [2025-04-13 23:50:14,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:14,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:14,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:50:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:14,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58923890] [2025-04-13 23:50:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58923890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:14,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:14,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782897051] [2025-04-13 23:50:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:14,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:14,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:14,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:14,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:14,678 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-04-13 23:50:14,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 23:50:14,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:14,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-04-13 23:50:14,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:14,801 INFO L116 PetriNetUnfolderBase]: 564/897 cut-off events. [2025-04-13 23:50:14,801 INFO L117 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-04-13 23:50:14,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 897 events. 564/897 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3899 event pairs, 564 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 653. Up to 877 conditions per place. [2025-04-13 23:50:14,811 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 17 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-04-13 23:50:14,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 94 flow [2025-04-13 23:50:14,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2025-04-13 23:50:14,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-04-13 23:50:14,814 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 68 flow. Second operand 2 states and 29 transitions. [2025-04-13 23:50:14,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 94 flow [2025-04-13 23:50:14,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:14,816 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2025-04-13 23:50:14,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2025-04-13 23:50:14,817 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2025-04-13 23:50:14,817 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2025-04-13 23:50:14,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 23:50:14,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:14,817 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 23:50:14,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:50:14,817 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:50:14,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1638643458, now seen corresponding path program 1 times [2025-04-13 23:50:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:14,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896498797] [2025-04-13 23:50:14,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:14,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:50:14,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:50:14,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:14,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:14,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:50:14,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:50:14,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:14,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:14,862 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:14,862 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:50:14,863 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:50:14,863 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:50:14,863 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:50:14,863 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:50:14,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:50:14,863 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:50:14,864 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:14,864 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:50:14,881 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:14,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2025-04-13 23:50:14,890 INFO L116 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-04-13 23:50:14,890 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:50:14,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 40 events. 0/40 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-04-13 23:50:14,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2025-04-13 23:50:14,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 92 flow [2025-04-13 23:50:14,892 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:14,893 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;@13eefef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:14,893 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:50:14,895 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:14,895 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 23:50:14,895 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:14,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:14,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:50:14,895 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:50:14,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1123563801, now seen corresponding path program 1 times [2025-04-13 23:50:14,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:14,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156754124] [2025-04-13 23:50:14,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:14,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:14,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:14,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:14,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 23:50:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:14,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156754124] [2025-04-13 23:50:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156754124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:14,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:14,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156564830] [2025-04-13 23:50:14,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:14,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:14,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:14,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:14,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 23:50:14,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 23:50:14,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:14,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 23:50:14,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:15,369 INFO L116 PetriNetUnfolderBase]: 4064/5725 cut-off events. [2025-04-13 23:50:15,369 INFO L117 PetriNetUnfolderBase]: For 1711/1711 co-relation queries the response was YES. [2025-04-13 23:50:15,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12099 conditions, 5725 events. 4064/5725 cut-off events. For 1711/1711 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28743 event pairs, 4064 based on Foata normal form. 0/5674 useless extension candidates. Maximal degree in co-relation 1919. Up to 5627 conditions per place. [2025-04-13 23:50:15,394 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-04-13 23:50:15,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 126 flow [2025-04-13 23:50:15,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2025-04-13 23:50:15,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-04-13 23:50:15,396 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 92 flow. Second operand 2 states and 37 transitions. [2025-04-13 23:50:15,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 126 flow [2025-04-13 23:50:15,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 120 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:15,400 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 76 flow [2025-04-13 23:50:15,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-04-13 23:50:15,401 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2025-04-13 23:50:15,401 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 76 flow [2025-04-13 23:50:15,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 23:50:15,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:15,401 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:15,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:50:15,401 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:50:15,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1855509128, now seen corresponding path program 1 times [2025-04-13 23:50:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:15,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805139260] [2025-04-13 23:50:15,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:15,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:50:15,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:50:15,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:15,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:15,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:15,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:50:15,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:50:15,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:15,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:15,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:15,429 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:15,430 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:50:15,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:50:15,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:50:15,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:50:15,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:50:15,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:50:15,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:50:15,430 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:50:15,430 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:15,431 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:50:15,451 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:15,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 118 flow [2025-04-13 23:50:15,458 INFO L116 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-04-13 23:50:15,458 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:50:15,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 49 events. 0/49 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-04-13 23:50:15,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 39 transitions, 118 flow [2025-04-13 23:50:15,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 118 flow [2025-04-13 23:50:15,459 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:15,460 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;@13eefef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:15,460 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:50:15,461 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:15,463 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 23:50:15,463 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:50:15,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:15,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:50:15,463 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:50:15,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2017475923, now seen corresponding path program 1 times [2025-04-13 23:50:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:15,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140686814] [2025-04-13 23:50:15,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:15,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:15,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:15,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:15,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:50:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:15,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140686814] [2025-04-13 23:50:15,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140686814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:15,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:15,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:15,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140449216] [2025-04-13 23:50:15,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:15,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:15,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:15,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:15,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:15,490 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 23:50:15,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 118 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 23:50:15,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:15,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 23:50:15,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:17,481 INFO L116 PetriNetUnfolderBase]: 26564/34865 cut-off events. [2025-04-13 23:50:17,481 INFO L117 PetriNetUnfolderBase]: For 13426/13426 co-relation queries the response was YES. [2025-04-13 23:50:17,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73740 conditions, 34865 events. 26564/34865 cut-off events. For 13426/13426 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 190073 event pairs, 26564 based on Foata normal form. 0/34614 useless extension candidates. Maximal degree in co-relation 12247. Up to 34377 conditions per place. [2025-04-13 23:50:17,695 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 27 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2025-04-13 23:50:17,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 160 flow [2025-04-13 23:50:17,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-04-13 23:50:17,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2025-04-13 23:50:17,697 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 118 flow. Second operand 2 states and 45 transitions. [2025-04-13 23:50:17,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 160 flow [2025-04-13 23:50:17,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 33 transitions, 148 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:17,707 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 94 flow [2025-04-13 23:50:17,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2025-04-13 23:50:17,708 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-04-13 23:50:17,708 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 94 flow [2025-04-13 23:50:17,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 23:50:17,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:17,708 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:17,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:50:17,709 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:50:17,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash 782432902, now seen corresponding path program 1 times [2025-04-13 23:50:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:17,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603104837] [2025-04-13 23:50:17,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:17,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 23:50:17,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:50:17,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:17,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:17,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:17,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 23:50:17,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:50:17,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:17,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:17,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:17,735 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:17,735 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 23:50:17,735 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 23:50:17,735 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 23:50:17,735 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 23:50:17,735 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 23:50:17,735 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 23:50:17,735 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 23:50:17,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:50:17,736 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:50:17,736 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:17,736 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 23:50:17,760 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:17,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 146 flow [2025-04-13 23:50:17,767 INFO L116 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-04-13 23:50:17,767 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 23:50:17,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 58 events. 0/58 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 151 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-04-13 23:50:17,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 146 flow [2025-04-13 23:50:17,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 146 flow [2025-04-13 23:50:17,769 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:17,770 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;@13eefef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:17,770 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 23:50:17,771 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:17,771 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 23:50:17,771 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:17,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:17,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:50:17,771 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 23:50:17,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash -656458201, now seen corresponding path program 1 times [2025-04-13 23:50:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:17,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74271124] [2025-04-13 23:50:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:17,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:17,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:17,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:17,797 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 23:50:17,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:17,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74271124] [2025-04-13 23:50:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74271124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:17,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:17,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479326407] [2025-04-13 23:50:17,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:17,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:17,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:17,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:17,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2025-04-13 23:50:17,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23:50:17,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:17,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2025-04-13 23:50:17,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:27,011 INFO L116 PetriNetUnfolderBase]: 164064/205565 cut-off events. [2025-04-13 23:50:27,011 INFO L117 PetriNetUnfolderBase]: For 96751/96751 co-relation queries the response was YES. [2025-04-13 23:50:27,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435066 conditions, 205565 events. 164064/205565 cut-off events. For 96751/96751 co-relation queries the response was YES. Maximal size of possible extension queue 5914. Compared 1182592 event pairs, 164064 based on Foata normal form. 0/204314 useless extension candidates. Maximal degree in co-relation 74512. Up to 203127 conditions per place. [2025-04-13 23:50:28,327 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 32 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-04-13 23:50:28,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 196 flow [2025-04-13 23:50:28,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-04-13 23:50:28,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2025-04-13 23:50:28,332 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 146 flow. Second operand 2 states and 53 transitions. [2025-04-13 23:50:28,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 196 flow [2025-04-13 23:50:28,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 39 transitions, 176 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-13 23:50:28,381 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 112 flow [2025-04-13 23:50:28,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=112, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-04-13 23:50:28,382 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2025-04-13 23:50:28,382 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 112 flow [2025-04-13 23:50:28,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23:50:28,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:28,382 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:28,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:50:28,382 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 23:50:28,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1646810936, now seen corresponding path program 1 times [2025-04-13 23:50:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:28,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676904043] [2025-04-13 23:50:28,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:28,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:50:28,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:50:28,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:28,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:28,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:28,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:50:28,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:50:28,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:28,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:28,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:28,416 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:28,416 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 23:50:28,416 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 23:50:28,416 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 23:50:28,416 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 23:50:28,416 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 23:50:28,417 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 23:50:28,417 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 23:50:28,417 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 23:50:28,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:50:28,417 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:50:28,417 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:28,417 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-13 23:50:28,438 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:28,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 53 transitions, 176 flow [2025-04-13 23:50:28,445 INFO L116 PetriNetUnfolderBase]: 0/67 cut-off events. [2025-04-13 23:50:28,446 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-13 23:50:28,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 67 events. 0/67 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-04-13 23:50:28,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 53 transitions, 176 flow [2025-04-13 23:50:28,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 53 transitions, 176 flow [2025-04-13 23:50:28,447 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:28,449 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;@13eefef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:28,449 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 23:50:28,450 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:28,450 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 23:50:28,450 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:50:28,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:28,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:50:28,450 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 23:50:28,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 911661587, now seen corresponding path program 1 times [2025-04-13 23:50:28,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:28,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576985408] [2025-04-13 23:50:28,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:28,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:28,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:28,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:28,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:28,468 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 23:50:28,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:28,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576985408] [2025-04-13 23:50:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576985408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049318457] [2025-04-13 23:50:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:28,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:28,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:28,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:28,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:28,469 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 53 [2025-04-13 23:50:28,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 176 flow. Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 23:50:28,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:28,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 53 [2025-04-13 23:50:28,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand