/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:53:34,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:53:34,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:53:34,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:53:34,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:53:34,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:53:34,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:53:34,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:53:34,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:53:34,360 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:53:34,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:53:34,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:53:34,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:53:34,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:53:34,362 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:53:34,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:53:34,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:53:34,362 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:53:34,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:53:34,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:53:34,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:53:34,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:53:34,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:53:34,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:34,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:53:34,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:34,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:53:34,364 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:53:34,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:53:34,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:53:34,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:53:34,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:53:34,611 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:53:34,613 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 23:53:35,959 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41baeab49/c04b2be487894d049ddd421467795d84/FLAGace0d7eb1 [2025-04-13 23:53:36,198 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:53:36,199 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs.i [2025-04-13 23:53:36,211 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41baeab49/c04b2be487894d049ddd421467795d84/FLAGace0d7eb1 [2025-04-13 23:53:36,960 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41baeab49/c04b2be487894d049ddd421467795d84 [2025-04-13 23:53:36,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:53:36,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:53:36,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:53:36,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:53:36,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:53:36,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:53:36" (1/1) ... [2025-04-13 23:53:36,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a45d26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:36, skipping insertion in model container [2025-04-13 23:53:36,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:53:36" (1/1) ... [2025-04-13 23:53:36,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:53:37,281 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 23:53:37,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:53:37,314 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:53:37,364 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 23:53:37,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:53:37,386 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:53:37,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37 WrapperNode [2025-04-13 23:53:37,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:53:37,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:53:37,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:53:37,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:53:37,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,413 INFO L138 Inliner]: procedures = 166, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2025-04-13 23:53:37,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:53:37,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:53:37,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:53:37,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:53:37,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,427 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-13 23:53:37,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:53:37,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:53:37,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:53:37,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:53:37,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (1/1) ... [2025-04-13 23:53:37,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:53:37,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:53:37,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:53:37,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:53:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:53:37,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:53:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:53:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:53:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:53:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:53:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:53:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:53:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:53:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:53:37,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:53:37,480 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:53:37,562 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:53:37,564 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:53:37,658 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:53:37,659 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:53:37,659 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:53:37,750 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:53:37,754 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:53:37,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:53:37 BoogieIcfgContainer [2025-04-13 23:53:37,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:53:37,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:53:37,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:53:37,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:53:37,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:53:36" (1/3) ... [2025-04-13 23:53:37,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10aa1274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:53:37, skipping insertion in model container [2025-04-13 23:53:37,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:53:37" (2/3) ... [2025-04-13 23:53:37,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10aa1274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:53:37, skipping insertion in model container [2025-04-13 23:53:37,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:53:37" (3/3) ... [2025-04-13 23:53:37,761 INFO L128 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2025-04-13 23:53:37,771 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:53:37,772 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 23:53:37,772 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:53:37,803 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:37,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 16 transitions, 36 flow [2025-04-13 23:53:37,849 INFO L116 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-04-13 23:53:37,851 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:53:37,852 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 23:53:37,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 16 transitions, 36 flow [2025-04-13 23:53:37,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 17 places, 15 transitions, 34 flow [2025-04-13 23:53:37,866 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:37,874 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;@77e14e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:37,874 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:53:37,877 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:37,877 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 23:53:37,877 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:53:37,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:37,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:53:37,878 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:53:37,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash 5443452, now seen corresponding path program 1 times [2025-04-13 23:53:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:37,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150264412] [2025-04-13 23:53:37,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:37,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:37,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:37,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:38,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:38,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150264412] [2025-04-13 23:53:38,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150264412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:38,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:38,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:53:38,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848325271] [2025-04-13 23:53:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:38,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:38,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:38,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:38,058 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2025-04-13 23:53:38,060 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 23:53:38,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:38,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2025-04-13 23:53:38,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:38,114 INFO L116 PetriNetUnfolderBase]: 10/31 cut-off events. [2025-04-13 23:53:38,115 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:53:38,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 31 events. 10/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 5 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 54. Up to 20 conditions per place. [2025-04-13 23:53:38,116 INFO L140 encePairwiseOnDemand]: 12/16 looper letters, 11 selfloop transitions, 2 changer transitions 0/14 dead transitions. [2025-04-13 23:53:38,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 14 transitions, 58 flow [2025-04-13 23:53:38,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-13 23:53:38,127 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2025-04-13 23:53:38,128 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 34 flow. Second operand 3 states and 19 transitions. [2025-04-13 23:53:38,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 14 transitions, 58 flow [2025-04-13 23:53:38,131 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 23:53:38,132 INFO L231 Difference]: Finished difference. Result has 17 places, 13 transitions, 34 flow [2025-04-13 23:53:38,133 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 23:53:38,135 INFO L279 CegarLoopForPetriNet]: 17 programPoint places, 0 predicate places. [2025-04-13 23:53:38,135 INFO L485 AbstractCegarLoop]: Abstraction has has 17 places, 13 transitions, 34 flow [2025-04-13 23:53:38,136 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 23:53:38,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:38,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:53:38,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:53:38,136 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 23:53:38,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash 5443244, now seen corresponding path program 1 times [2025-04-13 23:53:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:38,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781236746] [2025-04-13 23:53:38,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:38,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:38,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:38,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:38,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:38,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:38,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:38,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:38,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:38,172 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:38,173 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:53:38,174 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:53:38,174 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 23:53:38,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:53:38,175 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:53:38,178 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:38,178 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:53:38,199 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:38,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 27 transitions, 64 flow [2025-04-13 23:53:38,209 INFO L116 PetriNetUnfolderBase]: 2/29 cut-off events. [2025-04-13 23:53:38,209 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:53:38,210 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 50 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 23:53:38,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 27 transitions, 64 flow [2025-04-13 23:53:38,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 62 flow [2025-04-13 23:53:38,211 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:38,212 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;@77e14e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:38,212 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:53:38,216 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:38,216 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 23:53:38,216 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:53:38,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:38,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:53:38,216 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:53:38,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:38,217 INFO L85 PathProgramCache]: Analyzing trace with hash 6284550, now seen corresponding path program 1 times [2025-04-13 23:53:38,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:38,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003608287] [2025-04-13 23:53:38,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:38,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:38,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:38,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:38,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:38,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:38,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003608287] [2025-04-13 23:53:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003608287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:38,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:38,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:53:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362697009] [2025-04-13 23:53:38,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:38,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:38,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:38,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:38,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:38,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2025-04-13 23:53:38,258 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 23:53:38,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:38,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2025-04-13 23:53:38,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:38,408 INFO L116 PetriNetUnfolderBase]: 276/472 cut-off events. [2025-04-13 23:53:38,408 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-13 23:53:38,409 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 1558 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 23:53:38,412 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-04-13 23:53:38,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 41 transitions, 177 flow [2025-04-13 23:53:38,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-13 23:53:38,413 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2025-04-13 23:53:38,413 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 62 flow. Second operand 3 states and 47 transitions. [2025-04-13 23:53:38,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 41 transitions, 177 flow [2025-04-13 23:53:38,413 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 23:53:38,416 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 81 flow [2025-04-13 23:53:38,417 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 23:53:38,417 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-04-13 23:53:38,417 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 81 flow [2025-04-13 23:53:38,417 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 23:53:38,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:38,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 23:53:38,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:53:38,418 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:53:38,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1743995197, now seen corresponding path program 1 times [2025-04-13 23:53:38,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:38,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831445575] [2025-04-13 23:53:38,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:38,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:38,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:53:38,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:53:38,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:38,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:38,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:38,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:53:38,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:53:38,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:38,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:38,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:38,451 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:38,451 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:53:38,451 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:53:38,451 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:53:38,451 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:53:38,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:53:38,451 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:53:38,454 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:38,454 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:53:38,479 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:38,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 94 flow [2025-04-13 23:53:38,489 INFO L116 PetriNetUnfolderBase]: 3/42 cut-off events. [2025-04-13 23:53:38,489 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:53:38,491 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 99 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 23:53:38,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 38 transitions, 94 flow [2025-04-13 23:53:38,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 37 transitions, 92 flow [2025-04-13 23:53:38,492 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:38,492 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;@77e14e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:38,492 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:53:38,493 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:38,493 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 23:53:38,493 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:53:38,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:38,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:53:38,494 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:53:38,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:38,494 INFO L85 PathProgramCache]: Analyzing trace with hash 7463952, now seen corresponding path program 1 times [2025-04-13 23:53:38,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:38,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497269375] [2025-04-13 23:53:38,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:38,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:38,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:38,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:38,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:38,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:38,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497269375] [2025-04-13 23:53:38,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497269375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:38,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:38,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:53:38,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076660150] [2025-04-13 23:53:38,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:38,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:38,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:38,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:38,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:38,531 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2025-04-13 23:53:38,531 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 23:53:38,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:38,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2025-04-13 23:53:38,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:39,050 INFO L116 PetriNetUnfolderBase]: 4650/6599 cut-off events. [2025-04-13 23:53:39,050 INFO L117 PetriNetUnfolderBase]: For 566/566 co-relation queries the response was YES. [2025-04-13 23:53:39,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13570 conditions, 6599 events. 4650/6599 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 29407 event pairs, 1585 based on Foata normal form. 0/5721 useless extension candidates. Maximal degree in co-relation 5900. Up to 4836 conditions per place. [2025-04-13 23:53:39,084 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 55 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-04-13 23:53:39,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 268 flow [2025-04-13 23:53:39,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-13 23:53:39,086 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2025-04-13 23:53:39,086 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 92 flow. Second operand 3 states and 67 transitions. [2025-04-13 23:53:39,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 268 flow [2025-04-13 23:53:39,089 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 23:53:39,090 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 118 flow [2025-04-13 23:53:39,090 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 23:53:39,090 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-04-13 23:53:39,090 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 118 flow [2025-04-13 23:53:39,090 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 23:53:39,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:39,091 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 23:53:39,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:53:39,091 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:53:39,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash -766616541, now seen corresponding path program 1 times [2025-04-13 23:53:39,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:39,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496054132] [2025-04-13 23:53:39,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:39,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:39,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:53:39,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:53:39,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:39,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:39,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:39,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:53:39,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:53:39,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:39,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:39,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:39,108 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:39,108 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:53:39,108 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:53:39,108 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:53:39,108 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:53:39,108 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:53:39,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:53:39,109 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:53:39,109 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:39,109 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:53:39,135 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:39,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 126 flow [2025-04-13 23:53:39,141 INFO L116 PetriNetUnfolderBase]: 4/55 cut-off events. [2025-04-13 23:53:39,141 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:53:39,142 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 154 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 23:53:39,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 49 transitions, 126 flow [2025-04-13 23:53:39,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 48 transitions, 124 flow [2025-04-13 23:53:39,143 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:39,144 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;@77e14e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:39,144 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:53:39,145 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:39,145 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 23:53:39,145 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:53:39,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:39,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:53:39,145 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:53:39,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:39,145 INFO L85 PathProgramCache]: Analyzing trace with hash 8982298, now seen corresponding path program 1 times [2025-04-13 23:53:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:39,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314254117] [2025-04-13 23:53:39,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:39,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:39,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:39,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:39,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:39,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314254117] [2025-04-13 23:53:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314254117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:53:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102175581] [2025-04-13 23:53:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:39,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:39,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:39,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:39,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:39,172 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2025-04-13 23:53:39,172 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 23:53:39,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:39,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2025-04-13 23:53:39,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:53:43,223 INFO L116 PetriNetUnfolderBase]: 66772/86549 cut-off events. [2025-04-13 23:53:43,223 INFO L117 PetriNetUnfolderBase]: For 9527/9527 co-relation queries the response was YES. [2025-04-13 23:53:43,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177798 conditions, 86549 events. 66772/86549 cut-off events. For 9527/9527 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 444851 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 23:53:43,608 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 73 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2025-04-13 23:53:43,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 363 flow [2025-04-13 23:53:43,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:53:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:53:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-04-13 23:53:43,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-04-13 23:53:43,611 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 124 flow. Second operand 3 states and 87 transitions. [2025-04-13 23:53:43,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 363 flow [2025-04-13 23:53:43,616 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 23:53:43,617 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 155 flow [2025-04-13 23:53:43,617 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 23:53:43,618 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-04-13 23:53:43,618 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 155 flow [2025-04-13 23:53:43,618 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 23:53:43,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:43,618 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:43,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:53:43,618 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:53:43,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash -803631170, now seen corresponding path program 1 times [2025-04-13 23:53:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:43,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108884273] [2025-04-13 23:53:43,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:43,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:53:43,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:53:43,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:43,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:43,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:53:43,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:53:43,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:53:43,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:43,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:53:43,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:53:43,646 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:53:43,646 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:53:43,646 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:53:43,646 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:53:43,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:53:43,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:53:43,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:53:43,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:53:43,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:53:43,647 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:53:43,647 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:53:43,680 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:53:43,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 60 transitions, 160 flow [2025-04-13 23:53:43,687 INFO L116 PetriNetUnfolderBase]: 5/68 cut-off events. [2025-04-13 23:53:43,687 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:53:43,687 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 8. Compared 207 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 23:53:43,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 60 transitions, 160 flow [2025-04-13 23:53:43,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 59 transitions, 158 flow [2025-04-13 23:53:43,689 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:53:43,690 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;@77e14e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:53:43,690 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:53:43,691 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:53:43,691 INFO L116 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-04-13 23:53:43,691 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:53:43,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:43,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:53:43,692 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:53:43,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 10838628, now seen corresponding path program 1 times [2025-04-13 23:53:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:43,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938851299] [2025-04-13 23:53:43,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:53:43,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:43,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:53:43,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:53:43,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:53:43,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:43,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:43,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938851299] [2025-04-13 23:53:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938851299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:53:43,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:53:43,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:53:43,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445929926] [2025-04-13 23:53:43,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:53:43,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:53:43,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:43,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:53:43,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:53:43,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 60 [2025-04-13 23:53:43,727 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 23:53:43,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:43,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 60 [2025-04-13 23:53:43,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand