/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/39_rand_lock_p0_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:22:45,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:22:45,758 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:45,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:22:45,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:22:45,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:22:45,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:22:45,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:22:45,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:22:45,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:22:45,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:22:45,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:22:45,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:22:45,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:22:45,775 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:22:45,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:22:45,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:22:45,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:22:45,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:22:45,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:22:45,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:22:45,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:22:45,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:22:45,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:22:45,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:22:45,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:22:45,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:22:45,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:22:45,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:22:45,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:22:45,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:22:45,777 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:45,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:22:45,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:22:45,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:22:45,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:22:45,998 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:22:45,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs.i [2025-04-13 19:22:47,293 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13a007d4/b622d30166af4f72ad34ef3ba4f66286/FLAGc1873f8ae [2025-04-13 19:22:47,541 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:22:47,545 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs.i [2025-04-13 19:22:47,559 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13a007d4/b622d30166af4f72ad34ef3ba4f66286/FLAGc1873f8ae [2025-04-13 19:22:48,294 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13a007d4/b622d30166af4f72ad34ef3ba4f66286 [2025-04-13 19:22:48,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:22:48,298 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:22:48,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:22:48,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:22:48,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:22:48,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:22:48" (1/1) ... [2025-04-13 19:22:48,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68dc4f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:48, skipping insertion in model container [2025-04-13 19:22:48,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:22:48" (1/1) ... [2025-04-13 19:22:48,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:22:48,567 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/39_rand_lock_p0_vs.i[30737,30750] [2025-04-13 19:22:48,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:22:48,584 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:22:48,635 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/39_rand_lock_p0_vs.i[30737,30750] [2025-04-13 19:22:48,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:22:48,661 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:22:48,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:48 WrapperNode [2025-04-13 19:22:48,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:22:48,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:22:48,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:22:48,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:22:48,666 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:48" (1/1) ... [2025-04-13 19:22:48,674 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:48" (1/1) ... [2025-04-13 19:22:48,686 INFO L138 Inliner]: procedures = 166, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2025-04-13 19:22:48,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:22:48,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:22:48,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:22:48,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:22:48,691 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:48" (1/1) ... [2025-04-13 19:22:48,691 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:48" (1/1) ... [2025-04-13 19:22:48,693 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:48" (1/1) ... [2025-04-13 19:22:48,701 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:48,701 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:48" (1/1) ... [2025-04-13 19:22:48,702 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:48" (1/1) ... [2025-04-13 19:22:48,704 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:48" (1/1) ... [2025-04-13 19:22:48,706 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:48" (1/1) ... [2025-04-13 19:22:48,707 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:48" (1/1) ... [2025-04-13 19:22:48,708 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:48" (1/1) ... [2025-04-13 19:22:48,709 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:48" (1/1) ... [2025-04-13 19:22:48,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:22:48,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:22:48,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:22:48,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:22:48,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:48" (1/1) ... [2025-04-13 19:22:48,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:22:48,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:22:48,737 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:48,739 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:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:22:48,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:22:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:22:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:22:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:22:48,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:22:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:22:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:22:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:22:48,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:22:48,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:22:48,755 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:48,848 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:22:48,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:22:48,957 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:22:48,957 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:22:48,957 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:22:49,074 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:49,080 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 19:22:49,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:22:49 BoogieIcfgContainer [2025-04-13 19:22:49,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:22:49,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:22:49,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:22:49,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:22:49,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:22:48" (1/3) ... [2025-04-13 19:22:49,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c93167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:22:49, skipping insertion in model container [2025-04-13 19:22:49,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:22:48" (2/3) ... [2025-04-13 19:22:49,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c93167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:22:49, skipping insertion in model container [2025-04-13 19:22:49,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:22:49" (3/3) ... [2025-04-13 19:22:49,093 INFO L128 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2025-04-13 19:22:49,102 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:22:49,103 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 39_rand_lock_p0_vs.i that has 2 procedures, 14 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 19:22:49,103 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:22:49,135 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:49,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 36 flow [2025-04-13 19:22:49,183 INFO L116 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-04-13 19:22:49,184 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:22:49,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 16 events. 1/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 15 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-13 19:22:49,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 16 transitions, 36 flow [2025-04-13 19:22:49,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 15 transitions, 34 flow [2025-04-13 19:22:49,196 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:49,207 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;@2e4f8df1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:49,208 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:22:49,214 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:49,214 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 19:22:49,214 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:22:49,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:49,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:22:49,215 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:22:49,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:49,218 INFO L85 PathProgramCache]: Analyzing trace with hash 6386833, now seen corresponding path program 1 times [2025-04-13 19:22:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:49,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953235999] [2025-04-13 19:22:49,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:49,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:49,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:49,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:49,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:22:49,403 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:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:22:49,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953235999] [2025-04-13 19:22:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953235999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:22:49,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:22:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:22:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771562466] [2025-04-13 19:22:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:22:49,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:22:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:22:49,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:22:49,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:22:49,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2025-04-13 19:22:49,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 34 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:49,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:22:49,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2025-04-13 19:22:49,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:22:49,508 INFO L116 PetriNetUnfolderBase]: 10/30 cut-off events. [2025-04-13 19:22:49,508 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:22:49,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 30 events. 10/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 5 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 54. Up to 20 conditions per place. [2025-04-13 19:22:49,509 INFO L140 encePairwiseOnDemand]: 12/16 looper letters, 11 selfloop transitions, 2 changer transitions 0/14 dead transitions. [2025-04-13 19:22:49,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 14 transitions, 58 flow [2025-04-13 19:22:49,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:22:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:22:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-13 19:22:49,519 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2025-04-13 19:22:49,520 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 34 flow. Second operand 3 states and 19 transitions. [2025-04-13 19:22:49,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 14 transitions, 58 flow [2025-04-13 19:22:49,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 14 transitions, 58 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:22:49,527 INFO L231 Difference]: Finished difference. Result has 17 places, 13 transitions, 34 flow [2025-04-13 19:22:49,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=34, PETRI_PLACES=17, PETRI_TRANSITIONS=13} [2025-04-13 19:22:49,531 INFO L279 CegarLoopForPetriNet]: 17 programPoint places, 0 predicate places. [2025-04-13 19:22:49,531 INFO L485 AbstractCegarLoop]: Abstraction has has 17 places, 13 transitions, 34 flow [2025-04-13 19:22:49,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:49,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:49,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:22:49,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:22:49,531 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:22:49,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash 6386656, now seen corresponding path program 1 times [2025-04-13 19:22:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:49,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085403340] [2025-04-13 19:22:49,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:49,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:49,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:49,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:49,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:49,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:22:49,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:49,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:49,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:49,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:49,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:22:49,576 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:22:49,577 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 19:22:49,579 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:22:49,579 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 19:22:49,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:22:49,579 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:22:49,581 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:22:49,581 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:22:49,598 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:49,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 27 transitions, 64 flow [2025-04-13 19:22:49,607 INFO L116 PetriNetUnfolderBase]: 2/29 cut-off events. [2025-04-13 19:22:49,607 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:22:49,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 29 events. 2/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2025-04-13 19:22:49,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 27 transitions, 64 flow [2025-04-13 19:22:49,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 62 flow [2025-04-13 19:22:49,608 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:49,609 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;@2e4f8df1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:49,609 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:22:49,612 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:49,612 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 19:22:49,612 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:22:49,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:49,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:22:49,612 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 19:22:49,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash 7227931, now seen corresponding path program 1 times [2025-04-13 19:22:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:49,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496663090] [2025-04-13 19:22:49,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:49,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:49,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:49,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:49,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:49,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:22:49,662 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:49,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:22:49,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496663090] [2025-04-13 19:22:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496663090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:22:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:22:49,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:22:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939420142] [2025-04-13 19:22:49,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:22:49,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:22:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:22:49,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:22:49,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:22:49,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2025-04-13 19:22:49,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:49,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:22:49,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2025-04-13 19:22:49,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:22:49,798 INFO L116 PetriNetUnfolderBase]: 276/472 cut-off events. [2025-04-13 19:22:49,799 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-13 19:22:49,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 472 events. 276/472 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1561 event pairs, 115 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 656. Up to 264 conditions per place. [2025-04-13 19:22:49,803 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-04-13 19:22:49,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 41 transitions, 177 flow [2025-04-13 19:22:49,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:22:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:22:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-13 19:22:49,805 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2025-04-13 19:22:49,805 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 62 flow. Second operand 3 states and 47 transitions. [2025-04-13 19:22:49,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 41 transitions, 177 flow [2025-04-13 19:22:49,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 177 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:22:49,807 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 81 flow [2025-04-13 19:22:49,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2025-04-13 19:22:49,808 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-04-13 19:22:49,808 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 81 flow [2025-04-13 19:22:49,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:49,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:49,808 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 19:22:49,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:22:49,808 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 19:22:49,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1644352496, now seen corresponding path program 1 times [2025-04-13 19:22:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:49,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814600077] [2025-04-13 19:22:49,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:49,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:22:49,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:22:49,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:49,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:49,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:22:49,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:22:49,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:22:49,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:49,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:49,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:22:49,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:22:49,838 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:22:49,838 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:22:49,838 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:22:49,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:22:49,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:22:49,839 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:22:49,839 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:22:49,839 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:22:49,866 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:49,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 94 flow [2025-04-13 19:22:49,876 INFO L116 PetriNetUnfolderBase]: 3/42 cut-off events. [2025-04-13 19:22:49,876 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:22:49,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 3/42 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 98 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2025-04-13 19:22:49,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 38 transitions, 94 flow [2025-04-13 19:22:49,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 37 transitions, 92 flow [2025-04-13 19:22:49,877 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:49,877 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;@2e4f8df1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:49,877 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:22:49,879 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:49,879 INFO L116 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-04-13 19:22:49,879 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:22:49,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:49,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:22:49,880 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:49,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash 8407333, now seen corresponding path program 1 times [2025-04-13 19:22:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:49,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602323594] [2025-04-13 19:22:49,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:49,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:49,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:49,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:49,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:22:49,920 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:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:22:49,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602323594] [2025-04-13 19:22:49,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602323594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:22:49,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:22:49,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:22:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638124270] [2025-04-13 19:22:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:22:49,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:22:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:22:49,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:22:49,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:22:49,926 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2025-04-13 19:22:49,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:49,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:22:49,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2025-04-13 19:22:49,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:22:50,471 INFO L116 PetriNetUnfolderBase]: 4650/6597 cut-off events. [2025-04-13 19:22:50,472 INFO L117 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-04-13 19:22:50,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13568 conditions, 6597 events. 4650/6597 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 29260 event pairs, 1585 based on Foata normal form. 0/5719 useless extension candidates. Maximal degree in co-relation 6984. Up to 4836 conditions per place. [2025-04-13 19:22:50,509 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 55 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-04-13 19:22:50,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 268 flow [2025-04-13 19:22:50,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:22:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:22:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-13 19:22:50,511 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2025-04-13 19:22:50,511 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 92 flow. Second operand 3 states and 67 transitions. [2025-04-13 19:22:50,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 268 flow [2025-04-13 19:22:50,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 264 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 19:22:50,516 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 118 flow [2025-04-13 19:22:50,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-04-13 19:22:50,516 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-04-13 19:22:50,516 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 118 flow [2025-04-13 19:22:50,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:50,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:50,517 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 19:22:50,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:22:50,517 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:50,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1383538475, now seen corresponding path program 1 times [2025-04-13 19:22:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:50,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571231567] [2025-04-13 19:22:50,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:50,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:50,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:22:50,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:22:50,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:50,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:50,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:22:50,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:22:50,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:22:50,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:50,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:22:50,543 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:22:50,543 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:22:50,543 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:22:50,543 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:22:50,543 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:22:50,543 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:22:50,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:22:50,543 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:22:50,544 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:22:50,544 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:22:50,578 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 126 flow [2025-04-13 19:22:50,587 INFO L116 PetriNetUnfolderBase]: 4/55 cut-off events. [2025-04-13 19:22:50,588 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:22:50,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 55 events. 4/55 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 54. Up to 5 conditions per place. [2025-04-13 19:22:50,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 49 transitions, 126 flow [2025-04-13 19:22:50,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 48 transitions, 124 flow [2025-04-13 19:22:50,590 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:50,592 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;@2e4f8df1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:50,592 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:22:50,593 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:50,593 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 19:22:50,593 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:22:50,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:50,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:22:50,593 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:50,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash 9925679, now seen corresponding path program 1 times [2025-04-13 19:22:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:50,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092506325] [2025-04-13 19:22:50,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:50,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:50,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:50,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:50,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:22:50,625 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:50,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:22:50,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092506325] [2025-04-13 19:22:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092506325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:22:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:22:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:22:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109955896] [2025-04-13 19:22:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:22:50,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:22:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:22:50,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:22:50,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:22:50,634 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2025-04-13 19:22:50,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:50,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:22:50,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2025-04-13 19:22:50,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:22:54,621 INFO L116 PetriNetUnfolderBase]: 66772/86549 cut-off events. [2025-04-13 19:22:54,622 INFO L117 PetriNetUnfolderBase]: For 9514/9514 co-relation queries the response was YES. [2025-04-13 19:22:54,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177798 conditions, 86549 events. 66772/86549 cut-off events. For 9514/9514 co-relation queries the response was YES. Maximal size of possible extension queue 1610. Compared 445194 event pairs, 19865 based on Foata normal form. 0/73431 useless extension candidates. Maximal degree in co-relation 36000. Up to 72868 conditions per place. [2025-04-13 19:22:54,975 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 73 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2025-04-13 19:22:54,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 363 flow [2025-04-13 19:22:54,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:22:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:22:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-04-13 19:22:54,976 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-04-13 19:22:54,976 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 124 flow. Second operand 3 states and 87 transitions. [2025-04-13 19:22:54,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 363 flow [2025-04-13 19:22:54,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 351 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 19:22:54,982 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 155 flow [2025-04-13 19:22:54,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-04-13 19:22:54,983 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-04-13 19:22:54,983 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 155 flow [2025-04-13 19:22:54,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:54,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:54,983 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 19:22:54,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:22:54,983 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 19:22:54,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash -960122225, now seen corresponding path program 1 times [2025-04-13 19:22:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:54,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258742046] [2025-04-13 19:22:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:54,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:22:54,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:22:54,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:54,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:54,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:22:54,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:22:54,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:22:54,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:54,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:22:54,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:22:54,997 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:22:54,997 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:22:54,998 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:22:54,998 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:22:54,998 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:22:54,998 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:22:54,998 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:22:54,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:22:54,998 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:22:54,998 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:22:54,998 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:22:55,026 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:22:55,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 60 transitions, 160 flow [2025-04-13 19:22:55,031 INFO L116 PetriNetUnfolderBase]: 5/68 cut-off events. [2025-04-13 19:22:55,031 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:22:55,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 68 events. 5/68 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 194 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 73. Up to 6 conditions per place. [2025-04-13 19:22:55,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 60 transitions, 160 flow [2025-04-13 19:22:55,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 59 transitions, 158 flow [2025-04-13 19:22:55,032 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:22:55,033 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;@2e4f8df1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:22:55,033 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:22:55,034 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:22:55,035 INFO L116 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-04-13 19:22:55,035 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:22:55,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:22:55,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:22:55,035 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:22:55,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:22:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash 11782009, now seen corresponding path program 1 times [2025-04-13 19:22:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:22:55,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500298528] [2025-04-13 19:22:55,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:22:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:22:55,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:22:55,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:22:55,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:22:55,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:22:55,056 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,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:22:55,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500298528] [2025-04-13 19:22:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500298528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:22:55,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:22:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:22:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845538049] [2025-04-13 19:22:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:22:55,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:22:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:22:55,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:22:55,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:22:55,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 60 [2025-04-13 19:22:55,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:22:55,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 60 [2025-04-13 19:22:55,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand