/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:22:49,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:22:49,860 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 19:22:49,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:22:49,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:22:49,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:22:49,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:22:49,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:22:49,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:22:49,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:22:49,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:22:49,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:22:49,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:22:49,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:22:49,884 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:22:49,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:22:49,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:22:49,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:22:49,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:22:49,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:22:49,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:22:49,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:22:49,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:22:49,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:22:49,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:22:50,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:22:50,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:22:50,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:22:50,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:22:50,117 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:22:50,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2025-04-13 19:22:51,453 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98bc2995/afcfd9d220ef424282a6fff6c51dba77/FLAG23f9627a8 [2025-04-13 19:22:51,682 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:22:51,682 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2025-04-13 19:22:51,690 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98bc2995/afcfd9d220ef424282a6fff6c51dba77/FLAG23f9627a8 [2025-04-13 19:22:52,454 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98bc2995/afcfd9d220ef424282a6fff6c51dba77 [2025-04-13 19:22:52,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:22:52,458 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:22:52,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:22:52,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:22:52,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:22:52,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc9e10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52, skipping insertion in model container [2025-04-13 19:22:52,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:22:52,778 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/40_barrier_vf.i[30834,30847] [2025-04-13 19:22:52,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:22:52,803 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:22:52,839 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/40_barrier_vf.i[30834,30847] [2025-04-13 19:22:52,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:22:52,877 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:22:52,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52 WrapperNode [2025-04-13 19:22:52,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:22:52,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:22:52,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:22:52,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:22:52,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,908 INFO L138 Inliner]: procedures = 164, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 166 [2025-04-13 19:22:52,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:22:52,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:22:52,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:22:52,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:22:52,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,926 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 19:22:52,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:22:52,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:22:52,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:22:52,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:22:52,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (1/1) ... [2025-04-13 19:22:52,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:22:52,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:22:52,966 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 19:22:52,969 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 19:22:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:22:52,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:22:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:22:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:22:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:22:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:22:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:22:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:22:52,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:22:52,987 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:22:53,096 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:22:53,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:22:53,280 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:22:53,281 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:22:53,281 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:22:53,971 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:22:53,986 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 19:22:53,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:22:53 BoogieIcfgContainer [2025-04-13 19:22:53,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:22:53,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:22:53,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:22:53,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:22:53,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:22:52" (1/3) ... [2025-04-13 19:22:53,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b74182c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:22:53, skipping insertion in model container [2025-04-13 19:22:53,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:52" (2/3) ... [2025-04-13 19:22:53,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b74182c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:22:53, skipping insertion in model container [2025-04-13 19:22:53,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:22:53" (3/3) ... [2025-04-13 19:22:53,996 INFO L128 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2025-04-13 19:22:54,006 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:22:54,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 40_barrier_vf.i that has 2 procedures, 14 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 19:22:54,008 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:22:54,046 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:54,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 17 transitions, 38 flow [2025-04-13 19:22:54,109 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-13 19:22:54,111 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:22:54,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 17 events. 2/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-13 19:22:54,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 17 transitions, 38 flow [2025-04-13 19:22:54,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 16 transitions, 36 flow [2025-04-13 19:22:54,122 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:54,132 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;@5ebc918d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:54,133 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:22:54,143 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:54,143 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 19:22:54,143 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:22:54,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:54,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:22:54,144 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 19:22:54,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash 12574892, now seen corresponding path program 1 times [2025-04-13 19:22:54,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:54,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503022071] [2025-04-13 19:22:54,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:54,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:54,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:54,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:54,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:54,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:54,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:22:54,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:54,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:54,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:54,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:54,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:22:54,468 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:22:54,468 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 19:22:54,469 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:22:54,470 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 19:22:54,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:22:54,471 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:22:54,476 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:22:54,476 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:22:54,495 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:54,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 68 flow [2025-04-13 19:22:54,513 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-13 19:22:54,513 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:22:54,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 31 events. 4/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 3 conditions per place. [2025-04-13 19:22:54,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 29 transitions, 68 flow [2025-04-13 19:22:54,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 28 transitions, 66 flow [2025-04-13 19:22:54,515 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:54,515 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;@5ebc918d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:54,515 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:22:54,524 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:54,524 INFO L116 PetriNetUnfolderBase]: 1/14 cut-off events. [2025-04-13 19:22:54,524 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:22:54,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:54,524 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 19:22:54,524 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:22:54,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:54,525 INFO L85 PathProgramCache]: Analyzing trace with hash 67672522, now seen corresponding path program 1 times [2025-04-13 19:22:54,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:54,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108969531] [2025-04-13 19:22:54,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:54,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:22:54,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:22:54,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:54,716 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:22:54,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:22:54,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:22:54,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:54,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:54,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:22:54,753 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:22:54,753 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:22:54,753 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:22:54,753 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:22:54,753 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:22:54,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:22:54,753 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:22:54,754 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:22:54,754 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:22:54,782 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:54,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 100 flow [2025-04-13 19:22:54,798 INFO L116 PetriNetUnfolderBase]: 6/45 cut-off events. [2025-04-13 19:22:54,798 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:22:54,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 6/45 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 4 conditions per place. [2025-04-13 19:22:54,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 100 flow [2025-04-13 19:22:54,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 40 transitions, 98 flow [2025-04-13 19:22:54,801 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:54,801 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;@5ebc918d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:54,801 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:22:54,811 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:54,812 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-13 19:22:54,812 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:22:54,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:54,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:22:54,812 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 19:22:54,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1383242476, now seen corresponding path program 1 times [2025-04-13 19:22:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:54,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241926340] [2025-04-13 19:22:54,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:54,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:22:54,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:22:54,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:54,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:22:54,999 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 19:22:54,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:22:54,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241926340] [2025-04-13 19:22:55,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241926340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:22:55,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:22:55,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:22:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090953003] [2025-04-13 19:22:55,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:22:55,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:22:55,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:22:55,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:22:55,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:22:55,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2025-04-13 19:22:55,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 19:22:55,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:22:55,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2025-04-13 19:22:55,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:22:55,525 INFO L116 PetriNetUnfolderBase]: 3802/5655 cut-off events. [2025-04-13 19:22:55,525 INFO L117 PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES. [2025-04-13 19:22:55,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11248 conditions, 5655 events. 3802/5655 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 31930 event pairs, 1178 based on Foata normal form. 0/5203 useless extension candidates. Maximal degree in co-relation 7128. Up to 2961 conditions per place. [2025-04-13 19:22:55,563 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 46 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-04-13 19:22:55,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 256 flow [2025-04-13 19:22:55,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:22:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:22:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-04-13 19:22:55,572 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6910569105691057 [2025-04-13 19:22:55,573 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 98 flow. Second operand 3 states and 85 transitions. [2025-04-13 19:22:55,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 256 flow [2025-04-13 19:22:55,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 252 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 19:22:55,581 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 121 flow [2025-04-13 19:22:55,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-04-13 19:22:55,585 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-04-13 19:22:55,586 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 121 flow [2025-04-13 19:22:55,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 19:22:55,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:55,586 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 19:22:55,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:22:55,586 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 19:22:55,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash -821778369, now seen corresponding path program 1 times [2025-04-13 19:22:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:55,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828812853] [2025-04-13 19:22:55,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:55,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:55,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:22:55,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:22:55,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:55,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:55,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:22:55,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:22:55,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:22:55,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:55,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:55,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:22:55,745 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:22:55,745 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:22:55,746 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:22:55,746 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:22:55,746 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:22:55,746 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:22:55,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:22:55,746 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:22:55,746 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:22:55,746 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:22:55,771 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:55,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 134 flow [2025-04-13 19:22:55,780 INFO L116 PetriNetUnfolderBase]: 8/59 cut-off events. [2025-04-13 19:22:55,781 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:22:55,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 59 events. 8/59 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 165 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 57. Up to 5 conditions per place. [2025-04-13 19:22:55,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 53 transitions, 134 flow [2025-04-13 19:22:55,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 52 transitions, 132 flow [2025-04-13 19:22:55,784 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:55,784 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;@5ebc918d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:55,784 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:22:55,790 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:55,791 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-13 19:22:55,791 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 19:22:55,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:55,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:22:55,791 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 19:22:55,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1225328799, now seen corresponding path program 1 times [2025-04-13 19:22:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:55,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610764713] [2025-04-13 19:22:55,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:55,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:22:55,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:22:55,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:55,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:22:55,969 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 19:22:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:22:55,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610764713] [2025-04-13 19:22:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610764713] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:22:55,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:22:55,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:22:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779437332] [2025-04-13 19:22:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:22:55,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:22:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:22:55,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:22:55,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:22:55,971 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 53 [2025-04-13 19:22:55,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 19:22:55,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:22:55,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 53 [2025-04-13 19:22:55,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:22:58,957 INFO L116 PetriNetUnfolderBase]: 49180/65607 cut-off events. [2025-04-13 19:22:58,958 INFO L117 PetriNetUnfolderBase]: For 7352/7352 co-relation queries the response was YES. [2025-04-13 19:22:59,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131908 conditions, 65607 events. 49180/65607 cut-off events. For 7352/7352 co-relation queries the response was YES. Maximal size of possible extension queue 2923. Compared 408170 event pairs, 16184 based on Foata normal form. 0/60651 useless extension candidates. Maximal degree in co-relation 49860. Up to 33573 conditions per place. [2025-04-13 19:22:59,339 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 61 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2025-04-13 19:22:59,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 347 flow [2025-04-13 19:22:59,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:22:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:22:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-04-13 19:22:59,340 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2025-04-13 19:22:59,340 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 132 flow. Second operand 3 states and 111 transitions. [2025-04-13 19:22:59,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 347 flow [2025-04-13 19:22:59,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 335 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 19:22:59,346 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 159 flow [2025-04-13 19:22:59,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2025-04-13 19:22:59,346 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2025-04-13 19:22:59,346 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 159 flow [2025-04-13 19:22:59,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 19:22:59,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:59,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:22:59,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:22:59,347 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:22:59,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:59,347 INFO L85 PathProgramCache]: Analyzing trace with hash 669481655, now seen corresponding path program 1 times [2025-04-13 19:22:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:59,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522233942] [2025-04-13 19:22:59,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:59,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:22:59,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:22:59,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:59,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:22:59,511 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 19:22:59,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:22:59,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522233942] [2025-04-13 19:22:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522233942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:22:59,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:22:59,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:22:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207077733] [2025-04-13 19:22:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:22:59,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:22:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:22:59,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:22:59,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:22:59,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 53 [2025-04-13 19:22:59,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 19:22:59,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:22:59,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 53 [2025-04-13 19:22:59,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:01,734 INFO L116 PetriNetUnfolderBase]: 44538/58963 cut-off events. [2025-04-13 19:23:01,734 INFO L117 PetriNetUnfolderBase]: For 9165/9165 co-relation queries the response was YES. [2025-04-13 19:23:01,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127442 conditions, 58963 events. 44538/58963 cut-off events. For 9165/9165 co-relation queries the response was YES. Maximal size of possible extension queue 2357. Compared 340788 event pairs, 14010 based on Foata normal form. 1172/60069 useless extension candidates. Maximal degree in co-relation 104298. Up to 50511 conditions per place. [2025-04-13 19:23:02,274 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 72 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-04-13 19:23:02,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 417 flow [2025-04-13 19:23:02,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-04-13 19:23:02,275 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5534591194968553 [2025-04-13 19:23:02,275 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 159 flow. Second operand 3 states and 88 transitions. [2025-04-13 19:23:02,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 417 flow [2025-04-13 19:23:02,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:23:02,297 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 197 flow [2025-04-13 19:23:02,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2025-04-13 19:23:02,298 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2025-04-13 19:23:02,298 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 197 flow [2025-04-13 19:23:02,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 19:23:02,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:02,298 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:02,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:23:02,298 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:23:02,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash -569841653, now seen corresponding path program 1 times [2025-04-13 19:23:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:02,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488145346] [2025-04-13 19:23:02,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:02,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:23:02,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:23:02,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:02,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:02,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:23:02,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:23:02,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:23:02,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:02,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:02,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:23:02,401 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:23:02,401 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:23:02,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:23:02,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:23:02,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:23:02,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:23:02,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:23:02,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:23:02,401 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 19:23:02,405 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:23:02,405 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:23:02,430 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:23:02,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 65 transitions, 170 flow [2025-04-13 19:23:02,437 INFO L116 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-04-13 19:23:02,437 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:23:02,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 73 events. 10/73 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 77. Up to 6 conditions per place. [2025-04-13 19:23:02,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 65 transitions, 170 flow [2025-04-13 19:23:02,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 64 transitions, 168 flow [2025-04-13 19:23:02,438 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:23:02,438 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;@5ebc918d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:23:02,439 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:23:02,442 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:23:02,442 INFO L116 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-04-13 19:23:02,442 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:23:02,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:02,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:02,442 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 19:23:02,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1439783732, now seen corresponding path program 1 times [2025-04-13 19:23:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:02,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808655798] [2025-04-13 19:23:02,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:02,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:02,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:23:02,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:23:02,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:02,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:02,551 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 19:23:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:02,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808655798] [2025-04-13 19:23:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808655798] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991382455] [2025-04-13 19:23:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:02,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:02,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:02,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:02,552 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 65 [2025-04-13 19:23:02,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 19:23:02,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:02,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 65 [2025-04-13 19:23:02,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:33,571 INFO L116 PetriNetUnfolderBase]: 552292/692745 cut-off events. [2025-04-13 19:23:33,571 INFO L117 PetriNetUnfolderBase]: For 102213/102213 co-relation queries the response was YES. [2025-04-13 19:23:35,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401387 conditions, 692745 events. 552292/692745 cut-off events. For 102213/102213 co-relation queries the response was YES. Maximal size of possible extension queue 23194. Compared 4526696 event pairs, 189054 based on Foata normal form. 0/642705 useless extension candidates. Maximal degree in co-relation 258428. Up to 350891 conditions per place. [2025-04-13 19:23:38,123 INFO L140 encePairwiseOnDemand]: 48/65 looper letters, 76 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2025-04-13 19:23:38,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 442 flow [2025-04-13 19:23:38,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-04-13 19:23:38,125 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2025-04-13 19:23:38,125 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 168 flow. Second operand 3 states and 137 transitions. [2025-04-13 19:23:38,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 442 flow [2025-04-13 19:23:38,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 418 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-13 19:23:38,166 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 197 flow [2025-04-13 19:23:38,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-04-13 19:23:38,166 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2025-04-13 19:23:38,166 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 197 flow [2025-04-13 19:23:38,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 19:23:38,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:38,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:38,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:23:38,167 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:23:38,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1683653918, now seen corresponding path program 1 times [2025-04-13 19:23:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:38,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760822840] [2025-04-13 19:23:38,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:23:38,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:23:38,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:38,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:38,286 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 19:23:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:38,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760822840] [2025-04-13 19:23:38,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760822840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:38,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:38,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959342315] [2025-04-13 19:23:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:38,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:38,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:38,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:38,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:38,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 65 [2025-04-13 19:23:38,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 19:23:38,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:38,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 65 [2025-04-13 19:23:38,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand